Swapping expected and candidate affinities in a query plan cache
作者： Brian R. Muras , Mark W. Theuer , Rafal P. Konik , Roger A. Mittelstadt
DOI:
关键词:
摘要: In an embodiment, a hit percentage of expected affinity for first query is calculated, wherein the comprises address range in plan cache, candidate second and if greater than by more threshold amount, plans are swapped with affinity.
lens.org 参考文章(41)
David Luick, Reduction of cache miss rates using shared private caches ,(2003)
Thomas William Blamer, Andrew Peter Passe, Kevin James Kathmann, Ulrich Thiemann, Wei Hu, Shantan Kethireddy, Maintained and Reusable I/O Value Caches ,(2008)
Andrew Peter Passe, Ulrich Thiemann, Wei Hu, Robert Joseph Bestgen, Shantan Kethireddy, Robert Victor Downer, Advising the generation of a maintained index over a subset of values in a column of a table ,(2006)
Ramanujam Seshadri Halasipuram, Edwin Anthony Seputis, Query Optimization with Memory I/O Awareness ,(2009)
Vijayanth Devadhar, System, method and computer program product for transporting a task to a handler, utilizing a queue ,(2011)
Vivek R. Narasayya, Surajit Chaudhuri, Ravishankar Ramamurthy, Exploiting execution feedback for optimizing choice of access methods ,(2007)
Edwin Anthony Seputis, Mihnea Andrei, Xun Cheng, Xiao Ming Zhou, System and methodology for automatic tuning of database query optimizer ,(2007)
Brian Robert Muras, Paul Reuben Day, Shawn Joseph Baranczyk, Method, Apparatus, and Computer Program Product for Intelligent Open Query Cursor Management ,(2007)
Junichi Tatemura, Vahit Hakan Hacigumus, Ning Zhang, Cost-effective data layout optimization over heterogeneous storage classes ,(2011)
Fabian Hueske, Volker Gerhard Markl, None, Automatically determining optimization frequencies of queries with parameter markers ,(2008)