Batch-construction of B+-trees

Authors:
Sang-Wook Kim;Hee-Sun Won
Affiliations:
Division of Computer, Information, and Communications Engineering, Kangwon National University, Chunchon, Kangwon Do, 200-701, Korea;Internet Appliance Java S/W Research Team, Electronics and Telecommunications Research, Institute, Daejon, 305-350, Korea
Venue:
Proceedings of the 2001 ACM symposium on Applied computing
Year:
2001

Citing 10
Cited 2

Algorithms & data structures

Algorithms & data structures
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Fundamentals of database systems (2nd ed.)

Fundamentals of database systems (2nd ed.)
Implementing deletion in B+-trees

ACM SIGMOD Record
Optimizing Jan Jannink's Implementation of B+-tree deletion

ACM SIGMOD Record
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Database Design

Database Design
Fundamentals of Data Structures in C

Fundamentals of Data Structures in C
Data Structures and Algorithms

Data Structures and Algorithms

A compact B-tree

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A snappy b+-trees index reconstruction for main-memory storage systems

ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract