U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Hash-based database grouping system and method

Patent 5511190 Issued on April 23, 1996. Estimated Expiration Date: Icon_subject January 20, 2015. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Relational database management system and method for storing, retrieving and modifying directed graph data structures
Patent #: 5201046
Issued on: 04/06/1993
Inventor: Goldberg, et al.

Methods and apparatus for accesssing non-relational data files using relational queries
Patent #: 5379419
Issued on: 01/03/1995
Inventor: Heffernan, et al.

Database index design based upon request importance and the reuse and modification of similar existing indexes
Patent #: 5404510
Issued on: 04/04/1995
Inventor: Smith, et al.

Extending the semantics of the outer join operator for un-nesting queries to a data base
Patent #: 5412804
Issued on: 05/02/1995
Inventor: Krishna

System for interactive graphical construction of a data base query and storing of the query object links as an object Patent #: 5421008
Issued on: 05/30/1995
Inventor: Banning, et al.

Inventors

Application

No. 376026 filed on 01/20/1995

US Classes:

707/1DATABASE OR FILE ACCESSING

Examiners

Primary: Kulik, Paul V.

Attorney, Agent or Firm

International Class

G06F 017/30

Abstract

A structured query language (SQL) grouping and aggregation system and method that incorporates hash-based techniques, several overflow handling strategies and statistics-based process-selection criteria. The method can execute SQL group-by queries on distributed database tables or tables stored locally to the database management system (DBMS) processor executing the grouping method. Hash-based techniques allow groupings and aggregates to be generated on the fly through the use of partial aggregates maintained in primary memory. Where primary memory is limited, groups and aggregates are still generated for as many groups as can be maintained in primary memory, while various overflow procedures are provided for buffering ungrouped data and writing that data to an overflow disk file for later processing. In one overflow procedure, raw data from groups that cannot be aggregated in primary memory are buffered then written to the overflow disk file. In a second overflow procedure, ungroupable raw data is formatted the same as data being aggregated in the group table, buffered, and then written to the overflow file. In a third overflow procedure, ungroupable raw data is partially aggregated in an output buffer maintained in primary memory before being written to the overflow file maintained in secondary memory. Database table statistics maintained by a cataloger are consulted to determine whether hash-based grouping or conventional sort based grouping should be used to execute a group-by query. The system is adaptable to running a grouping query against a partitioned database on distributed processors.

Other References

  • "Optimizing Parallel Query Plans and Execution"; Harry Leslie; 36th IEEE Computer Society Intl. Conference, Digest of Papers, Spring '91 (Feb. 25-Mar. 1); pp. 105-109
  • "Hash Join Algorithms In A Multiuser Environment", Tandem Technical Report 90.4; Part. No. 40048; Tandem Computers Inc. (1990
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?