An Improved Upper Bound for Scalable Distributed Search Trees.
Adriano Di PasqualeEnrico NardelliGuido ProiettiPublished in: WDAS (2002)
Keyphrases
- search tree
- scalable distributed
- upper bound
- branch and bound algorithm
- lower bound
- branch and bound
- search algorithm
- file system
- search space
- b tree
- worst case
- binary search trees
- root node
- branching factor
- tree search
- database
- optimal solution
- np hard
- decision trees
- data structure
- heuristic function
- optimal cost
- genetic algorithm