Hierarchical bitmap index: An efficient and scalable indexing technique for set-valued attributes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2798, Issue , 2003, Pages 236-252

  Morzy, Mikołaj ^a   Morzy, Tadeusz ^a   Nanopoulos, Alexandros ^b   Manolopoulos, Yannis ^b  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DIGITAL STORAGE; INDEXING (OF INFORMATION); QUERY PROCESSING; TREES (MATHEMATICS);

INDEXING TECHNIQUES; MODEL COMPLEXES; NOVEL TECHNIQUES; RELATIONAL TABLES; SET-VALUED ATTRIBUTES; SET-VALUED DATUM; SIMILARITY QUERY; VERY LARGE DATABASE;

RELATIONAL DATABASE SYSTEMS;

EID: 26944456082     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39403-7_19     Document Type: Article

References (17)

1. R. Agrawal, M. J. Carey, C. Faloutsos, S. P. Ghosh, M. A. W. Houtsma, T. Imielinski, B. R. Iyer, A. Mahboob, H. Miranda, R. Srikant, and A. N. Swami. Quest: A project on database mining. In R. T. Snodgrass and M. Winslett, editors, Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, page 514, Minneapolis, Minnesota, may 1994. ACM Press.
2. M. D. Araujo, G. Navarro, and N. Ziviani. Large text searching allowing errors. In R. Baeza-Yates, editor, Proceedings of the 4th South American Workshop on String Processing, pages 2-20, Valparaiso, Chile, 1997. Carleton University Press.
3. C. Y. Chan and Y. E. Ioannidis. Bitmap index design and evaluation. In L. M. Haas and A. Tiwary, editors, Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 355-366, Seattle, Washington, jun 1998. ACM Press.
4. S. Christodoulakis and C. Faloutsos. Signature files: an access method for documents and its analytical performance evaluation. ACM Transactions on Office Information Systems, 2(4):267-288, 1984.
5. D. Comer. The ubiquitous b-tree. ACM Computing Surveys, 11(2):121-137, 1979.
6. U. Deppisch. S-tree: a dynamic balanced signature index for office retrieval. In Proceedings of the Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 77-87, Pisa, Italy, 1986. ACM.
7. C. Faloutsos. Signature files. In Information Retrieval: Data Structures and Algorithms. Prentice Hall, 1992.
8. M. Freeston, S. Geffner, and M. H rhammer. More bang for your buck: A performance comparison of bang and r* spatial indexing. In Proceedings of the Tenth International Conference on Database and Expert Systems Applications DEXA '99, volume 1677 of Lecture Notes in Computer Science, pages 1052-1065. Springer, 1999.
9. A. Gionis, D. Gunopulos, and N. Koudas. Efficient and tunable similar set retrieval. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data. ACM Press, jun 2001.
10. A. Guttman. R-trees: A dynamic index structure for spatial searching. In B. Yormark, editor, SIGMOD'84, Proceedings of Annual Meeting, pages 47-57, Boston, Massachusetts, jun 1984. ACM Press.
11. J. M. Hellerstein and A. Pfeffer. The rd-tree: An index structure for sets. Technical Report 1252, University of Wisconsin at Madison, 1994.
12. S. Helmer and G. Moerkotte. A study of four index structures for set-valued attributes of low cardinality. Technical Report 2/99, Universität Mannheim, 1999.
13. Y. Ishikawa, H. Kitagawa, and N. Ohbo. Evaluation of signature files as set access facilities in oodbs. In P. Buneman and S. Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 247-256, Washington, D.C., may 1993. ACM Press.
14. T. Morzy and M. Zakrzewicz. Group bitmap index: A structure for association rules retrieval. In R. Agrawal, P. E. Stolorz, and G. Piatetsky-Shapiro, editors, Proceedings of the 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 284-288, New York, USA, aug 1998. ACM Press.
15. A. Nanopoulos and Y. Manolopoulos. Efficient similarity search for market basket data. VLDB Journal, 11(2):138-152, 2002.
16. K. Nørvåg. Efficient use of signatures in object-oriented database systems. In J. Eder, I. Rozman, and T. Welzer, editors, Proceedings of the 3rd East European Conference on Advances in Databases and Information Systems (ADBIS), volume 1691 of Lecture Notes in Computer Science, pages 367-381, Maribor, Slovenia, sep 1999. Springer.
17. E. Tousidou, A. Nanopoulos, and Y. Manolopoulos. Improved methods for signature-tree construction. The Computer Journal, 43(4):301-314, 2000.