Analysis and performance of inverted data base structures

DOI10.1145/360762.360766MaRDI QIDQ4055179zbMATH OpenOpenAlexFDO

Authors Alfonso F. Cardenas

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(14)

• A unifying approach to evaluating block accesses in database organizations
• Batched searching in database organizations
• An average-case analysis of MAT and inverted file
• 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
• Occupancy urn models in the analysis of algorithms
• An urn model with applications to database performance evaluation
• Relaxed multi-way trees with group updates.
• Signature files and signature trees.
• The order of merging operations for queries in inverted file systems
• Approximating block accesses in database organizations
• Multi-attribute hashing with multiple file copies for high performance partial-match retrieval

This page was built for publication: Analysis and performance of inverted data base structures

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