research-article

Compressed Cache-Oblivious String B-Tree

Authors:

Paolo Ferragina,

Rossano VenturiniAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 12, Issue 4

Article No.: 52, Pages 1 - 17

https://doi.org/10.1145/2903141

Published: 03 August 2016 Publication History

Abstract

In this article, we study three variants of the well-known prefix-search problem for strings, and we design solutions for the cache-oblivious model which improve the best known results. Among these contributions, we close (asymptotically) the classic problem, which asks for the detection of the set of strings that share the longest common prefix with a queried pattern by providing an I/O-optimal solution that matches the space lower bound for tries up to a constant multiplicative factor of the form (1 + ϵ), for ϵ > 0. Our solutions hinge upon a novel compressed storage scheme that adds the ability to decompress prefixes of the stored strings I/O-optimally to the elegant locality-preserving front coding (Bender et al. 2006) still preserving its space bounds.

References

[1]

Alberto Apostolico. 1985. The myriad virtues of subword trees. Combinatorial Algorithms on Words (1985), 85--96.

[2]

Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, and Sebastiano Vigna. 2010. Fast prefix search in little space, with applications. In Proceedings of the 18th Annual European Symposium on Algorithms (ESA). 427--438.

Digital Library

[3]

Michael A. Bender, Martin Farach-Colton, and Bradley C. Kuszmaul. 2006. Cache-oblivious string B-trees. In Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). 233--242.

Digital Library

[4]

Gerth Stølting Brodal and Rolf Fagerberg. 2006. Cache-oblivious string dictionaries. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 581--590. 10.1145/1109557.1109621

Digital Library

[5]

Andrej Brodnik and J. Ian Munro. 1999. Membership in constant time and almost-minimum space. SIAM Journal of Computing 28, 5 (1999), 1627--1640.

Digital Library

[6]

Erik D. Demaine, John Iacono, and Stefan Langerman. 2004. Worst-case optimal tree layout in a memory hierarchy. CoRR cs.DS/0410048 (2004).

[7]

Peter Elias. 1974. Efficient storage and retrieval by content and address of static files. J. ACM 21, 2 (1974), 246--260.

Digital Library

[8]

Robert M. Fano. 1971. On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, Project MAC. MIT, Cambridge, MA.

[9]

Paolo Ferragina. 2013. On the weak prefix-search problem. Theoretical Computer Science 483 (2013), 75--84.

Digital Library

[10]

Paolo Ferragina and Roberto Grossi. 1999. The string b-tree: A new data structure for string search in external memory and its applications. Journal of the ACM 46, 2 (1999), 236--280. org/10.1145/301970.301973

Digital Library

[11]

Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, and Jeffrey Scott Vitter. 2008. On searching compressed string collections cache-obliviously. In Proceedings of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). 181--190. 10.1145/1376916.1376943

Digital Library

[12]

Paolo Ferragina and Rossano Venturini. 2010. The compressed permuterm index. ACM Transactions on Algorithms (TALG) 7, 1, Article 10 (2010), 10:1--10:21 pages.

Digital Library

[13]

Paolo Ferragina and Rossano Venturini. 2013. Compressed cache-oblivious string b-tree. In Proceedings of 21th Annual European Symposium on Algorithms (ESA). 469--480. 10.1007/978-3-642-40450-4_40

[14]

William Frakes and Ricardo Baeza-Yates. 1992. Information Retrieval: Data Structures and Algorithms. Prentice-Hall.

Digital Library

[15]

Edward Fredkin. 1960. Trie memory. Communication of the ACM 3, 9 (Sept. 1960), 490--499.

Digital Library

[16]

Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. 2012. Cache-oblivious algorithms. ACM Transactions on Algorithms (TALG) 8, 1 (2012), 4.

Digital Library

[17]

Dan Gusfield. 1997. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press.

Digital Library

[18]

Meng He, J. Ian Munro, and Srinivasa Rao Satti. 2012. Succinct ordinal trees based on tree covering. ACM Transactions on Algorithms (TALG) 8, 4 (2012), 42.

Digital Library

[19]

Wing-Kai Hon, Rahul Shah, and Jeffrey Scott Vitter. 2010. Compression, indexing, and retrieval for massive string data. In Procedings of the 21st Annual Symposium on Combinatorial Pattern Matching CPM. 260--274.

Digital Library

[20]

Richard M. Karp and Michael O. Rabin. 1987. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31, 2 (1987), 249--260.

Digital Library

[21]

Donald R. Morrison. 1968. PATRICIA - Practical algorithm to retrieve coded in alphanumeric. Journal of the ACM 15, 4 (1968), 514--534.

Digital Library

[22]

J. Ian Munro. 1996. Tables. In Proceedings of the 16th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 37--42.

[23]

Gonzalo Navarro and Veli Mäkinen. 2007. Compressed full-text indexes. ACM Computing Surveys 39, 1, Article 2 (2007).

