Optimised predecessor data structures for internal memory

DOI10.1007/3-540-44688-5_6MaRDI QIDQ4785572zbMATH OpenFDO

Authors Naila Rahman, Rajeev Raman, Richard Cole

Publication date 5 January 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2141/21410067

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• Time-space trade-offs for predecessor search
• Cache-oblivious iterated predecessor queries via range coalescing
• Optimal bounds for the predecessor problem
• Optimal bounds for the predecessor problem and related problems
• Unit-time predecessor queries on massive data sets

Cited in

(2)

• Cache-oblivious R-trees
• The cost of cache-oblivious searching

This page was built for publication: Optimised predecessor data structures for internal memory

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