Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
In this paper we develop an optimal cache-oblivious data structure that solves the iterated predecessor problem. Given k static sorted lists L[subscript 1],L[subscript 2],...,L[subscript k] of average length n and a query value q, the iterated predecessor problem is to find the largest element in ea...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin / Heidelberg,
2017-07-25T19:21:39Z.
|
| Subjects: | |
| Online Access: | Get fulltext |