Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-07-18
2006-07-18
Channavajjala, Srirama (Department: 2777)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07080062
ABSTRACT:
A method, apparatus, and article of manufacture for optimizing database queries using automatic summary tables. Query execution plans derived from an automatic summary table can be used to generate results for the query if a comparison of the query requirements with an automatic summary table definition determines that the automatic summary table overlaps the query, and if an optimization process determines that using the summary table will lower the cost of the query. The optimization process involves enumerating a plurality of query execution plans for the query, wherein the query execution plans enumerated include those that access combinations of query and summary tables. Each such query execution plan is assigned a cost representing an estimation of its execution characteristics, and the least costly query execution plan is selected for the query.
REFERENCES:
patent: 5345585 (1994-09-01), Iyer et al.
patent: 5548755 (1996-08-01), Leung et al.
patent: 5598559 (1997-01-01), Chaudhuri
patent: 5600829 (1997-02-01), Tsatalos et al.
patent: 5671403 (1997-09-01), Shekita et al.
patent: 5687362 (1997-11-01), Bhargava et al.
patent: 5694591 (1997-12-01), Du et al.
patent: 5758335 (1998-05-01), Gray
patent: 5761657 (1998-06-01), Hoang
patent: 5797000 (1998-08-01), Bhattacharya et al.
patent: 5822747 (1998-10-01), Graefe et al.
patent: 5855019 (1998-12-01), Bhargava et al.
patent: 5899986 (1999-05-01), Ziauddin
patent: 5918232 (1999-06-01), Pouschine et al.
patent: 6023695 (2000-02-01), Osborn et al.
patent: 6023696 (2000-02-01), Osborn et al.
patent: 6026391 (2000-02-01), Osborn et al.
patent: 6115714 (2000-09-01), Gallagher et al.
patent: 6205441 (2001-03-01), Al-omari et al.
patent: 6240406 (2001-05-01), Tannen
patent: 6330564 (2001-12-01), Hellerstein et al.
patent: 6370522 (2002-04-01), Agarwal et al.
patent: 6374234 (2002-04-01), Netz
patent: 6374263 (2002-04-01), Bunger et al.
IBM Research Disclosure, “Implement LDAP Search Queries with SQL”, Document No. 41695, Dec. 1998, pp 1663-1665.
Y. Papakonstantinou et al., “Capabilities-based Query Rewriting in Mediator Systems”, Distributed and Parallel Databases, vol. 6, No. 1, pp 73-110, (1-page Abstract) Only.
C. Ozkan et al., “A Cost Model for Path Expressions in Object-oriented Queries”, Journal of Database Management, vol. 7, No. 3, pp 25-33, Summer 1996, (1-page Abstract) Only.
S. Chaudhuri et al., “Optimizing Queries with Aggregate Views”, Advances in Database Technology—EDBT '96. 5thInternational Conference on Extending Database Technology. Proceedings, pp 167-182, Published: Berlin, Germany, 1996, (1-page Abstract) Only.
S. Chaudhuri et al., “Query Optimization in the Presence of Foreign Functions”, 19thInternational Conference on Very Large Data Bases. Proceedings, pp 529-542, Published: Palo Alto, California, USA, 1993, (1-page Abstract) Only.
J. Strivastava et al., “Optimizing Multi-joint Queries in Parallel Relational Databases”, Proceedings of the Second International Conference on Parallel and Distributed Information Systems (Cat. No. 93TH0493-7) pp 84-92, Published: Los Alamitos, California, USA, 1993, (1-page Abstract) Only.
G. Gardarin et al., “Optimizing Object-oriented Database Queries Using Cost-controlled Rewriting”, Advances in Database Technology—EDBT '92. 3rdInternational Conference on Extending Database Technology Proceedings, pp. 534-539, Published: Berlin, Germany, 1992, (1-page Abstract) Only.
H. L. Yann, “Adaptive Access Path Selection for Relational Database Systems”, Computer Systems Science and Engineering, vol. 7, No. 1, pp. 52-61, Jan. 1992, (1-page Abstract) Only.
S. Ganguly et al., “Query Optimization for Parallel Execution,” Proc of the 1992 ACM Sigmod Conf, 1992, 10 pp.
G.M. Lohman et al., “Grammar-Like Functional Rules for Representing Query Optimization Alternatives,” Proc of ACM Sigmod Conf, May 1988, 10 pp.
H. Pirahesh et al., “Extensible/Rule Based Query Rewrite Optimization in Starburst,” Proc of ACM Sigmod '92 Int'l Conf on Management of Data, San Diego, 1992, 10 pp.
P.G. Selinger et al., “Access Path Selection in a Relational Database Management System,” Proc of the ACM Sigmod Int'l Conf on Management of Data, Boston, Jun. 1979, 12 pp.
D. Simmen et al., “Fundamental Techniques for Order Optimization,” Proc of the ACM Sigmod Int'l Conf on Management Data, Montreal, Jun. 1996, 14 pp.
Leung Ting Yu
Simmen David E.
Sun Yang
Channavajjala Srirama
Gates & Cooper LLP
International Business Machines - Corporation
LandOfFree
Optimizing database queries using query execution plans... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Optimizing database queries using query execution plans..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing database queries using query execution plans... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3595987