Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
