Top-k document retrieval in optimal space

Dekel Tsur

doi:10.1016/j.ipl.2013.03.012

Top-k document retrieval in optimal space

Dekel Tsur

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

We present an index for top-k most frequent document retrieval whose space is |CSA|+o(n)+DlognD+O(D) bits, and its query time is O(logklog2 ^+Ïμn) per reported document, where D is the number of documents, n is the sum of lengths of the documents, and |CSA| is the space of the compressed suffix array for the documents. This improves over previous results for this problem, whose space complexities are |CSA|+ω(n) or 2|CSA|+ω(1).

Original language	English
Pages (from-to)	440-443
Number of pages	4
Journal	Information Processing Letters
Volume	113
Issue number	12
DOIs	https://doi.org/10.1016/j.ipl.2013.03.012
State	Published - 17 Apr 2013

Keywords

Data structures
Document retrieval
Text indexing

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2013.03.012

Cite this

@article{9d7c7aacf2ce4099ba3e099cce1f0cef,

title = "Top-k document retrieval in optimal space",

abstract = "We present an index for top-k most frequent document retrieval whose space is |CSA|+o(n)+DlognD+O(D) bits, and its query time is O(logklog2 +{\"I}μn) per reported document, where D is the number of documents, n is the sum of lengths of the documents, and |CSA| is the space of the compressed suffix array for the documents. This improves over previous results for this problem, whose space complexities are |CSA|+ω(n) or 2|CSA|+ω(1).",

keywords = "Data structures, Document retrieval, Text indexing",

author = "Dekel Tsur",

year = "2013",

month = apr,

day = "17",

doi = "10.1016/j.ipl.2013.03.012",

language = "English",

volume = "113",

pages = "440--443",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "12",

}

TY - JOUR

T1 - Top-k document retrieval in optimal space

AU - Tsur, Dekel

PY - 2013/4/17

Y1 - 2013/4/17

N2 - We present an index for top-k most frequent document retrieval whose space is |CSA|+o(n)+DlognD+O(D) bits, and its query time is O(logklog2 +Ïμn) per reported document, where D is the number of documents, n is the sum of lengths of the documents, and |CSA| is the space of the compressed suffix array for the documents. This improves over previous results for this problem, whose space complexities are |CSA|+ω(n) or 2|CSA|+ω(1).

AB - We present an index for top-k most frequent document retrieval whose space is |CSA|+o(n)+DlognD+O(D) bits, and its query time is O(logklog2 +Ïμn) per reported document, where D is the number of documents, n is the sum of lengths of the documents, and |CSA| is the space of the compressed suffix array for the documents. This improves over previous results for this problem, whose space complexities are |CSA|+ω(n) or 2|CSA|+ω(1).

KW - Data structures

KW - Document retrieval

KW - Text indexing

UR - https://www.scopus.com/pages/publications/84876157541

U2 - 10.1016/j.ipl.2013.03.012

DO - 10.1016/j.ipl.2013.03.012

M3 - Article

AN - SCOPUS:84876157541

SN - 0020-0190

VL - 113

SP - 440

EP - 443

JO - Information Processing Letters

JF - Information Processing Letters

IS - 12

ER -

Top-k document retrieval in optimal space

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this