Secondary attribute retrieval using tree data structures

DOI10.1016/0304-3975(84)90106-3MaRDI QIDQ798014zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Optimal attribute ranking in multiple attribute tree
• An average-case analysis of MAT and inverted file
• Data base design with the constrained multiple attribute tree
• Partial match retrieval of multidimensional data
• scientific article; zbMATH DE number 3843184

Cites work

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

Cited in

(6)

• Data base design with the constrained multiple attribute tree
• Collocated cokriging based on merged secondary attributes
• An average-case analysis of MAT and inverted file
• Secondary attribute retrieval using tree data structures
• scientific article; zbMATH DE number 3898276 (Why is no real title available?)
• Optimal attribute ranking in multiple attribute tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798014)