Bitmap-Tree Indexing for Set Operations on Free Text

  • Authors:
  • Ilias Nitsos;Georgios Evangelidis;Dimitris Dervos

  • Affiliations:
  • -;-;-

  • Venue:
  • ICDE '04 Proceedings of the 20th International Conference on Data Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the present study we report on our implementation ofa hybrid-indexing scheme (Bitmap-Tree) that combines theadvantages of bitmap indexing and file inversion. The resultswe obtained are compared to those of the compressedinverted file index. Both storage overhead and query processingefficiency are taken into consideration. The proposednew method is shown to excel in handling queriesinvolving set operations. For general-purpose user queries,the Bitmap-Tree is shown to perform as good as the compressedinverted file index.