Managing performance of a database query

Data processing: database and file management or data structures – Database and file access – Query optimization

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S999003

Reexamination Certificate

active

07840556

ABSTRACT:
Provided are, among other things, systems, methods and techniques for processing database queries, such as the following. A current database query to be executed is obtained, and a plan for executing the current database query is generated. A cluster that includes at least one previously executed database query is identified, based on similarity of the plan for executing the current database query to execution-plan information representing the cluster. Then, a query-execution characteristic is assigned to the current database query based on corresponding characteristic information representing the cluster, and performance of the current database query is managed based on the query-execution characteristic.

REFERENCES:
patent: 6092062 (2000-07-01), Lohman et al.
patent: 6529901 (2003-03-01), Chaudhuri et al.
patent: 6845380 (2005-01-01), Su et al.
patent: 7415455 (2008-08-01), Karn et al.
patent: 7577667 (2009-08-01), Hinshaw et al.
patent: 2003/0061244 (2003-03-01), Hirohata
patent: 2003/0172059 (2003-09-01), Andrei
patent: 2005/0119999 (2005-06-01), Zait et al.
patent: 2006/0167865 (2006-07-01), Andrei
patent: 2008/0195577 (2008-08-01), Fan et al.
patent: 2009/0024563 (2009-01-01), Sengar
patent: 2010/0082602 (2010-04-01), Ganapathi et al.
Yao, Z., Chen, C. M., and Roussopoulos, N. 1996 Adaptive Cost Estimation for Client-Server Based Heterogeneous Database Systems. Technical Report. UMI Order No. CS-TR-3648., University of Maryland at College Park.
“Plastic: PLAn Selection Through Incremental Clustering”, printed out from http://dsl.serc.iisc.ernet.in/projects/PLASTIC/index.html on Jul. 22, 2007.
Kave Eshghi, Hsiu Khuern Tang, “A Framework for Analyzing and Improving Content-Based Chunking Algorithms”, HPL-2005-30R1, 20051005.
Ghosh, A., Parikh, J., Sengar, V. S., and Haritsa, J. R. 2002. Plan selection based on query clustering. In Proceedings of the 28th international Conference on Very Large Data Bases—vol. 28 (Hong Kong, China, Aug. 20-23, 2002). Very Large Data Bases. VLDB Endowment, 179-190.
Song, In-sang; Paik, Ju-ryun; Kim, Ung-mo, “Semantic-based Similarity Computation for XML Document”, Multimedia and Ubiquitous Engineering, 2007. MUE '07. International Conference on, pp. 796-803, Apr. 2007.
Val Henson and Richard Henderson “Guidelines for Using Compare-by-hash”, http://infohost.nmt.edu/˜val/review/hash2.html, Last updated: Thu Oct. 21 01:25:42 MDT 2004.
Val Henson, “An Analysis of Compare-by-hash”, http://www.usenix.org/events/hotos03/tech/full—papers/henson/henson—html/hash.html, Jun. 16, 2003.
Reddy, N. and Haritsa, J. R. 2005. Analyzing plan diagrams of database query optimizers. In Proceedings of the 31st international Conference on Very Large Data Bases (Trondheim, Norway, Aug. 30-Sep. 2, 2005). Very Large Data Bases. VLDB Endowment, 1228-1239.
Tree Edit Distance, Alignment Distance and Inclusion by Philip Bille, IT University Technical Report Series, TR-2003-23 dated Mar. 2003 (p. 1-22).
Algorithms for Approximate String Matching by Esko Ukkonen, Information and Control, Academic Press, vol. 64, Nos. 1-3, Jan./Feb./Mar. 1985 (19 pages).
A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins, Needleman et al., J. Mol. Biol. (1970) 48, (p. 443-453).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Managing performance of a database query does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Managing performance of a database query, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Managing performance of a database query will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4233649

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.