Patent application number | Description | Published |
20120173498 | Verifying Correctness of a Database System - The invention provides a method for verifying correctness of a database system, comprising: receiving SQL instruction; extending access paths of the received SQL instruction; executing the SQL instruction by using the extended access paths; and verifying correctness of the database system according to result of executing the SQL instruction. With the method and system of the invention, the object of verifying correctness of a database system by automatically extending access paths of SQL statement may be achieved, and the object of verifying correctness of a database system scientifically, effectively and purposefully based on ratio of error or defect present in database itself due to various data manipulation approaches (different values of access path elements) may also be achieved. | 07-05-2012 |
20120221577 | METHOD OF AND APPARATUS FOR ORGANIZING DATA RECORDS IN A RELATIONAL DATABASE - Embodiments of the invention relate to organizing data records in a relational database. An aspect of the invention includes creating index items for a plurality of data records. Each index item includes a counter and the creating results in a plurality of counters. The numerical values of counters in corresponding index items are updated for data records in the plurality of data records that are subjected to random access. The plurality of data records are reorganized based upon the numerical values of the plurality of counters. | 08-30-2012 |
20120278305 | DYNAMIC MERGING OF EXECUTABLE STRUCTURES IN A DATABASE SYSTEM - Embodiments of the present invention relate to dynamically merging executable structures in a database system. In one embodiment, there is provided a method of dynamically merging executable structures in a database system that includes, in response to a query to the database system, extracting a stem and a branch of a query statement. The query statement includes query conditions, and the branch includes at least a subset of the query conditions. An executable structure of the stem is obtained from a cache of the database system, and an executable structure of the branch is generated. The executable structure of the stem and the executable structure of the branch are merged into a runtime executable structure. | 11-01-2012 |
20130117332 | DATABASE LARGE OBJECT REORGANIZATION - Embodiments of the invention relate to database large object (LOB) reorganization. An aspect of the invention includes calculating an activity of an inline LOB. The length of an inline LOB is redefined according to the activity of the inline LOB. LOB reorganization is performed based on the redefined length of the inline LOB. | 05-09-2013 |
20130138630 | ESTIMATION OF A FILTER FACTOR USED FOR ACCESS PATH OPTIMIZATION IN A DATABASE - A computer program product and method for estimating a filter factor for access path optimization in a database are provided. The method includes extracting from a statement segment for database query a relation condition which defines the relationship between a variable and a first table. The method includes obtaining first statistics information according to the relation condition and the statistics information of the first table. The method includes extracting from the statement segment a filter condition which defines the relationship between the variable and a second table. The method includes obtaining second statistics information according to the filter condition and the statistics information of the second table, and according to the first statistics information and the second statistics information, estimating the filter factor of the filter condition. The method and computer program product according to the embodiments of the disclosure may more accurately estimate filter factor of the filter condition. | 05-30-2013 |
20130159353 | GENERATING A TEST WORKLOAD FOR A DATABASE - A method of transferring files in a data-processing network using a current node within the network includes reading an outbound content and outbound characteristics of an outbound file. An outbound message is created having outbound strings including a first set of the outbound strings representing the outbound characteristics and a second set of the outbound strings representing the outbound content. The outbound message is sent to a receiver node within the network. An inbound message is received from a sender node within the network. The inbound message has inbound strings including a first set of the inbound strings representing inbound characteristics and a second set of the inbound strings representing inbound content. An inbound file having the inbound content is stored, and the inbound characteristics are applied to the inbound file. | 06-20-2013 |
20160055156 | DATABASE QUERY CACHING AND REUSE - A query block may be cached, not like the traditional solution, which can only cache a query result for the query block. For example, a work file for storing a result set of a query block may be maintained after relevant query has been completed. In subsequent use, once a query for the query block is received, query may be processed quickly by directly reusing the result set. In this way, the data overheads for reducing the query processing can be significantly reduced, and the response time for shorting the query processing can be shortened. Corresponding methods and systems are described in the present disclosure. | 02-25-2016 |
20160110393 | DATABASE INDEXES - A method and system for database indexing, wherein a database index comprises at least one index include. The method and system includes obtaining the number of executions of each of a plurality of Structured Query Language (SQL) statements within a certain time period, respectively, wherein the plurality of SQL statements use the database index. For each of the at least one index include, calculating a number of hits of the index include according to the number of executions of each of the plurality of SQL statements. Further, obtaining a length of the index include, and calculating a hit frequency of the index include by using the number of hits and the length of the index include. The hit frequency equals the number of hits divided by the length. | 04-21-2016 |