Breaking the Curse of Cardinality on Bitmap Indexes-Reference-Cited by-同舟云学术

Breaking the Curse of Cardinality on Bitmap Indexes

Published: Issue: Volume: Page:348-365
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Wu Kesheng,Stockinger Kurt,Shoshani Arie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-69497-7_23.pdf

Reference26 articles.

1. Berchtold, S., Böhm, C., Kriegal, H.P.: The pyramid-technique: Towards breaking the curse of dimensionality. SIGMOD Record 27(2), 142–153 (1998)

2. O’Neil, P.: Model 204 architecture and performance. In: Second International Workshop in High Performance Transaction Systems. Springer, Heidelberg (1987)

3. O’Neil, P., Quass, D.: Improved query performance with variant indices. In: SIGMOD. ACM Press, New York (1997)

4. Wu, K., Otoo, E.J., Shoshani, A.: On the performance of bitmap indices for high cardinality attributes. In: VLDB, pp. 24–35. Morgan Kaufmann, San Francisco (2004)

5. Wu, K., Otoo, E., Shoshani, A.: A performance comparison of bitmap indices. In: CIKM. ACM Press, New York (2001)

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compact-index;Proceedings of the 17th International Conference on emerging Networking EXperiments and Technologies;2021-12-02

2. Fast detection of denial constraint violations;Proceedings of the VLDB Endowment;2021-12

3. Big high-dimension data cube designs for hybrid memory systems;Knowledge and Information Systems;2020-08-26

4. A Closed Frag-Shells Cubing Algorithm on High Dimensional and Non-Hierarchical Data Sets;Proceedings of the 12th International Conference on Ubiquitous Information Management and Communication;2018-01-05

5. A novel Bit Vector Product algorithm for mining frequent itemsets from large datasets using MapReduce framework;Cluster Computing;2017-10-14