The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
From Theory to Practice: Plug and Play with Succinct Data Structures
Abstract
Engineering efficient implementations of compact and succinct structures is time-consuming and challenging, since there is no standard library of easy-to-use, highly optimized, and composable components. One consequence is that measuring the practical impact of new theoretical proposals is difficult, since older baseline implementations may not rely on the same basic components, and reimplementing from scratch can be time-consuming. In this paper we present a framework for experimentation with succinct data structures, providing a large set of configurable components, together with tests, benchmarks, and tools to analyze resource requirements. We demonstrate the functionality of the framework by recomposing two succinct solutions for top-k document retrieval which can operate on both character and integer alphabets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
Raman, R., Raman, V., & Satti, S. R. (2002) · doi:10.5555/545381.545411 · Cited by 387
Compressed Suffix Trees with Full Functionality
Sadakane, K. (2007) · Theory of Computing Systems · doi:10.1007/s00224-006-1198-x · Cited by 293
Practical Entropy-Compressed Rank/Select Dictionary
Okanohara, D., & Sadakane, K. (2007) · 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611972870.6 · Cited by 265
New text indexing functionalities of the compressed suffix arrays
Sadakane, K. (2003) · Journal of Algorithms · doi:10.1016/s0196-6774(03)00087-7 · Cited by 233
Succinct Suffix Arrays Based on Run-Length Encoding
Mäkinen, V., & Navarro, G. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496656_5 · Cited by 166
Compressed text indexes: From theory to practice
Ferragina, P., González, R., Navarro, G., & Venturini, R. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1412228.1455268 · Cited by 157
Practical Rank/Select Queries over Arbitrary Sequences
Claude, F., & Navarro, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89097-3_18 · Cited by 148
Larsson, N. J., & Sadakane, K. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.07.017 · Cited by 115
Optimized succinct data structures for massive data
Gog, S., & Petri, M. (2013) · Software Practice and Experience · doi:10.1002/spe.2198 · Cited by 113
Self-citationSpaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
Navarro, G. (2014) · ACM Computing Surveys · doi:10.1145/2535933 · Cited by 112
Space-Efficient Framework for Top-k String Retrieval Problems
Hon, W.-K., Shah, R., & Vitter, J. S. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.19 · Cited by 97
Top-k Ranked Document Search in General Text Databases
Culpepper, J. S., Navarro, G., Puglisi, S. J., & Turpin, A. H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15781-3_17 · Cited by 80
Inverted indexes for phrases and strings
Patil, M., Thankachan, S. V., Shah, R., et al. (2011) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2009916.2009992 · Cited by 51
Practical Compressed Document Retrieval
Navarro, G., Puglisi, S. J., & Valenzuela, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20662-7_17 · Cited by 42
Efficient in-memory top-k document retrieval
Culpepper, J. S., Petri, M., & Scholer, F. (2012) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2348283.2348317 · Cited by 30
Self-citationFaster Compact Top-k Document Retrieval
Konow, R., & Navarro, G. (2013) · DCC · doi:10.1109/dcc.2013.43 · Cited by 29
Cited by
Variation graph toolkit improves read mapping by representing genetic variation in the reference
Garrison, E., Sirén, J., Novak, A. M., Hickey, G., Eizenga, J. M., Dawson, E. T., Jones, W., Garg, S., Markello, C., Lin, M. F., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4227 · Cited by 821
GraphAligner: rapid and versatile sequence-to-graph alignment
Rautiainen, M., & Marschall, T. (2020) · Genome Biology · doi:10.1186/s13059-020-02157-2 · Cited by 242
Tracy: basecalling, alignment, assembly and deconvolution of sanger chromatogram trace files
Rausch, T., Fritz, M. H.-Y., Untergasser, A., & Benes, V. (2020) · BMC Genomics · doi:10.1186/s12864-020-6635-8 · Cited by 130
Garrison, E., & Guarracino, A. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btac743 · Cited by 95
Sirén, J., Garrison, E., Novak, A. M., Paten, B., & Durbin, R. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz575 · Cited by 92
Metadata
- Authors
- Gog, S., Beller, T., Moffat, A., & Petri, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2014
- Pages
- 326-337
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1962019683
- Cited by
- 340
- References
- 16
- FWCI
- 25.30
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.