Please use this identifier to cite or link to this item:
Title: Bitmap-tree indexing for set operations on free text
Authors: Nitsos, Ilias
Evangelidis, Georgios
Dervos, Dimitris A.
Type: Conference Paper
Subjects: FRASCATI::Natural sciences::Computer and information sciences
Keywords: database indexing
tree data structures
query processing
full-text databases
Issue Date: 2004
First Page: 837
Volume Title: Proceedings. 20th International Conference on Data Engineering
Abstract: Here we report on our implementation of a hybrid-indexing scheme (bitmap-tree) that combines the advantages of bitmap indexing and file inversion. The results we obtained are compared to those of the compressed inverted file index. Both storage overhead and query processing efficiency are taken into consideration. The proposed new method is shown to excel in handling queries involving set operations. For general-purpose user queries, the bitmap-tree is shown to perform as good as the compressed inverted file index.
ISBN: 0-7695-2065-0
Other Identifiers: 10.1109/ICDE.2004.1320067
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
2004_ICDE.pdf32,79 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons