Patent · US Expired

Using overlapping partitions of data for query optimization

US6014656A · kind A · utility

75Cited by
9References
37Claims
0Family size

Assignee

Inventors

Key dates

Filing dateJun 21, 1996
Grant dateJan 11, 2000
Priority date
Expiry dateJun 21, 2016

Classification

  • Technology area (CPC Y)Emerging Cross-Sectional Technologies
  • CPC primaryY10S707/99938
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

A method and apparatus for executing queries on a set of data that has been partitioned into a plurality of partitions based on a partitioning key is provided. A query is received that includes a reference to a second key. The second key is not part of the partitioning key but has a predetermined correlation with the partitioning key. This second key is referred to as an overlapping partition key. A subset of the plurality of partitions is selected to be scanned based on the reference to the second key and the predetermined correlation with the partitioning key. The query is then executed by scanning only those partitions of the plurality of partitions that belong to the subset of partitions. The overlapping partition key provides for reduced query execution time even when the partitioning key is not directly involved in the query. Specifically, the overlapping partition key permits a partial table scan in situations that would require a fill table scan with partitioning alone.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.