Abstract
We present results on the average search and access cost of orthogonal range queries on multiattribute trees and doubly chained trees. As an example, we study the effect of page size variation in a paginated tree. We show that pagination may decrease the search cost, but is liable to raise the access cost in considerable proportion with respect to the cost on a non paginated tree.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.F. Cardenas, J.P. Sagamang: Modeling and analysis of data base organization: the doubly chained tree structure. Information Systems, Vol. 1, 57–67 (1975).
A.F. Cardenas, J.P. Sagamang: Doubly chained tree data base organization-analysis and design strategies. The Computer Journal, Vol. 20, No 1, 15–26 (1977).
P. Flajolet, C. Puech: Partial match retrieval of multidimensional data. Journal of the A.C.M., Vol. 33, No 2, 371–407 (April 1986).
D. Gardy, P. Flajolet, C. Puech: Average cost of orthogonal range queries in multiattribute trees. To appear in Information Systems, Vol. 14, No. 4, 1989.
V. Gopalakrishna, C.E. Veni Madhavan: Performance evaluation of attribute-based tree organization. A.C.M. Transactions On Database Systems, Vol. 6, No 1, 69–87 (March 1980).
S. Sitharama Iyengar, N.S.V. Rao, R.L. Kashyap, V.K. Vaishnavi: Multidimensional Data Structures: Review and Outlook. Advances in Computers, Academic Press, Vol. 27, 1988, 69–119.
R.L. Kashyap, S.K.C. Subas, S.B. Yao: Analysis of the multiple-attribute-tree database organization. I.E.E.E. Transactions on Software Engeneering, Vol. SE-3, No 6, 451–467 (Nov. 1977).
C. Puech: Méthodes d'analyse de structures de données dynamiques. Thèse d'Etat, Orsay (France), Avril 1984.
N.S.V. Rao, S.S. Iyengar, R.L. Kashyap: An average-case analysis of MAT and inverted file. Theoretical Computer Science, Vol. 62, No. 3, Dec. 1988, 251–266.
P. Svensson: On search performance for conjunctive queries in compressed, fully transposed ordered files. Proc. Fifth International Conference on Very Large Data Bases, Rio de Janeiro, Brazil, 155–163 (3–5 Oct. 1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gardy, D., Flajolet, P., Puech, C. (1989). On the performance of orthogonal range queries in multiattribute and doubly chained trees. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-51542-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51542-5
Online ISBN: 978-3-540-48237-6
eBook Packages: Springer Book Archive