research-article

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries

Authors:

Roberto Grossi,

Gonzalo Navarro,

S. Rao SattiAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 13, Issue 2

Article No.: 28, Pages 1 - 31

https://doi.org/10.1145/3012939

Published: 06 March 2017 Publication History

Abstract

Given an array A[1, n] of elements with a total order, we consider the problem of building a data structure that solves two queries: (a) selection queries receive a range [i, j] and an integer k and return the position of the kth largest element in A[i, j]; (b) top-k queries receive [i, j] and k and return the positions of the k largest elements in A[i, j]. These problems can be solved in optimal time, O(1+lg k/lg lg n) and O(k), respectively, using linear-space data structures.

We provide the first study of the encoding data structures for the above problems, where A cannot be accessed at query time. Several applications are interested in the relative order of the entries of A, and their positions, rather their actual values, and thus we do not need to keep A at query time. In those cases, encodings save storage space: we first show that any encoding answering such queries requires nlg k - O(n+k lg k) bits of space; then, we design encodings using O(nlg k) bits, that is, asymptotically optimal up to constant factors, while preserving optimal query time.

References

[1]

A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. 1998. Sorting in linear time? J. Comput. System Sci. 57, 1 (1998), 74--93.

Digital Library

[2]

D. Belazzougui, P. Boldi, R. Pagh, and S. Vigna. 2009. Monotone minimal perfect hashing: Searching a sorted table with O(1) accesses. In Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 785--794.

Digital Library

[3]

D. Belazzougui and G. Navarro. 2014. Alphabet-independent compressed text indexing. ACM Transactions on Algorithms (TALG) 10, 4 (2014), article 23.

Digital Library

[4]

D. Belazzougui and G. Navarro. 2015. Optimal lower and upper bounds for representing sequences. ACM Transactions on Algorithms 11, 4 (2015), article 31.

Digital Library

[5]

T. Bell, J. Cleary, and I. Witten. 1990. Text Compression. Prentice Hall.

Digital Library

[6]

G. S. Brodal, R. Fagerberg, M. Greve, and A. Lopez-Ortiz. 2009. Online sorted range reporting. In Proc. 20th International Symposium on Algorithms and Computation (ISAAC) (LNCS 5878). 173--182.

Digital Library

[7]

G. S. Brodal, B. Gfeller, A. G. Jørgensen, and P. Sanders. 2011. Towards optimal range medians. Theoretical Computer Science 412, 24 (2011), 2588--2601.

Digital Library

[8]

G. S. Brodal and A. G. Jørgensen. 2009. Data structures for range median queries. In Proc. 20th International Symposium on Algorithms and Computation (ISAAC) (LNCS 5878). 822--831.

Digital Library

[9]

T. Chan and B. T. Wilkinson. 2013. Adaptive and approximate orthogonal range counting. In Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 241--251.

Digital Library

[10]

D. Clark. 1996. Compact Pat Trees. Ph.D. Dissertation. University of Waterloo, Canada.

Digital Library

[11]

P. Davoodi, G. Navarro, R. Raman, and S. Srinivasa Rao. 2014. Encoding range minima and range top-2 queries. Philosophical Transactions of the Royal Society A 372, 20130131 (2014).

[12]

J. Fischer. 2010. Optimal succinctness for range minimum queries. In Proc. 9th Latin American Symposium on Theoretical Informatics (LATIN). 158--169.

Digital Library

[13]

J. Fischer. 2011. Combined data structure for previous- and next-smaller-values. Theoretical Computer Science 412, 22 (2011), 2451--2456.

Digital Library

[14]

J. Fischer and V. Heun. 2011. Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM Journal of Computing 40, 2 (2011), 465--492.

Digital Library

[15]

T. Gagie, G. Navarro, and S. J. Puglisi. 2012. New algorithms on wavelet trees and applications to information retrieval. Theoretical Computer Science 426-427 (2012), 25--41.

Digital Library

[16]

T. Gagie, S. J. Puglisi, and A. Turpin. 2009. Range quantile queries: Another virtue of wavelet trees. In Proc. 16th International Symposium on String Processing and Information Retrieval (SPIRE) (LNCS 5721). 1--6.

Digital Library

[17]

P. Gawrychowski and P. K. Nicholson. 2015b. Optimal encodings for range min-max and top-k. CoRR 1411.6581v2 (2015). http://arxiv.org/abs/1411.6581v2.

[18]

P. Gawrychowski and P. K. Nicholson. 2015a. Optimal encodings for range top-k, selection, and min-max. In Proc. 42nd International Colloquium on Automata, Languages, and Programming (ICALP), Part I (LNCS 9134). 593--604.

[19]

A. Golynski, I. Munro, and S. Rao. 2006. Rank/select operations on large alphabets: A tool for text indexing. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 368--373.

Digital Library

[20]

R. Grossi, J. Iacono, G. Navarro, R. Raman, and S. Srinivasa Rao. 2013. Encodings for range selection and top-k queries. In Proc. 21st Annual European Symposium on Algorithms (ESA) (LNCS 8125). 553--564.

[21]

R. Grossi, A. Orlandi, R. Raman, and S. S. Rao. 2009. More haste, less waste: Lowering the redundancy in fully indexable dictionaries. In Proc. 26th International Symposium on Theoretical Aspects of Computer Science (STACS) (LIPIcs 3). 517--528.

