Bitmap-tree indexing for set operations on free text

Nitsos, Ilias/ Evangelidis, Georgios/ Dervos, Dimitrios/ Ευαγγελίδης, Γεώργιος/ Νίτσος, Ηλίας/ Δέρβος, Δημήτριος


Institution and School/Department of submitter: ΤΕΙ Θεσσαλονίκης
Keywords: Inverted files;Αντεστραμμένα αρχεία;Information management;Oracle βάση δεδομένων;Oracle database;Σύστημα διαχείρισης βάσεων δεδομένων;Database management system;Bitmap index;Δείκτης Bitmap;Υβριδικό σύστημα ευρετηρίασης;Hybrid-indexing scheme;Διαχείριση πληροφοριών
Issue Date: 2004
Citation: International Conference on Data Engineering, Boston, 2004
Nitsos, I., Evangelidis, G., Dervos, D. (2004). Bitmap-Tree Indexing for Set Operations on Free Text. Πρακτικά συνεδρίου από 20ο International Conference on Data Engineering που διεξήχθη σε Boston, USA.
Abstract: 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.
Description: Δημοσιεύσεις μελών--ΣΔΟ--Τμήμα Βιβλιοθηκονομίας και Συστημάτων Πληροφόρησης, 2004
URI: http://195.251.240.227/jspui/handle/123456789/4332
Other Identifiers: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=1320067&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D1320067
10.1109/ICDE.2004.1320067
Appears in Collections:Δημοσιεύσεις σε Περιοδικά

Files in This Item:
File Description SizeFormat 
Nitsos_Evangelidis_Dervos_Bitmap-Tree_Indexing_for.pdf63.24 kBAdobe PDFView/Open



 Please use this identifier to cite or link to this item:
http://195.251.240.227/jspui/handle/123456789/4332
  This item is a favorite for 0 people.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.