Encoding Range Minima and Range Top-2 Queries
- Submitting institution
-
The University of Leicester
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1397
- Type
- D - Journal article
- DOI
-
10.1098/rsta.2013.0131
- Title of journal
- Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Article number
- 20130131
- First page
- .
- Volume
- 372
- Issue
- 2016
- ISSN
- 1364-503X
- Open access status
- Out of scope for open access requirements
- Month of publication
- April
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
https://doi.org/10.1098/rsta.2013.0131
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Encoding data structures (DS) aim to extract from a dataset the absolute minimum information needed to answer queries correctly. The encoding in this paper is used by Chan and Wilkinson (ACM TALG’16). Gawrychowski and Nicholson (ICALP’15) closed the gap between our upper and lower bounds for range top-2 encoding. Recently, Munro and WIld (arXiv:1903.02533v1) have solved our open question on encoding the Cartesian tree of random arrays. Appears in a special issue of PTRS-A devoted to papers presented at a Royal Society Theo Murphy meeting on “Storage and Indexing of Massive Data”.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -