Concurrency for executing OLTP and OLAP queries on tables stored in columnar format

By employing a primary B+ index with specific locks and temporary memory allocation for old data, the system achieves improved concurrency for executing OLTP and OLAP queries on columnar-format tables, addressing existing concurrency challenges and ensuring data integrity.

WO2025022157A2PCT designated stage expired Publication Date: 2025-01-30SHARMA PRATIK
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/IB2023/057507
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-07-24
Publication Date
2025-01-30

AI Technical Summary

Technical Problem

Existing systems face challenges in improving concurrency for executing both Online Transaction Processing (OLTP) and Online Analytical Processing (OLAP) queries on tables stored in columnar format, as they struggle to efficiently manage locks and data versions.

Method used

The use of primary B+ index with S-lock, X-lock, and S-X lock, similar to the primary B+ tree index of open source MySQL, along with temporary memory allocation for old column data to support Multi-Version Concurrency Control (MVCC), enables parallel execution of OLTP and OLAP queries.

Benefits of technology

This approach enhances concurrency by allowing simultaneous execution of OLTP and OLAP queries, while ensuring data integrity through effective lock management and efficient purging of stale data versions.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Concurrency for Executing OLTP and OLAP Queries on Tables Stored in Columnar Format

[0002] Here in this invention, for tables stored in columnar format to improve concurrency for executing Online Transaction Processing (OLTP) and Online Analytical Processing (OLAP) queries in parallel, we use the primary B+ index with S-lock (shared lock), X-lock (exclusive lock) and S-X lock (shared exclusive lock) like used in the primary B+ tree index of open source MySQL. Further for updates to column data and for deletes we temporarily allocate memory to store old or stale column data so that the Multi- Version Concurrency Control (MVCC) component of the database system can reference it, which after serving certain older timestamp queries is purged or garbage collected from the system.

Claims

Following are the claims for this invention1. Here, for tables stored in columnar format to improve concurrency for executing Online Transaction Processing (OLTP) and Online Analytical Processing (OLAP) queries in parallel, we use the primary B+ index with S-lock (shared lock), X- lock (exclusive lock) and S-X lock (shared exclusive lock) like used in the primary B+ tree index of open source MySQL.

2. Further for updates to column data and for deletes we temporarily allocate memory to store old or stale column data so that the Multi- Version Concurrency Control (MVCC) component of the database system can reference it, which after serving certain older timestamp queries is purged or garbage collected from the system.