On Searching Compressed String Collections Cache-Obliviously
Summary: Cache-friendly compressed edge-linearizations of tries: new analyses of front coding and novel layouts that approach information-theoretic space while reducing cache misses. A distribution-aware dictionary encoding yields near-optimal space and competitive I/O-search, and a succinct cache-oblivious trie variant combines both. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Paolo Ferragina
- 2. Roberto Grossi
- 3. Ankur Gupta
- 4. Rahul Shah
- 5. Jeffrey Scott Vitter
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,444 | Brighthouse: An Analytic Data Warehouse for Ad-hoc Queries | 2008 | VLDB | 8.8076551e-05 |
| 4,897 | The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space | 2012 | PODS | 5.8469152e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,117 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00013882205 |
Previous
Page 1 / 1
Next