Digital Library

[24]

Ian H. Witten, Alistair Moffat, and Timothy C. Bell. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images (2nd ed.). Morgan Kaufmann.

Digital Library

Cited By

Boffa AFerragina PTosoni FVinciguerra G(2024)CoCo-trieInformation Systems10.1016/j.is.2023.102316120:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.is.2023.102316
Ferragina PRotundo MVinciguerra G(2023)Engineering a Textbook Approach to Index Massive String DictionariesString Processing and Information Retrieval10.1007/978-3-031-43980-3_16(203-217)Online publication date: 20-Sep-2023
https://doi.org/10.1007/978-3-031-43980-3_16
Boffa AFerragina PTosoni FVinciguerra G(2022)Compressed String Dictionaries via Data-Aware Subtrie CompactionString Processing and Information Retrieval10.1007/978-3-031-20643-6_17(233-249)Online publication date: 8-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-20643-6_17
Show More Cited By

Index Terms

Compressed Cache-Oblivious String B-Tree
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis

Recommendations

The compressed permuterm index

The Permuterm index [Garfield 1976] is a time-efficient and elegant solution to the string dictionary problem in which pattern queries may possibly include one wild-card symbol (called Tolerant Retrieval problem). Unfortunately the Permuterm index is ...
Fully compressed suffix trees

Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like bioinformatics and information retrieval. Classical representations of suffix trees require Θ(n log n) bits of space, for a string of ...
A compressed self-index using a Ziv–Lempel dictionary
Abstract
A compressed full-text self-index for a text T, of size u, is a data structure used to search for patterns P, of size m, in T, that requires reduced space, i.e. space that depends on the empirical entropy (H_k or H₀) of T, and is, furthermore, able ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 12, Issue 4

September 2016

310 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/2983296

Editor:
Aravind Srinivasan
University of Maryland, USA

Issue’s Table of Contents

Copyright © 2016 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 the author(s) 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: 03 August 2016

Accepted: 01 March 2016

Revised: 01 February 2016

Received: 01 April 2015

Published in TALG Volume 12, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

SoBigData EU Project
MIUR of Italy under project PRIN ARS Technomedia 2012

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
327
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)2

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Boffa AFerragina PTosoni FVinciguerra G(2024)CoCo-trieInformation Systems10.1016/j.is.2023.102316120:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.is.2023.102316
Ferragina PRotundo MVinciguerra G(2023)Engineering a Textbook Approach to Index Massive String DictionariesString Processing and Information Retrieval10.1007/978-3-031-43980-3_16(203-217)Online publication date: 20-Sep-2023
https://doi.org/10.1007/978-3-031-43980-3_16
Boffa AFerragina PTosoni FVinciguerra G(2022)Compressed String Dictionaries via Data-Aware Subtrie CompactionString Processing and Information Retrieval10.1007/978-3-031-20643-6_17(233-249)Online publication date: 8-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-20643-6_17
Fici GPrezza NVenturini R(2021)Adaptive learning of compressible stringsTheoretical Computer Science10.1016/j.tcs.2021.10.003896:C(46-52)Online publication date: 6-Dec-2021
https://dl.acm.org/doi/10.1016/j.tcs.2021.10.003
Li YWu XJin YLi JLi G(2020)Efficient algorithms for crowd-aided categorizationProceedings of the VLDB Endowment10.14778/3389133.338913913:10(1221-1233)Online publication date: 3-May-2020
https://dl.acm.org/doi/10.14778/3389133.3389139
Dreseler MBoissier MRabl TUflacker M(2020)Quantifying TPC-H choke points and their optimizationsProceedings of the VLDB Endowment10.14778/3389133.338913813:10(1206-1220)Online publication date: 3-May-2020
https://dl.acm.org/doi/10.14778/3389133.3389138
Chen XDathathri RGill GPingali K(2020)PangolinProceedings of the VLDB Endowment10.14778/3389133.338913713:10(1190-1205)Online publication date: 3-May-2020
https://dl.acm.org/doi/10.14778/3389133.3389137
Ma MYin ZZhang SWang SZheng CJiang XHu HLuo CLi YQiu NLi FChen CPei D(2020)Diagnosing root causes of intermittent slow queries in cloud databasesProceedings of the VLDB Endowment10.14778/3389133.338913613:10(1176-1189)Online publication date: 3-May-2020
https://dl.acm.org/doi/10.14778/3389133.3389136
Ferragina PVinciguerra G(2020)The PGM-indexProceedings of the VLDB Endowment10.14778/3389133.338913513:8(1162-1175)Online publication date: 3-May-2020
https://dl.acm.org/doi/10.14778/3389133.3389135
Lu BHao XWang TLo E(2020)DashProceedings of the VLDB Endowment10.14778/3389133.338913413:10(1147-1161)Online publication date: 3-May-2020
https://dl.acm.org/doi/10.14778/3389133.3389134
Show More Cited By

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