Secondary attribute retrieval using tree data structures

DOI10.1016/0304-3975(84)90106-3zbMath0546.68085OpenAlexW1993611042MaRDI QIDQ798014

C. E. Veni Madhavan

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90106-3

zbMATH Keywords

complexity of node searchesK-d treemultiple attribute treenonlinear tree structuressecondary attribute retrieval

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (2)

An average-case analysis of MAT and inverted file ⋮ Secondary attribute retrieval using tree data structures

Cites Work

• Secondary attribute retrieval using tree data structures
• Quad trees: A data structure for retrieval by composite keys
• Multidimensional Height-Balanced Trees
• Performance evaluation of attribute-based tree organization
• Multidimensional binary search trees used for associative searching
• Multidimensional Binary Search Trees in Database Applications
• An effective way to represent quadtrees

This page was built for publication: Secondary attribute retrieval using tree data structures