Estimating Block Accesses in a B+-Tree whose Leaf Records are of Arbitrary Size.
Allaoua MaamirWilliam I. GroskyPublished in: Inf. Syst. (1997)
Keyphrases
- arbitrary size
- b tree
- index structure
- data structure
- concurrency control
- main memory
- indexing techniques
- texture synthesis
- disk accesses
- r tree
- databases
- join algorithms
- access path
- tree structure
- flash memory
- main memory databases
- file organizations
- access patterns
- query processing
- database
- index scheme
- multi dimensional
- principal component analysis