Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
Name
Cache-obvious iterated.pdf
Size
673.22 KB
Format
Adobe PDF
Checksum (MD5)
40912cde377af5d761a8c5a09995791b
Author(s)
Demaine, Erik D
Gopal, Vineet
Hasenplaugh, William Cleaburn
Date Issued
July 2015
Journal
Workshop on Algorithms and Data Structures, WADS 2015
Publisher
Springer Berlin / Heidelberg
Citation
Demaine, Erik D., Vineet Gopal, and William Hasenplaugh. “Cache-Oblivious Iterated Predecessor Queries via Range Coalescing.” Algorithms and Data Structures. Ed. Frank Dehne, Jörg-Rüdiger Sack, and Ulrike Stege. Vol. 9214. Cham: Springer International Publishing, 2015. 249–262.
Version
Author's final manuscript
Abstract
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 each list which is less than q. Our solution to this problem, called “range coalescing”, requires O(log[subscript B+1]n+k/B) memory transfers for a query on a cache of block size B, which is information-theoretically optimal. The range-coalescing data structure consumes O(kn) space, and preprocessing requires only O(kn / B) memory transfers with high probability, given a tall cache of size M=Ω(B[superscript 2]).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-21840-3_21
