Secondary attribute retrieval using tree data structures

DOI10.1016/0304-3975(84)90106-3zbMATH Open0546.68085OpenAlexW1993611042MaRDI QIDQ798014FDOQ798014

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)

Cites Work

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

Cited In (4)

• Collocated cokriging based on merged secondary attributes
• An average-case analysis of MAT and inverted file
• Title not available (Why is that?)
• Secondary attribute retrieval using tree data structures

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)