Average cost of orthogonal range queries in multiattribute trees
作者：
Highlights：
•
摘要
We give exact and asymptotic formulae for the average search and access cost of orthogonal range queries on multiattribute trees and doubly chained trees. Our results are also valid for paginated trees, and permit evaluation of the memory cost of the trees.
论文关键词：doubly chained tree,multiattribute tree,multidimensional searching,orthogonal range query,partial match retrieval
论文评审过程：Received 6 July 1988, Revised 6 April 1989, Available online 2 July 2003.
论文官网地址：https://doi.org/10.1016/0306-4379(89)90053-7
