Analysis and performance of inverted data base structures
From MaRDI portal
Publication:4055179
DOI10.1145/360762.360766zbMath0301.68045OpenAlexW2123209274MaRDI QIDQ4055179
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360762.360766
Related Items (14)
Occupancy urn models in the analysis of algorithms ⋮ A unifying approach to evaluating block accesses in database organizations ⋮ Batched searching in database organizations ⋮ An average-case analysis of MAT and inverted file ⋮ An urn model with applications to database performance evaluation ⋮ Relaxed multi-way trees with group updates. ⋮ Multi-attribute hashing with multiple file copies for high performance partial-match retrieval ⋮ Evaluating clustering factor approach to estimating block selectivities ⋮ Probability distributions for seek time evaluation ⋮ Information storage and retrieval - mathematical foundations. II: Combinatorial problems ⋮ Komplexitätserfordernisse von Modellen zur optimalen Indexselektion für Datenbanken ⋮ The order of merging operations for queries in inverted file systems ⋮ Approximating block accesses in database organizations ⋮ Signature files and signature trees.
This page was built for publication: Analysis and performance of inverted data base structures
