Performance of query processing implementations in ranking-based text retrieval systems using inverted indices

buir.contributor.authorAykanat, Cevdet
dc.citation.epage898en_US
dc.citation.issueNumber4en_US
dc.citation.spage875en_US
dc.citation.volumeNumber42en_US
dc.contributor.authorCambazoglu, B. B.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T10:18:48Z
dc.date.available2016-02-08T10:18:48Z
dc.date.issued2006-07en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractSimilarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11 alternative implementation techniques are presented under four different categories, and their asymptotic time and space complexities are investigated. To our knowledge, six of these techniques are not discussed in any other publication before. Furthermore, analytical experiments are carried out on a 30 GB document collection to evaluate the practical performance of different implementations in terms of query processing time and space consumption. Advantages and disadvantages of each technique are illustrated under different querying scenarios, and several experiments that investigate the scalability of the implementations are presented. © 2005 Elsevier Ltd. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:18:48Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2006en
dc.identifier.doi10.1016/j.ipm.2005.06.004en_US
dc.identifier.issn0306-4573en_US
dc.identifier.urihttp://hdl.handle.net/11693/23765en_US
dc.language.isoEnglishen_US
dc.publisherElsevier Ltden_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ipm.2005.06.004en_US
dc.source.titleInformation Processing and Managementen_US
dc.subjectComplexityen_US
dc.subjectDocument rankingen_US
dc.subjectInverted indexen_US
dc.subjectQuery processingen_US
dc.subjectScalabilityen_US
dc.subjectSimilarity calculationsen_US
dc.subjectText retrievalen_US
dc.subjectComputational complexityen_US
dc.subjectInformation analysisen_US
dc.subjectInformation retrievalen_US
dc.subjectInformation retrieval systemsen_US
dc.subjectText processingen_US
dc.titlePerformance of query processing implementations in ranking-based text retrieval systems using inverted indicesen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices.pdf
Size:
856.67 KB
Format:
Adobe Portable Document Format
Description:
Full printable version