Optimization Issues in R-tree Construction (Extended Abstract)

The construction of an efficient tree structure should take into account parameters that can be optimized. Coverage of a node, deadarea of a node and overlap between nodes are examples of such parameters. Existing access methods do not combine all these parameters. In this paper we study the effects of the above criteria on the performance of the R-tree structure and we propose a combination of all of them into a complex one that would be responsible for the tree construction.