Concurrent cache-oblivious b-trees
Authors:
Open Access
- 18 July 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 228-237
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Cache-Oblivious B-TreesSIAM Journal on Computing, 2005
- A locality-preserving cache-oblivious dynamic dictionaryJournal of Algorithms, 2004
- Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CASLecture Notes in Computer Science, 2004
- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation2002
- Tight(er) worst-case bounds on dynamic searching and priority queues2000
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- A sparse table implementation of priority queues1981
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Organization and maintenance of large ordered indexesActa Informatica, 1972