[22]

P. Hsu and G. Ottaviano. 2013. Space-efficient data structures for top-k completion. In Proc. World Wide Web Conference (WWW’13). 583--594.

Digital Library

[23]

A. G. Jørgensen and K. G. Larsen. 2011. Range selection and median: Tight cell probe lower bounds and adaptive data structures. In Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 805--813.

Digital Library

[24]

G. Li, S. Ji, C. Li, and J. Feng. 2009. Efficient type-ahead search on relational data: A TASTIER approach. In SIGMOD Conference, U. Çetintemel, S. B. Zdonik, D. Kossmann, and N. Tatbul (Eds.). ACM, 695--706.

Digital Library

[25]

Jirí Matousek. 1991. Cutting hyperplane arrangements. Discrete and Computational Geometry 6 (1991), 385--406.

Digital Library

[26]

J. I. Munro and V. Raman. 2001. Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31, 3 (2001), 762--776.

Digital Library

[27]

S. Muthukrishnan. 2002. Efficient algorithms for document retrieval problems. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 657--666.

Digital Library

[28]

G. Navarro, R. Raman, and S. Srinivasa Rao. 2014. Asymptotically optimal encodings for range selection. In Proc. 34th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 291--302.

[29]

G. Navarro and K. Sadakane. 2014. Fully-functional static and dynamic succinct trees. ACM Transactions on Algorithms 10, 3 (2014), article 16.

Digital Library

[30]

M. Pătraşcu and M. Thorup. 2006. Time-space trade-offs for predecessor search. In Proc. 38th Annual ACM Symposium on Theory of Computing (STOC). 232--240.

Digital Library

[31]

R. Raman, V. Raman, and S. Srinivasa Rao. 2007. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 2, 4 (2007), Article 43.

Digital Library

[32]

K. Sadakane. 2002. Succinct representations of lcp information and improvements in the compressed suffix arrays. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 225--232.

Digital Library

Cited By

Bernardini GChen HFici GLoukides GPissis S(2021)Reverse-Safe Text IndexingACM Journal of Experimental Algorithmics10.1145/346169826(1-26)Online publication date: 9-Jul-2021
https://dl.acm.org/doi/10.1145/3461698
Jo SLingala RSatti S(2021)Encoding Two-Dimensional Range Top-k QueriesAlgorithmica10.1007/s00453-021-00856-183:11(3379-3402)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s00453-021-00856-1
Tsur D(2019)The effective entropy of next/previous larger/smaller value queriesInformation Processing Letters10.1016/j.ipl.2019.01.011145(39-43)Online publication date: May-2019
https://doi.org/10.1016/j.ipl.2019.01.011
Show More Cited By

Index Terms

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries
1. Information systems
  1. Data management systems
    1. Data structures
      1. Data layout
        Data compression
  2. Information retrieval
    1. Search engine architectures and scalability
      1. Search engine indexing
      2. Search index compression

Recommendations

Data Structures for Path Queries

Consider a tree T on n nodes, each having a weight drawn from [1‥σ]. In this article, we study the problem of supporting various path queries over the tree T. The path counting query asks for the number of the nodes on a query path whose weights are in ...
Optimal Encodings for Range Majority Queries

We study the problem of designing a data structure that reports the positions of the distinct $$\tau $$ -majorities within any range of an array $$A[1,n]$$A[1,n], without storing $$A$$A. A $$\tau $$ -majority in a range $$A[i,j]$$A[i,j], for $$0<\tau < ...
Space-efficient data-analysis queries on grids

We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on geometric queries such as dominance and rectangle visibility, and on semigroup and group queries such as sum, average, variance, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 13, Issue 2

Special Issue on SODA'15 and Regular Papers

April 2017

316 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/3040971

Editor:
Aravind Srinivasan
University of Maryland, USA

Issue’s Table of Contents

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 March 2017

Accepted: 01 October 2016

Revised: 01 May 2016

Received: 01 August 2015

Published in TALG Volume 13, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Millennium Nucleus Information and Coordination in Networks
Ministry of Education, Science and Technology
Basic Science Research Program through the National Research Foundation of Korea (NRF)
MIUR PRIN 2012C4E3KT national research project

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
235
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bernardini GChen HFici GLoukides GPissis S(2021)Reverse-Safe Text IndexingACM Journal of Experimental Algorithmics10.1145/346169826(1-26)Online publication date: 9-Jul-2021
https://dl.acm.org/doi/10.1145/3461698
Jo SLingala RSatti S(2021)Encoding Two-Dimensional Range Top-k QueriesAlgorithmica10.1007/s00453-021-00856-183:11(3379-3402)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s00453-021-00856-1
Tsur D(2019)The effective entropy of next/previous larger/smaller value queriesInformation Processing Letters10.1016/j.ipl.2019.01.011145(39-43)Online publication date: May-2019
https://doi.org/10.1016/j.ipl.2019.01.011
Gagie THe MNavarro G(2018)Path queries on functionsTheoretical Computer Science10.1016/j.tcs.2018.10.021Online publication date: Oct-2018
https://doi.org/10.1016/j.tcs.2018.10.021

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents