Ranked document retrieval is a fundamental task in search engines. Such queries are solved with inverted indexes that require additional 45%-80% of the compressed text space, and take tens to hundreds of microseconds per query. In this paper we show how ranked document retrieval queries can be solved within tens of milliseconds using essentially no extra space over an in-memory compressed representation of the document collection. More precisely, we enhance wavelet trees on bytecodes (WTBCs), a data structure that rearranges the bytes of the compressed collection, so that they support ranked conjunctive and disjunctive queries, using just 6%-18% of the compressed text space. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Brisaboa, N. R., Cerdeira-Pena, A., Navarro, G., & Pedreira, Ó. (2012). Ranked document retrieval in (Almost) no space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7608 LNCS, pp. 155–160). Springer Verlag. https://doi.org/10.1007/978-3-642-34109-0_16
Mendeley helps you to discover research relevant for your work.