Tree structures for partial match retrieval
- 1 November 1983
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper describes general evaluation methods for "partial-match retrieval" in multikey record files. An expected cost analysis is given for some of the major multidimensional tree structures which have been proposed in the data base and graphics literature.Keywords
This publication has 22 references indexed in Scilit:
- Partial match retrieval of multidimensional dataJournal of the ACM, 1986
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Partial-match retrieval for dynamic filesBIT Numerical Mathematics, 1982
- Connected Component Labeling Using QuadtreesJournal of the ACM, 1981
- An Algorithm for Converting Rasters to QuadtreesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Performance evaluation of attribute-based tree organizationACM Transactions on Database Systems, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- Analysis of the Multiple-Attribute-Tree Data-Base OrganizationIEEE Transactions on Software Engineering, 1977
- Doubly-chained tree data base organisation--analysis and design strategiesThe Computer Journal, 1977