loading...
Bitmap-Tree Indexing for Set Operations on Free Text
Boston, Massachusetts March 30-April 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2004.132006720th International Conference on Data ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Ilias Nitsos, Georgios Evangelidis, Dimitris Dervos, "Bitmap-Tree Indexing for Set Operations on Free Text," Data Engineering, International Conference on, pp. 837, 20th International Conference on Data Engineering (ICDE'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ICDE.2004.1320067,
author = {Ilias Nitsos and Georgios Evangelidis and Dimitris Dervos},
title = {Bitmap-Tree Indexing for Set Operations on Free Text},
journal ={Data Engineering, International Conference on},
volume = {0},
year = {2004},
issn = {1063-6382},
pages = {837},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2004.1320067},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Engineering, International Conference on
TI - Bitmap-Tree Indexing for Set Operations on Free Text
SN - 1063-6382
SP
EP
A1 - Ilias Nitsos,
A1 - Georgios Evangelidis,
A1 - Dimitris Dervos,
PY - 2004
KW - null
VL - 0
JA - Data Engineering, International Conference on
ER -
 
Ilias Nitsos, University of Macedonia, Greece
Georgios Evangelidis, University of Macedonia, Greece
Dimitris Dervos, TEI of Thessaloniki, Greece
In the present study 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.
Citation:
Ilias Nitsos, Georgios Evangelidis, Dimitris Dervos, "Bitmap-Tree Indexing for Set Operations on Free Text," icde, pp.837, 20th International Conference on Data Engineering (ICDE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions