Cache-oblivious iterated predecessor queries via range coalescing

DOI10.1007/978-3-319-21840-3_21MaRDI QIDQ3449823zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Vineet Gopal, William Hasenplaugh

Publication date 30 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/110844

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Cache-oblivious data structures for orthogonal range searching
• Cache-oblivious planar orthogonal range searching and counting
• Algorithms – ESA 2005
• Time-space trade-offs for predecessor search
• A general approach for cache-oblivious range reporting and approximate range counting

Cites work

• An experimental analysis of parallel sorting algorithms
• Cache-oblivious algorithms
• Cache-Oblivious B-Trees
• Cache-oblivious priority queue and graph algorithm applications
• Fractional cascading. I: A data structuring technique
• scientific article; zbMATH DE number 1979501 (Why is no real title available?)
• Organization and maintenance of large ordered indexes

Cited in

(3)

• Range selection and predecessor queries in data aware space and time
• scientific article; zbMATH DE number 1848393 (Why is no real title available?)
• Predecessor queries in dynamic integer sets

This page was built for publication: Cache-oblivious iterated predecessor queries via range coalescing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449823)