Database Query Processing via Pointer-Based Change Tracking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Database management systems face inefficiencies in processing queries due to factors like query type, database size, and client load, which can lead to delayed responses and inefficient change management.
Innovation Solution
The database management system optimizes query processing by writing change entries to a designated location instead of directly modifying row entries, allowing subsequent queries to reference these changes for current state retrieval, thereby improving query efficiency and client caching.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the database management system writes change entries to a designated location and uses pointers instead of directly modifying row entries, then query processing efficiency is improved and client caching is enhanced, but the device complexity increases due to the additional pointer management and change location structure
Solution Approach 1:
The patent segments the data storage structure by separating the actual data values from the change tracking mechanism. Row entries contain only pointers to change locations rather than storing complete data values, dividing the storage system into data value storage (change locations) and reference storage (row entries with pointers). This segmentation enables efficient query processing by allowing clients to cache row entries locally and retrieve only change information from the server.
Solution Approach 2:
The patent implements preliminary action by pre-allocating change locations and establishing the pointer-based structure in advance. Change entries are written to designated locations before being referenced by row entries, and the pointer infrastructure is set up beforehand to enable efficient change tracking. This preliminary structuring allows subsequent queries to quickly identify and retrieve only the necessary change information without scanning entire datasets.
2Measurement precision
If the system loads multiple row entries into memory to answer queries, then query response accuracy is improved, but the memory usage and processing time increase with database size
Solution Approach 1:
The patent extracts the essential query information from full row entries by using pointers to reference change locations. Instead of loading and processing complete row entry data into memory, the system extracts only the necessary change information from designated locations using pointer references. This extraction principle allows clients to determine current data states without loading unnecessary data, significantly reducing memory usage and processing time while maintaining query result accuracy.
3Ease of operation
If the database management system directly modifies row entries, then the operation simplicity is maintained, but the ability to track and manage changes efficiently is reduced
Solution Approach 1:
The patent introduces an intermediary mechanism between data modification and storage by using pointers as intermediate references. When data is modified, the system writes change entries to designated locations and updates pointers in row entries to reference these changes, rather than directly modifying the stored data values. This intermediary pointer system simplifies modification operations by providing a standardized change tracking interface while simultaneously enabling efficient change management and client caching through the pointer reference structure.
Data Source
AI summary
Various examples are directed to systems and methods for managing a database organized according to a schema. The database may comprise a database file corresponding to a table described by the schema. The database file may comprise a first row entry corresponding to a first row of the table. The first row entry may comprise at least one data item. A command may be received. The command may modify a first data item in the first row of the table. An indication of the modified value for the first data item may be written to a change location at the first file. The first entry may be modified to include a pointer to the indication of the modified value for the first data item.