Range-based bitmap indexing for high cardinality attributes with skew

Proceedings - International Computer Software and Applications Conference

Volumn , Issue , 1998, Pages 61-66

  Wu, Kun Lung ^a   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; INDEXING (OF INFORMATION);

ATTRIBUTE VALUES; BITMAP INDEXING; DYNAMIC BUCKET; EXPANSION AND CONTRACTION; OPTIMAL APPROACHES; SIMPLE APPROACH; STORAGE OVERHEAD; SYNTHETIC AND REAL DATA;

DIGITAL STORAGE;

EID: 85046008501     PISSN: 07303157     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CMPSAC.1998.716637     Document Type: Conference Paper

References (18)

1. Y. Zhuge et al., "View maintenance in a warehousing environment," in Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp. 316-327, 1995.
2. C. D. French, ""One size fits all" database architectures do not work for DSS," in Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp. 449-450, 1995.
3. G. Hallmark, "The oracle warehouse," in Proc. of Very Large Data Bases, pp. 707-709, 1995.
4. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Communications of the ACM, vol. 18, no. 9, pp. 509-517, Sept. 1975.
5. J. Robinson, "The K-D-B-tree: A search structure for large multidimensional dynamic indexes," in Proc. of 1981 ACM SIGMOD, pp. 10-18, 1981.
6. D. B. Lomet and B. Salzberg, "The hB-tree: A multiattribute indexing method with good guaranteed performance," ACM Trans, on Database Systems, vol. 15, no. 4, pp. 625-658, 1990.
7. II-tree: A modified hB-tree supporting concurrency, recovery and node consolidation," in Proc. of Very Large Data Bases, pp. 551-561, 1995.
8. A. Guttman, "R-trees: A dynamic index structure for spatial searching," in Proc. of 1984 ACM SIGMOD, pp. 47-57, 1984.
9. +-tree: A dynamic index for multi-dimensional objects," in Proc. of 13th VLDB Conference, pp. 507-518, 1987.
10. J. Nievergelt, H. Hinterberger, and K. C. Sevcik, "The grid file: An adaptable, symmetric multikey file structure," ACM Trans, on Database Systems, vol. 9, no. 1, pp. 38-71, 1984.
11. M. Freeston, "The BANG file: a new kind of grid file," in Proc. of 1981 ACM SIGMOD, pp. 260-269, 1987.
12. D. E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching. Addison-Wesley, 1973.
13. P. O'Neil and D. Quass, "Improved query performance with variant indexes," in Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp. 38-49, 1997.
14. M.-C. Wu and A. P. Buchmann, "Encoded bitmap indexing for data warehouses," in Proc. of Int. Conf. on Data Engineering, pp. 220-230, 1998.
15. D. J. DeWitt and R. Gerber, "Multiprocessor hash-based join algorithms," in Proc. of Very Large Data Bases, pp. 151-164, 1985.
16. M. Kitsuregawa, M. Nakayama, and M. Takagi, "The effect of bucket size tuning in the dynamic hybrid GRACE hash join method," in Proc. of Very Large Data Bases, pp. 257-266, 1990.
17. K.-L. Wu and P. S. Yu, "Range-based bitmap indexing for high cardinality attributes with skew," tech. rep., IBM Research Report, RC 20449, 1996.
18. R. Graham, "Bounds on multiprocessing timing anomalies," SIAM Journal of Computing, vol. 17, pp. 416-429, 1969.