Constructing balanced multidimensional range-based bitmap indices
作者： Kun-Lung Wu , Philip Shi-lung Yu
DOI:
关键词:
摘要: A computerized method of building balanced ranges attribute values for multiple attributes a database simultaneously without requiring presorting the database. The are used to construct range-based multidimensional bitmap indexes processing complex multipredicate queries against dynamic partition expansion and contraction can indexing tuples having high cardinality even in presence highly skewed data.
lens.org 参考文章(15)
M. Kitsuregawa, M. Takagi, M. Nakayama, The effect of bucket size tuning in the dynamic hybrid GRACE hash join method very large data bases. pp. 257- 266 ,(1989)
Masaru Kitsuregawa, Mikio Takagi, Masaya Nakayama, Hash-Partitioned Join Method Using Dynamic Destaging Strategy very large data bases. pp. 468- 478 ,(1988)
Betty J. Salzberg, David B. Lomet, Concurrency and recovery for index trees with nodal updates using multiple atomic actions by which the trees integrity is preserved during undesired system interruptions ,(1991)
Stanley R. Zanarotti, Frederick A. Powers, Database system with multi-dimensional summary search tree nodes for reducing the necessity to access records ,(1990)
Donald S. Maier, Roberta S. Marton, Pedro Celis, James H. Troisi, Relational database system and method with high data availability during table data restructuring ,(1996)
David M. Choy, Chandrasekaran Mohan, Multi-tiered indexing method for partitioned data ,(1995)
Amnon Waisman, Andrew M. Weiss, B-tree structured data base using sparse array bit maps to store inverted lists ,(1983)
Gennady Antoshenkov, Dynamic index retrieval, bit mapping, and optimization of a single relation access ,(1994)
Sedat Akyürek, Kenneth Salem, Adaptive Block Rearrangement international conference on data engineering. pp. 182- 189 ,(1993)