Minimum boundary-length problem in B*-trees: a case study.
Isabella GagliardiDora MerelliPublished in: Inf. Syst. (1991)
Keyphrases
- b tree
- arbitrary length
- data structure
- index structure
- r tree
- concurrency control
- main memory
- secondary storage
- indexing techniques
- spatial databases
- case study
- access path
- file organizations
- tree structure
- main memory databases
- high availability
- tree structures
- minimum length
- similarity search
- multi dimensional
- spatial index
- nearest neighbor
- information retrieval
- data sets