Bitmap-tree indexing for set operations on free text

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


Full metadata record
DC FieldValueLanguage
dc.contributor.authorNitsos, Iliasel
dc.contributor.authorEvangelidis, Georgiosel
dc.contributor.authorDervos, Dimitriosel
dc.contributor.otherΕυαγγελίδης, Γεώργιοςel
dc.contributor.otherΝίτσος, Ηλίαςel
dc.contributor.otherΔέρβος, Δημήτριοςel
dc.date.accessioned2015-07-05T13:36:25Zel
dc.date.accessioned2018-02-27T18:10:20Z-
dc.date.available2015-07-05T13:36:25Zel
dc.date.available2018-02-27T18:10:20Z-
dc.date.issued2004el
dc.identifierhttp://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=1320067&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D1320067el
dc.identifier10.1109/ICDE.2004.1320067el
dc.identifier.citationInternational Conference on Data Engineering, Boston, 2004el
dc.identifier.citationNitsos, I., Evangelidis, G., Dervos, D. (2004). Bitmap-Tree Indexing for Set Operations on Free Text. Πρακτικά συνεδρίου από 20ο International Conference on Data Engineering που διεξήχθη σε Boston, USA.el
dc.identifier.urihttp://195.251.240.227/jspui/handle/123456789/4332-
dc.descriptionΔημοσιεύσεις μελών--ΣΔΟ--Τμήμα Βιβλιοθηκονομίας και Συστημάτων Πληροφόρησης, 2004el
dc.description.abstractIn 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.el
dc.format.extent64Kbel
dc.language.isoenel
dc.relation.ispartof20th International Conference on Data Engineeringel
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 Greeceel
dc.rightsΑναφορά Δημιουργού-Μη Εμπορική Χρήση-Παρόμοια Διανομή 3.0 Ελλάδαel
dc.source.urihttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9217el
dc.subjectInverted filesel
dc.subjectΑντεστραμμένα αρχείαel
dc.subjectInformation managementel
dc.subjectOracle βάση δεδομένωνel
dc.subjectOracle databaseel
dc.subjectΣύστημα διαχείρισης βάσεων δεδομένωνel
dc.subjectDatabase management systemel
dc.subjectBitmap indexel
dc.subjectΔείκτης Bitmapel
dc.subjectΥβριδικό σύστημα ευρετηρίασηςel
dc.subjectHybrid-indexing schemeel
dc.subjectΔιαχείριση πληροφοριώνel
dc.subject.lcshData structures (Computer science)el
dc.subject.lcshΔιαχείριση βάσεων δεδομένωνel
dc.subject.lcshDatabase managementel
dc.subject.lcshΔομές δεδομένων (Πληροφορική)el
dc.subject.lcshBitmap-Tree indexel
dc.subject.lcshΑναζήτηση σε βάσεις δεδομένωνel
dc.subject.lcshDatabase searchingel
dc.subject.lcshΔείκτης Bitmap-Treeel
dc.titleBitmap-tree indexing for set operations on free textel
dc.typeConference articleel
heal.typeotherel
heal.type.enOtheren
heal.dateAvailable2018-02-27T18:11:20Z-
heal.languageelel
heal.accessfreeel
heal.recordProviderΤΕΙ Θεσσαλονίκηςel
heal.fullTextAvailabilitytrueel
heal.type.elΆλλοel
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.