Table organization using one or more queries
作者： Brian R. Muras
DOI:
关键词:
摘要: A method, system and computer program product are provided for reorganizing a database table according to set of queries. More specifically, the is reorganized such that random I/O reduced by more tightly grouping together rows in associated with each referencing This enables from given relevant query be read into memory operation.
lens.org 参考文章(34)
Harumi Kuno, Goetz Graefe, Janet L. Wiener, Query plan analysis of alternative plans using robustness mapping ,(2009)
Carlos Bouloy, Grace Au, Hong Gui, Query processing using horizontal partial covering join index ,(2008)
David E. Walrath, Steven A. Kirk, Accelerating database queries containing bitmap-based conditions ,(2010)
Surendra Verma, John R. Dietrick, Karan Mehra, Efficient access to storage devices with usage bitmaps ,(2013)
Brian Robert Muras, Paul Reuben Day, Method, query optimizer, and computer program product for implementing live switchover to temporary sparse index for faster query performance ,(2003)
Gary Howard Sockut, Thomas Abel Beavin, Interaction between application of a log and maintenance of a table that maps record identifiers during online reorganization of a database ,(1995)
Ewout Brandsma, Sparse index search method ,(1998)
Brian R. Muras, Multiple sparse index intelligent table organization ,(2011)
Mrithyunjaya Annapragada, Improvements to query execution in a parallel elastic database management system ,(2013)
Anurag Windlass Gupta, Efficient query processing in columnar databases using bloom filters ,(2015)