Cache Oblivious Search Trees via Binary Trees of Small Height

Cache Oblivious Search Trees via Binary Trees of Small Height (2002)

by Gerth Stølting Brodal , Rolf Fagerberg , Riko Jacob , Rolf Fagerberg Riko Jacob

Venue:	In Proc. ACM-SIAM Symp. on Discrete Algorithms
Citations:	61 - 9 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Cache Oblivious Search Trees via Binary Trees of Small Height	user correction - Legacy Corrections
AUTHOR NAME	Gerth Stølting Brodal	user correction - Legacy Corrections
AUTHOR NAME	Rolf Fagerberg	user correction - Legacy Corrections
AUTHOR NAME	Riko Jacob	user correction - Legacy Corrections
AUTHOR NAME	Rolf Fagerberg Riko Jacob	user correction - Legacy Corrections
ABSTRACT	We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds. In particular, our data structure avoids the use of weight balanced B-trees, and can be implemented as just a single array of data elements, without the use of pointers. The structure also improves space utilization.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE	In Proc. ACM-SIAM Symp. on Discrete Algorithms	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	39--48	INFERENCE
CITATIONS	23 found	ParsCit 1.0