Data processing: database and file management or data structures – Database and file access – Query optimization
Reexamination Certificate
2011-01-25
2011-01-25
Pham, Khanh B (Department: 2166)
Data processing: database and file management or data structures
Database and file access
Query optimization
C707S715000, C707S718000, C707S719000
Reexamination Certificate
active
07877373
ABSTRACT:
Under automated alternate plan analysis, a query optimizer generates candidate execution plans. The candidate execution plans are selected as alternate execution plans for the query and execution. Output describing characteristics of each alternate execution plan and/or its execution is generated and/or compared. From this information, it may be determined, for example, whether results returned by any of the alternate execution plans are the same and whether the least cost execution plan is actually the most efficiently executed.
REFERENCES:
patent: 4769772 (1988-09-01), Dwyer
patent: 4803614 (1989-02-01), Banba et al.
patent: 4829427 (1989-05-01), Green
patent: 4956774 (1990-09-01), Shibamiya et al.
patent: 5091852 (1992-02-01), Tsuchida et al.
patent: 5251131 (1993-10-01), Masand et al.
patent: 5287459 (1994-02-01), Gniewek
patent: 5301317 (1994-04-01), Lohman et al.
patent: 5315580 (1994-05-01), Phaal
patent: 5325525 (1994-06-01), Shan et al.
patent: 5339429 (1994-08-01), Tanaka et al.
patent: 5379424 (1995-01-01), Morimoto et al.
patent: 5412804 (1995-05-01), Krishna
patent: 5412806 (1995-05-01), Du et al.
patent: 5444820 (1995-08-01), Tzes et al.
patent: 5452468 (1995-09-01), Peterson
patent: 5459837 (1995-10-01), Caccavale
patent: 5469560 (1995-11-01), Beglin
patent: 5495419 (1996-02-01), Rostoker et al.
patent: 5495606 (1996-02-01), Borden et al.
patent: 5504894 (1996-04-01), Fegurson et al.
patent: 5537588 (1996-07-01), Engelmann et al.
patent: 5551027 (1996-08-01), Choy et al.
patent: 5572640 (1996-11-01), Schettler
patent: 5574900 (1996-11-01), Huang et al.
patent: 5590319 (1996-12-01), Cohen et al.
patent: 5642515 (1997-06-01), Jones et al.
patent: 5671403 (1997-09-01), Shekita et al.
patent: 5675791 (1997-10-01), Bhide et al.
patent: 5680547 (1997-10-01), Chang
patent: 5694591 (1997-12-01), Du et al.
patent: 5710915 (1998-01-01), McElhiney
patent: 5764912 (1998-06-01), Rosborough
patent: 5765150 (1998-06-01), Burrows
patent: 5787251 (1998-07-01), Hamilton et al.
patent: 5794227 (1998-08-01), Brown
patent: 5797136 (1998-08-01), Boyer et al.
patent: 5822748 (1998-10-01), Cohen et al.
patent: 5852820 (1998-12-01), Burrows
patent: 5857180 (1999-01-01), Hallmark et al.
patent: 5875445 (1999-02-01), Antonshenkov
patent: 5918225 (1999-06-01), White et al.
patent: 6009265 (1999-12-01), Huang et al.
patent: 6026390 (2000-02-01), Ross et al.
patent: 6026391 (2000-02-01), Osborn et al.
patent: 6026394 (2000-02-01), Tsuchida et al.
patent: 6061676 (2000-05-01), Srivastava et al.
patent: 6205451 (2001-03-01), Norcott et al.
patent: 6289335 (2001-09-01), Downing et al.
patent: 6298342 (2001-10-01), Graefe et al.
patent: 6334128 (2001-12-01), Norcott et al.
patent: 6339768 (2002-01-01), Leung et al.
patent: 6356889 (2002-03-01), Lohman et al.
patent: 6356891 (2002-03-01), Agrawal et al.
patent: 6370524 (2002-04-01), Witkowski
patent: 6430550 (2002-08-01), Leo et al.
patent: 6438558 (2002-08-01), Stegelmann
patent: 6438562 (2002-08-01), Gupta et al.
patent: 6529896 (2003-03-01), Leung et al.
patent: 6529901 (2003-03-01), Chaudhuri et al.
patent: 6684203 (2004-01-01), Waddington et al.
patent: 6694306 (2004-02-01), Nishizawa et al.
patent: 6807546 (2004-10-01), Young-Lai
patent: 6901405 (2005-05-01), McCrady et al.
patent: 6934699 (2005-08-01), Haas et al.
patent: 6941360 (2005-09-01), Srivastava et al.
patent: 6954776 (2005-10-01), Cruanes et al.
patent: 6961729 (2005-11-01), Toohey et al.
patent: 6980988 (2005-12-01), Demers et al.
patent: 6990503 (2006-01-01), Luo et al.
patent: 7089225 (2006-08-01), Li et al.
patent: 7234112 (2007-06-01), Brown et al.
patent: 7246108 (2007-07-01), Ahmed
patent: 7383247 (2008-06-01), Li et al.
patent: 2001/0047372 (2001-11-01), Gorelik et al.
patent: 2002/0038313 (2002-03-01), Klein et al.
patent: 2002/0138376 (2002-09-01), Hinkle
patent: 2002/0188600 (2002-12-01), Lindsay et al.
patent: 2003/0135480 (2003-07-01), Van Arsdale et al.
patent: 2003/0159136 (2003-08-01), Huang et al.
patent: 2003/0212668 (2003-11-01), Hinshaw et al.
patent: 2003/0229639 (2003-12-01), Carlson et al.
patent: 2004/0220911 (2004-11-01), Zuzarte et al.
patent: 2005/0028134 (2005-02-01), Zane et al.
patent: 2005/0055382 (2005-03-01), Ferrat et al.
patent: 2005/0187917 (2005-08-01), Lawande et al.
patent: 2005/0198013 (2005-08-01), Cunningham et al.
patent: 2005/0234965 (2005-10-01), Rozenshtein et al.
patent: 2005/0283471 (2005-12-01), Rafi
patent: 2006/0026115 (2006-02-01), Ahmed
patent: 2006/0026133 (2006-02-01), Ahmed
patent: 2006/0041537 (2006-02-01), Rafi
patent: 2006/0129542 (2006-06-01), Hinshaw et al.
patent: 2006/0218123 (2006-09-01), Chowdhuri et al.
patent: 2008/0228710 (2008-09-01), Muras
patent: 2009/0077016 (2009-03-01), Belknap et al.
patent: 2009/0077017 (2009-03-01), Belknap et al.
Bergsten, et al., “Prototyping DBS3 a Shared-Memory Parallel Database System”, IEEE 818622954, 226-234, 1991, pp. 226-234.
Bhide, Anupam, “An Analysis of Three Transaction Processing Architectures”, Computer Science Division, UC Berkeley, Proceeding of the 14thVLDB Conference,1998, pp. 339-350.
Copeland, George et al., “Data Placement in Bubba,” ACM 0897912683, 1988, pp. 99-108.
Dayal, Umeshwar, “Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates and Quantifiers”, Proceedings of the 13thVLDB Conference, Brighton 1987, pp. 197-208.
Dewitt, et al., “A Performance Analysis of the Gamma Database Machine,” Computer Sciences Department, University of Wisconsin, 1988, pp. 350-360.
Englert, Susan et al., “A Benchmark of NonStop SQL Release 2 Demonstrating Near-Linear Speedup and Scaleup on Large Databases”, Technical Report 89.4, Tandem Part No. 27469, May 1989, pp. 1-23.
Graefe, Goetz, “Encapsulation of Parallelism in the Volcano Query Processing System,” Mar. 1990, pp. 102-111.
Hirano, et al., “Load Balancing Algorithm for Parallel Processing on Shared Memory Multiprocessor”, IEEE, pp. 210-217, 1991.
Hong, et al., “Optimization of Parallel Query Execution Plans in XPRS”, Proceedings of the First International Conference on Parallel and Distributed Information Systems, IEEE, 1991, pp. 218-225.
Leverenz et al., “Oracle 8i Concepts Release 8.1.5- A67781-01”, Oracle Corporation, Feb. 1999, located on the internet at <http://www.csee.umbc.edu/help/oracle8/server.815/a67781/toc.htm>, 122 pages.
Lumpkin, George et al., “Query Optimization in Oracle 9/”, Oracle Corporation, Oracle White Paper, Feb. 2002, pp. 1-30.
Pirahesh, Hamid, et al., “Extensible/Rule Base Query Rewrite Optimization in Starburst”, IBM Almaden Research Center.
Selinger, P. Griffiths, et al., “Access Path Selection in a Relational Database Management System”, Proceedings of the 1979 ACM SIGMOD International Conference on the Management of Data, 1979, pp. 23-34.
Stonebraker, Michael, et al. “The Design of XPRS,” Proceedings of the 14thVLDB Conference, 1988, pp. 318-330.
Tandem, “A Benchmark of NonStop SQL on the Debit Credit Transaction”, The Tandem Performance Group, 1988, pp. 337-341.
Borla-Salamet, Pascale, “Compiling Control into Database Queries for Parallel Execution Management,” IEEE Conference on Parallel Distributed Information Systems, 1991, ISBN 0-8186-2295-4, pp. 271-279.
Chaudhuri, Surajit et al., “Including Group-By in Query Optimization,” Proceedings of the 20thVLDB Conference—1994, pp. 354-366.
Galindo-Legaria, Cesar et al., “Outerjoin Simplification and Reordering for Query Optimization,” ACM Transactions on Database Systems, vol. 22, No. 1, Mar. 1997, pp. 43-74.
Erickson, Gail et al., “Improving Performance with SQL Server 2000 Indexed Views,” Microsoft TechNet, Sep. 2000, located on the Internet at http://www.microsoft.com/technet/prodtechnol/sql/2000/maintain/indexvw.mspx?pf=true, retrieved on Nov. 11, 2006, 14 pages.
Mishra, Priti et al., “Join Processing in Relatio
Bingham Marcel K.
Cheema Azam
Hickman Palermo & Truong & Becker LLP
Oracle International Corporation
Pham Khanh B
LandOfFree
Executing alternative plans for a SQL statement does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Executing alternative plans for a SQL statement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Executing alternative plans for a SQL statement will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2733901