Partially persistent B-trees with constant worst-case update time.
George LagogiannisNikos A. LorentzosPublished in: Comput. Electr. Eng. (2012)
Keyphrases
- b tree
- worst case
- data structure
- index structure
- r tree
- concurrency control
- upper bound
- main memory
- tree structure
- average case
- indexing techniques
- secondary storage
- main memory databases
- lower bound
- spatial databases
- tree structures
- indexing structure
- constant factor
- np hard
- access path
- file organizations
- range queries
- query processing
- information retrieval
- database management systems
- optimal solution