Partially Persistent B-trees with Constant Worst Case Update Time.
George LagogiannisNikos A. LorentzosPublished in: ISCIS (2010)
Keyphrases
- b tree
- worst case
- index structure
- concurrency control
- data structure
- main memory
- constant factor
- access path
- secondary storage
- upper bound
- tree structure
- average case
- spatial databases
- tree structures
- file organizations
- np hard
- r tree
- indexing techniques
- main memory databases
- arbitrary length
- range queries
- data sets
- lower bound
- neural network
- data distribution
- multi dimensional
- data model
- query processing
- learning algorithm
- information retrieval