Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Maintenance of views

Published: 01 June 1984 Publication History

Abstract

In relational databases a view definition is a query against the database, and a view materialization is the result of applying the view definition to the current database A view materialization over a database may change as relations in the database undergo modificationsIn this paper a mechanism is proposed in which the view is materialized at all times The problem which this mechanism addresses is how to quickly update the view in response to database changes A structure is maintained which provides information useful in minimizing the amount of work caused by updatesMethods are presented for handling both general databases and the much simpler tree databases (also called acyclic database) In both cases adding or deleting a tuple can be performed in polynomial time For tree databases the degree of the polynomial is independent of the schema structure while for cyclic databases the degree depends on the schema structure The cost of a sequence of tuple additions (deletions) is also analyzed

References

[1]
{AHU} Aho, A V, J E Hopcroft, and J D Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, 1976
[2]
{BC} Bernstein, P A, and D W Chiu, "Using Semi-Joins to Solve Relational Queries", J ACM 28 (1) 25--40, January 1981
[3]
{BFMMUY} Beeri, C, R Fagin, D Maier, A Mendelzon, J D Ullman, and M Yannakakis, "Properties of Acyclic Database Schemas", in Thirteenth Annual ACM Symp on Theory of Computing, 355-362 Association for Computing Machinery, New York, N Y, May 1981
[4]
{BFMY} Beeri, C, R Fagin, D Maier and M Yannakakis, "On the Desirability of Acyclic Database Schemes", J ACM, to appear
[5]
{BG} Bernstein, P A, and N Goodman, "The Power of Natural Semijoins", SIAM J of Comput, 10 (4), November 1981
[6]
{Fag} Fagin, R, "Types of Acyclicity for Hypergraphs and Relational Database Systems", Research Report RJ3330, IBM Research Laboratory, San Jose, CA, November 1981
[7]
{FMU} Fagin, R, A O Mendelzon, and J D Ullman, "A Simplified Universal Relation Assumption and Its Properties", Technical Report RJ2900, IBM, San Jose, CA, 1980
[8]
{Gra} Graham, M H, On the Universal Relation, Technical Report, University of Toronto, September 1979
[9]
{GS1} Goodman, N, and O Shmueli, "Tree Queries A Simple Class of Queries", ACM Transactions on Database Systems, December 1982
[10]
{GS2} Goodman, N, and O Shmueli, "The Structure of Database Schemas" To appear in J ACM
[11]
{GS3} Goodman, N, and O Shmueli, "The Tree Property is Fundamental for Query Processing", in Proc ACM SIGACT- SIGMOD Conference on Principles of Database Systems, 40--48, Los Angeles, CA, March 1982
[12]
{GS4} Goodman, N, and O Shmueli, "Transforming Cyclic Schemas into Trees", in Proc ACM SIGACT-SIGMOD Conference on Principles of Database Systems, 49--54, Los Angeles, CA, March 1982
[13]
{GS5} Goodman, N, and O Shmueli, "NP-Complete Problems Simplified on Tree Schemas", To appear in Acta Informatica
[14]
{GST} Goodman, N, O Shmueli and Y C Tay, "GYO Reductions, Canonical Connections, Tree and Cyclic Schemas and Tree Projections", in Proc ACM SIGACT-SIGMOD Conference on Principles on Database Systems, 267--278, Atlanta, Ga, March 1983
[15]
{Hul} Hull, R, "Acyclic Join Dependencies and Database Projections", in Proc XP2, State College, PA, June 1981
[16]
{MU1} Maier, D, and J D Ullman, "Connections in Acyclic Hypergraphs", in Proc ACM SIGACT-SIGMOD Conference on Principles of Database Systems, 34--39, Los Angeles, CA, March 1982
[17]
{MU2} Maier, D, and J D Ullman, "Maximal Objects and the Semantics of Universal Relation Databases", Technical Report #80-016, Dept of Comp Science, SUNY at Stonybrook, November 1980
[18]
{PY} Papadimitriou C H, and M Yannakakis, "The Complexity of Facets (and some facets of complexity)", in Fourteenth Annual ACM Symp on Theory of Computing Association for Computing
[19]
{TY} Tarjan, R E, and M Yannakakis, "Simple Linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs", unpublished manuscript, March 1982
[20]
{Yan} Yannakakis, M, "Algorithms for Acyclic Database Schemes", in Proc VLDB, 82--94, Cannes, France, September 1981
[21]
{YO} Yu, C T, and M.Z Ozsoyoglu, "An Algorithm for Tree-Query Membership of a Distributed Query," in Proc COMP-SAC79, IEEE Comp Society, November 1979

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record
ACM SIGMOD Record  Volume 14, Issue 2
June 1984
333 pages
ISSN:0163-5808
DOI:10.1145/971697
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data
    June 1984
    339 pages
    ISBN:0897911288
    DOI:10.1145/602259
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1984
Published in SIGMOD Volume 14, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)67
  • Downloads (Last 6 weeks)9
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2020)Meet me halfwayProceedings of the VLDB Endowment10.14778/3407790.340784913:12(2620-2633)Online publication date: 14-Sep-2020
  • (2016)Synchronous incremental update of materialized views for PostgreSQLProgramming and Computing Software10.1134/S036176881605006642:5(307-315)Online publication date: 1-Sep-2016
  • (2014)Incremental Maintenance of Aggregate ViewsProceedings of the 8th International Symposium on Foundations of Information and Knowledge Systems - Volume 836710.1007/978-3-319-04939-7_20(399-414)Online publication date: 3-Mar-2014
  • (2010)Research on Improved Increment Maintenance in Data Wearhouse2010 First International Conference on Pervasive Computing, Signal Processing and Applications10.1109/PCSPA.2010.34(104-107)Online publication date: Sep-2010
  • (2008)Improving parallelism of federated query processingData & Knowledge Engineering10.1016/j.datak.2007.05.00764:3(511-533)Online publication date: 1-Mar-2008
  • (2005)Incremental maintenance of shortest distance and transitive closure in first-order logic and SQLACM Transactions on Database Systems10.1145/1093382.109338430:3(698-721)Online publication date: 1-Sep-2005
  • (2002)Affinity-based management of main memory database clustersACM Transactions on Internet Technology10.1145/604596.6045992:4(307-339)Online publication date: 1-Nov-2002
  • (1999)Relationale Datenbanken im Wandel der ZeitenAngewandte Mathematik, insbesondere Informatik10.1007/978-3-322-83092-0_17(301-320)Online publication date: 1999
  • (1999)Incremental FO( +, < ) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and DeletionsDatabase Theory — ICDT’9910.1007/3-540-49257-7_23(365-382)Online publication date: 15-Jan-1999
  • (1997)Incremental algorithms for optimizing model computation based on partial instantiationThe Journal of Logic Programming10.1016/S0743-1066(96)00126-430:3(179-204)Online publication date: Mar-1997
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media