A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A computer-implemented method comprising: providing in a non-transitory computer readable storage medium, a database created in an application level language and comprising a first one-dimensional row partitioned store data structure including a row store index, the database further comprising a second one-dimensional column partitioned store data structure; receiving a new record for insertion into the database; inserting the new record into the row partitioned store according to the row store index; checking a uniqueness violation of the new record in the column partitioned store only where a scalable Bloom filter maintained for unique columns, returns a TRUE result; receiving a query from a user; searching the row partitioned store based upon a search condition of the query; searching the second one-dimensional column partitioned store data structure based upon the query; and returning to the user a search result based on the query, wherein the search result includes the new record and is formed by merging a search result of the row partitioned store with a search result of the column partitioned store.
2. The computer-implemented method of claim 1 wherein the search condition comprises a key.
3. The computer-implemented method of claim 2 wherein the key comprises a private key.
4. The computer-implemented method of claim 2 wherein the key comprises a unique key.
5. The computer-implemented method of claim 1 further comprising maintaining a boundary condition of the column partition to limit access for future searching.
6. A non-transitory computer readable storage medium embodying a computer program for performing a method, said method comprising: providing a database created in an application level language and comprising a first one-dimensional row partitioned store data structure including a row store index, the database further comprising a second one-dimensional column partitioned store data structure; receiving a new record for insertion into a database; inserting the new record into the row partitioned store according to the row store index; checking a uniqueness violation of the new record in the column partitioned store only where a scalable Bloom filter maintained for unique columns, returns a TRUE result; receiving a query from a user; searching the first one-dimensional row partitioned store data structure of a database based on a search condition of the query; searching the second one-dimensional column partitioned store data structure based upon the query; and returning to the user a search result based on the query, wherein the search result includes the new record and is formed by merging a search result of the row partitioned store with a search result of the column partitioned store.
7. The non-transitory computer readable storage medium of claim 6 wherein the search condition comprises a key.
8. The non-transitory computer readable storage medium of claim 7 wherein the key comprises a private key.
9. The non-transitory computer readable storage medium of claim 7 wherein the key comprises a unique key.
10. The non-transitory computer readable storage medium of claim 6 further comprising maintaining a boundary condition of the column partition to limit access for future searching.
11. A computer system comprising: one or more processors; a software program, executable on said computer system, the software program configured to: provide in a non-transitory computer readable storage medium, a database created in an application level language and comprising a first one-dimensional row partitioned store data structure including a row store index, the database further comprising a second one-dimensional column partitioned store data structure; receiving a new record for insertion into a database; inserting the new record into the row partitioned store according to the row store index; checking a uniqueness violation of the new record in the column partitioned store only where a scalable Bloom filter maintained for unique columns, returns a TRUE result; receive a query from a user; search the first one-dimensional row partitioned store data structure of a database based on a search condition of the query; search the second one-dimensional column partitioned store data structure based upon the query; and return to the user a search result based on the query, wherein the search result includes the new record and is formed by merging a search result of the row partitioned store with a search result of the column partitioned store.
12. The computer system of claim 11 wherein the search condition comprises a key.
13. The computer system of claim 12 wherein the key comprises a private key or a unique key.
14. The computer system of claim 11 wherein the software program is further configured to maintain a boundary condition of the column partition to limit access for future searching.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
November 17, 2014
October 11, 2016
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.