An average-case analysis of MAT and inverted file

DOI10.1016/0304-3975(88)90069-2zbMath0662.68115OpenAlexW2012262792MaRDI QIDQ1114453

S. H. Smith

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90069-2

zbMATH Keywords

range queryinverted filesmultiple attribute treecomplete match query

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

An set refinement algorithm with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Secondary attribute retrieval using tree data structures
• Multidimensional B-trees: Analysis of dynamic behavior
• Modeling and analysis of data base organization. The doubly chained tree structure
• Performance evaluation of attribute-based tree organization
• Dynamic k-dimensional multiway search under time-varying access frequencies
• Analysis and performance of inverted data base structures
• Analysis of the Multiple-Attribute-Tree Data-Base Organization

This page was built for publication: An average-case analysis of MAT and inverted file