1987 · 162 citations · 12 references
ComputingComputer ScienceData ManagementData StructuresDatabasesDatabase ManagementQuery OptimizationQuery ProcessingRelational AlgebraRelational Data ModelRelational DatabasesIncremental Query ProcessingIncremental View MaintenanceJoinMaterialized View MaintenanceMaterialized ViewsNatural JoinView DefinitionView Updating
Relational view commands are traditionally handled by query modification, but alternative strategies use materialized copies that are either updated immediately or deferred until retrieval. This study compares the performance costs of query modification, immediate view maintenance, and deferred view maintenance. The analysis evaluates three view structures—a simple selection‑projection, a natural join of two relations, and an aggregate over a selection‑projection view—to assess maintenance costs. Results indicate that the most efficient maintenance method depends on database structure, view definition, and the mix of query and update activity.
The conventional way to process commands for relational views is to use query modification to translate the commands into ones on the base relations. An alternative approach has been proposed recently, whereby materialized copies of views are kept, and incrementally updated immediately after each modification of the database. A related scheme exists, in which update of materialized views is deferred until just before data is retrieved from the view. A performance analysis is presented comparing the cost of query modification, immediate view maintenance, and deferred view maintenance. Three different models of the structure of views are given a simple selection and projection of one relation, the natural join of two relations, and an aggregate (e.g. the sum of values in a column) over a selection-projection view. The results show that the choice of the most efficient view maintenance method depends heavily on the structure of the database, the view definition, and the type of query and update activity present.
12
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
Efficiently updating materialized views
José A. Blakeley, Per-Åke Larson, Frank Wm. Tompa · ACM SIGMOD Record · 1986 · 427 citations · Full text
Approximating block accesses in database organizations
S. Bing Yao · Communications of the ACM · 1977 · 385 citations · Full text