Accelerating database queries containing bitmap-based conditions

作者: David E. Walrath , Steven A. Kirk

DOI:

关键词:

摘要: Systems, methods and articles of manufacture for accelerating database queries containing bitmap-based conditions are described herein. An embodiment includes determining a bitmap, where the bitmap represents set rows that have satisfied one or more conjunctive which preceded conjunct is disjunction in query expression restricting evaluation disjunct within to represented by bitmap. Another satisfaction result preceding disjuncts scope not determined In this way, embodiments present invention enable acceleration disjunctions on table, as well reduce temporary resources consumed such queries.

参考文章(11)
Atul Chadha, Ashish Gupta, Venkatesh Harinarayan, Piyush Goel, Balakrishna Raghavendra Iyer, Encoded-vector indices for decision support and warehousing ,(1996)
Michael S. Faunce, Yasunobu Suginaka, Expression tree data structure for representing a database query ,(2008)
Ramakrishnan Srikant, Ching-Tien Ho, Rakesh Agrawal, Method and system for performing partial-sum queries on a data cube ,(1997)
Peter W. White, Clark D. French, Yong Min Chen, Steven A. Kirk, High-speed data base query method and apparatus ,(1997)
Mosha Pasumansky, Multidimensional data ordering ,(1999)
Hakan Jakobsson, Ari Mozes, Fei Ge, Andrew Witkowski, Techniques for eliminating database table joins based on a join index ,(2002)