Cache-oblivious string B-trees
Authors:
Open Access
- 26 June 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 233-242
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Cache-Oblivious B-TreesSIAM Journal on Computing, 2005
- A locality-preserving cache-oblivious dynamic dictionaryJournal of Algorithms, 2004
- How to Pack TreesJournal of Algorithms, 1999
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- Two algorithms for maintaining order in a list1987
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Prefix B -treesACM Transactions on Database Systems, 1977
- Organization and maintenance of large ordered indexesActa Informatica, 1972