Encodings for range selection and top-k queries

Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Satti Srinivasa Rao

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We study the problem of encoding the positions the top-k elements of an array A[1..n] for a given parameter 1 ≤ k ≤ n. Specifically, for any i and j, we wish create a data structure that reports the positions of the largest k elements in A[i..j] in decreasing order, without accessing A at query time. This is a natural extension of the well-known encoding range-maxima query problem, where only the position of the maximum in A[i..j] is sought, and finds applications in document retrieval and ranking. We give (sometimes tight) upper and lower bounds for this problem and some variants thereof.

    Original languageEnglish (US)
    Title of host publicationAlgorithms, ESA 2013 - 21st Annual European Symposium, Proceedings
    Pages553-564
    Number of pages12
    Volume8125 LNCS
    DOIs
    StatePublished - 2013
    Event21st Annual European Symposium on Algorithms, ESA 2013 - Sophia Antipolis, France
    Duration: Sep 2 2013Sep 4 2013

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8125 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other21st Annual European Symposium on Algorithms, ESA 2013
    CountryFrance
    CitySophia Antipolis
    Period9/2/139/4/13

    Fingerprint

    Data structures
    Encoding
    Query
    Range of data
    Document Retrieval
    Natural Extension
    Upper and Lower Bounds
    Ranking
    Data Structures

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Grossi, R., Iacono, J., Navarro, G., Raman, R., & Rao, S. S. (2013). Encodings for range selection and top-k queries. In Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings (Vol. 8125 LNCS, pp. 553-564). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8125 LNCS). https://doi.org/10.1007/978-3-642-40450-4_47

    Encodings for range selection and top-k queries. / Grossi, Roberto; Iacono, John; Navarro, Gonzalo; Raman, Rajeev; Rao, Satti Srinivasa.

    Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. Vol. 8125 LNCS 2013. p. 553-564 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8125 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Grossi, R, Iacono, J, Navarro, G, Raman, R & Rao, SS 2013, Encodings for range selection and top-k queries. in Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. vol. 8125 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8125 LNCS, pp. 553-564, 21st Annual European Symposium on Algorithms, ESA 2013, Sophia Antipolis, France, 9/2/13. https://doi.org/10.1007/978-3-642-40450-4_47
    Grossi R, Iacono J, Navarro G, Raman R, Rao SS. Encodings for range selection and top-k queries. In Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. Vol. 8125 LNCS. 2013. p. 553-564. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-40450-4_47
    Grossi, Roberto ; Iacono, John ; Navarro, Gonzalo ; Raman, Rajeev ; Rao, Satti Srinivasa. / Encodings for range selection and top-k queries. Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. Vol. 8125 LNCS 2013. pp. 553-564 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{33d63084067541c1aaebeddecfaab6e1,
    title = "Encodings for range selection and top-k queries",
    abstract = "We study the problem of encoding the positions the top-k elements of an array A[1..n] for a given parameter 1 ≤ k ≤ n. Specifically, for any i and j, we wish create a data structure that reports the positions of the largest k elements in A[i..j] in decreasing order, without accessing A at query time. This is a natural extension of the well-known encoding range-maxima query problem, where only the position of the maximum in A[i..j] is sought, and finds applications in document retrieval and ranking. We give (sometimes tight) upper and lower bounds for this problem and some variants thereof.",
    author = "Roberto Grossi and John Iacono and Gonzalo Navarro and Rajeev Raman and Rao, {Satti Srinivasa}",
    year = "2013",
    doi = "10.1007/978-3-642-40450-4_47",
    language = "English (US)",
    isbn = "9783642404498",
    volume = "8125 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "553--564",
    booktitle = "Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings",

    }

    TY - GEN

    T1 - Encodings for range selection and top-k queries

    AU - Grossi, Roberto

    AU - Iacono, John

    AU - Navarro, Gonzalo

    AU - Raman, Rajeev

    AU - Rao, Satti Srinivasa

    PY - 2013

    Y1 - 2013

    N2 - We study the problem of encoding the positions the top-k elements of an array A[1..n] for a given parameter 1 ≤ k ≤ n. Specifically, for any i and j, we wish create a data structure that reports the positions of the largest k elements in A[i..j] in decreasing order, without accessing A at query time. This is a natural extension of the well-known encoding range-maxima query problem, where only the position of the maximum in A[i..j] is sought, and finds applications in document retrieval and ranking. We give (sometimes tight) upper and lower bounds for this problem and some variants thereof.

    AB - We study the problem of encoding the positions the top-k elements of an array A[1..n] for a given parameter 1 ≤ k ≤ n. Specifically, for any i and j, we wish create a data structure that reports the positions of the largest k elements in A[i..j] in decreasing order, without accessing A at query time. This is a natural extension of the well-known encoding range-maxima query problem, where only the position of the maximum in A[i..j] is sought, and finds applications in document retrieval and ranking. We give (sometimes tight) upper and lower bounds for this problem and some variants thereof.

    UR - http://www.scopus.com/inward/record.url?scp=84884335118&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84884335118&partnerID=8YFLogxK

    U2 - 10.1007/978-3-642-40450-4_47

    DO - 10.1007/978-3-642-40450-4_47

    M3 - Conference contribution

    SN - 9783642404498

    VL - 8125 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 553

    EP - 564

    BT - Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings

    ER -