TheSB-tree an index-sequential structure for high-performance sequential access
- 1 March 1992
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 29 (3), 241-265
- https://doi.org/10.1007/bf01185680
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Maximizing performance in a striped disk arrayPublished by Association for Computing Machinery (ACM) ,1990
- An Evaluation of Redundant Arrays of Disks using an Amdahl 5890Published by Defense Technical Information Center (DTIC) ,1989
- Expected behaviour of B+-trees under random insertionsActa Informatica, 1989
- Unsafe operations in B-treesActa Informatica, 1989
- A simple bounded disorder file organization with good performanceACM Transactions on Database Systems, 1988
- The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU timeACM SIGMOD Record, 1987
- Managing IBM Database 2 buffers to maximize performanceIBM Systems Journal, 1984
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Prefix B -treesACM Transactions on Database Systems, 1977
- Organization and maintenance of large ordered indexesActa Informatica, 1972