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

Method for executing star queries

Patent 5848408 Issued on December 8, 1998. Estimated Expiration Date: Icon_subject February 28, 2017. 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

Component intersection data base filter
Patent #: 5249262
Issued on: 09/28/1993
Inventor: Baule

Computer automated system and method for optimizing the processing of a query in a relational database system by merging subqueries with the query
Patent #: 5367675
Issued on: 11/22/1994
Inventor: Cheng, et al.

Query optimizer system that detects and prevents mutating table violations of database integrity in a query before execution plan generation
Patent #: 5546576
Issued on: 08/13/1996
Inventor: Cochrane, et al.

Program storage device and computer program product for outer join operations using responsibility regions assigned to inner tables in a relational database
Patent #: 5551031
Issued on: 08/27/1996
Inventor: M. Cheng, et al.

Outer join operations using responsibility regions assigned to inner tables in a relational database
Patent #: 5557791
Issued on: 09/17/1996
Inventor: Cheng, et al.

Database system with subquery optimizer
Patent #: 5668987
Issued on: 09/16/1997
Inventor: Schneider

Global optimization of correlated subqueries and exists predicates Patent #: 5761657
Issued on: 06/02/1998
Inventor: Hoang

Inventors

Application

No. 808621 filed on 02/28/1997

US Classes:

707/3, Query processing (i.e., searching)707/2Access augmentation or optimizing

Examiners

Primary: Black, Thomas G.
Assistant: Wallace, Michael J. Jr.

Attorney, Agent or Firm

International Class

G06F 017/30

Abstract

A method and apparatus for processing star queries is provided. According to the method, a star query is transformed by adding to the star query subqueries that are not in the query. The subqueries are generated based on join predicates and constraints on dimension tables that are contained in the original query. The subqueries are executed, and the values returned by the subqueries are used to access one or more bitmap indexes built on columns of the fact table. The bitmaps retrieved for the values returned by each subquery are merged to create one subquery bitmap per subquery. An AND operation is performed on the subquery bitmaps, and the resulting bitmap is used to determine which data to retrieve from the fact table.

Other References

  • Zhao et al. "Array-Based Evaluation of Multi-Dimensional Queries in Object-Relational Database Systems" IEEE, pp. 241-249, Feb. 1998
  • Haas "Sampling-Based Selectivity Estimation for Joins Using Augmented Frequent Value Statistics" IEEE, pp. 522-531, Jan. 1996
  • Baekgaard et al. "Incremental Computation of Nested Relational Query Expressions" ACM Transactions on Database Systems, vol. 20, No. 2, pp. 111-148, Jun. 1995
  • Christophicles et al. "Querying Structured Documents with Hypertext Links using OODBMS" ECHT '94 Proceedings, pp. 188-197, Sep. 199
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?