Approximating block accesses in database organizations

DOI10.1145/359461.359475zbMath0346.68019OpenAlexW2155166680WikidataQ129445334 ScholiaQ129445334MaRDI QIDQ4116057

No author found.

Publication date: 1977

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359461.359475

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items (18)

Batched search of index sequential files ⋮ Occupancy urn models in the analysis of algorithms ⋮ A unifying approach to evaluating block accesses in database organizations ⋮ Batched searching in database organizations ⋮ An urn model with applications to database performance evaluation ⋮ Mathematical studies on a transaction's waits and deadlocks in a 2pl environment ⋮ A statistical model for estimating the number of records in a relational database ⋮ Estimating disk head movement in batched searching ⋮ Determining optimal binary inter-relational clustering schema for a relational database^* ⋮ Evaluating clustering factor approach to estimating block selectivities ⋮ Translation Relationship Quantification: A Cluster-Based Approach and its Application to Shakespeare’s Sonnets ⋮ Buffer performance modeling in the context of unclustered index accesses with non-uniform access pattern ⋮ Dynamic query scheduling in parallel data warehouses ⋮ An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries ⋮ Domain-specific semijoin: A new operation for distributed query processing ⋮ Batched interpolation searching on databases ⋮ Approximating block accesses in database organizations ⋮ The RS-tree: An efficient data structure for distance browsing queries

This page was built for publication: Approximating block accesses in database organizations