article

Free access

Maintaining views incrementally

Authors:

Inderpal Singh Mumick,

V. S. SubrahmanianAuthors Info & Claims

ACM SIGMOD Record, Volume 22, Issue 2

Pages 157 - 166

https://doi.org/10.1145/170036.170066

Published: 01 June 1993 Publication History

Abstract

We present incremental evaluation algorithms to compute changes to materialized views in relational and deductive database systems, in response to changes (insertions, deletions, and updates) to the relations. The view definitions can be in SQL or Datalog, and may use UNION, negation, aggregation (e.g. SUM, MIN), linear recursion, and general recursion.

We first present a counting algorithm that tracks the number of alternative derivations (counts) for each derived tuple in a view. The algorithm works with both set and duplicate semantics. We present the algorithm for nonrecursive views (with negation and aggregation), and show that the count for a tuple can be computed at little or no cost above the cost of deriving the tuple. The algorithm is optimal in that it computes exactly those view tuples that are inserted or deleted. Note that we store only the number of derivations, not the derivations themselves.

We then present the Delete and Rederive algorithm, DRed, for incremental maintenance of recursive views (negation and aggregation are permitted). The algorithm works by first deleting a superset of the tuples that need to be deleted, and then rederiving some of them. The algorithm can also be used when the view definition is itself altered.

References

[1]

Krzysztof R. Apt, Howard A. Blair, and Adrian Walker. Towards a Theory o} Declarative Knowledge. In Foundations o} Deductive Databases and Logic Programming. Editor J. Minker, 1988 Morgan Kaufmann.

Digital Library

[2]

Peter O. Buneman and Eric K. Clemons. Efficiently Monitoring Relational Databases. In A C#I TODS, Vol 4, No. 3, 1979, 368-382.

Digital Library

[3]

J.A. Blakeley, N. Coburn, and P. Larson. Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates. In A CM TODS Vol 14, No. 3, 369-400, 1989.

Digital Library

[4]

Veronique Benzaken, Christophe Lecluse, and Philippe Richard. Enforcing Integrity Constraints in Database Programming Languages. TR Altair 68-91, Altair, France, 1991.

[5]

J.A. Blakeley, P. Larson, and F. W. Tompa. Ej#- c#ently Updating Materiahzed V#ews. In SIGMOD 1986, pages 61-71.

Digital Library

[6]

F. Bry, R. Manthey, and B. Martens. Integrity Verification in Knowledge Bases. In Logic Programm#ng, LNAI #9#, pages 114-189, 1992.

Digital Library

[7]

J.A. Blakeley and F. W. Tompa. Maintaining Materialized Views without Accessing Base Data. Information Systems, 13(4):393-406, 1988.

Digital Library

[8]

Stefano Ceri and Jennifer Widom. Deriving Production Rules for Incremental View Maintenance. In 17th VLDB, 1991.

Digital Library

[9]

Stefano Ceri and Jennifer Widom. Deriving Incremental Production Rules for Deductive Data. IBM RJ 9071, IBM Almaden, 1992.

[10]

S. Dar, R. Agrawal, and H. V. Jagadish. Optimization of generalized transitive closure, in Seventh IEEE International Con}erence on Data Engineering, Kobe, Japan, 1991.

Digital Library

[11]

Guozhu Dong and Jianwen Su. Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries. TRCS 92-18, University of California, Santa Barbara, 1992.

[12]

Guozhu Dong and Rodney Topor. Incremental Evaluation o} Datalog Queries. In ICDT, 1992.

Digital Library

[13]

Ashish Gupta, Dinesh Katiyar, and Inderpal Singh Mumick. Counting Solutions to the View Maintenance Problem. In Workshop on Deductive Databases, JICSLP, 1992.

[14]

Ashish Gupta, Inderpal Singh Mumick, and V. S. Subrahmanian. Maintaining views incrementally. TR 921214-19-TM, AT&T Bell Labs, 1992.

[15]

John V. Harrison and Suzanne Dietrich. Maintenance of Materialized Views in a Deductive Database: An Update Propagation Approach. In Workshop on Deductive Databases, JICSLP, 1992.

[16]

ISO_ANSI. ISO-ANSI Working Draft: Database Language SQL2 and SQL3; X3H2; ISO/IEC JTC1/SC21/WG3, 1990.

[17]

V. Kuchenhoff. On the Efficient Computation of the Difference Between Consecutive Database States. In DOOD, LNCS 566, 1991.

[18]

Inderpal Singh Mumick and Oded Shmueli. Finiteness Properties of Database Queries. In Fourth Australian Database Conference, 1993.

[19]

Inderpal Singh Mumick. Query Optimization in Deductive and Relational Databases. Ph.D. Thesis, Stanford University, CA 94305, 1991.

[20]

J.M. Nicolas and Yazdanian. An Outline of BDGEN: A Deductive DBMS. In In}ormation Processing, pages 705-717, 1983.

[21]

Xiaolei Qian and Gio Wiederhold. Incremental Recomputation o} Active Relational Expressions. In A CM TKDE, 1991.

Digital Library

[22]

Torre Risch and Martin SkSld. Active rules based on object-oriented queries. To Appear, A CM TKDE, 1993.

[23]

Oded Shmueli and Alon Itai. Maintenance o} lQews. In Sigmod Record, 14(2):240-255, 1984.

Digital Library

[24]

Ulf Schreier, Hmnid Pirahesh, Rakesh Agrawal, and C. Mohan. Alert: An Architecture for Transforming a Passive DBMS Into an Active DBMS. In 17th VLDB, pages 469-478, 1991.

Digital Library

[25]

Jeffrey D. Ullman. Principles o} Database and Knowledge-Base Systems, Volumes I and 2. Computer Science Press, 1989.

Digital Library

[26]

Toni Urpi and Antoni Olive. A Method for Change Computation in Deductive Databases. In 18th VLDB, pages 225-237, 1992.

Digital Library

[27]

Allen Van Gelder. Negation as failure using tight derivations for general logic programs. In Third IEEE Symposium on Logic Programming, 1986. Springer-Verlag.

[28]

Ouri Wolfson, Hasanat M. Dewan, Salvatore J. Stolfo, and Yechiam Yemini. Incremental Evaluation of Rules and its Relationship to Parallelism. In SIGMOD 1991, pages 78-87.

Digital Library

Cited By

Mackey IChimni RSu J(2024)Early detection of temporal constraint violationsInformation and Computation10.1016/j.ic.2023.105114296(105114)Online publication date: Jan-2024
https://doi.org/10.1016/j.ic.2023.105114
Aghasadeghi AVan den Bussche JStoyanovich J(2024)Temporal graph patterns by timed automataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00795-z33:1(25-47)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s00778-023-00795-z
Qayyum OYu W(2024)Coordination-Free Replicated Datalog Streams with Application-Specific AvailabilityAdvances in Databases and Information Systems10.1007/978-3-031-70626-4_11(155-169)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-70626-4_11
Show More Cited By

Index Terms

Maintaining views incrementally
1. Information systems
  1. Data management systems
    1. Database management system engines
    2. Query languages
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query languages (principles)

Recommendations

Maintaining views incrementally
SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data

We present incremental evaluation algorithms to compute changes to materialized views in relational and deductive database systems, in response to changes (insertions, deletions, and updates) to the relations. The view definitions can be in SQL or ...
Maintaining views in object-relational databases

View materialization is an important way of improving the performance of query processing. When an update occurs to the source data from which a materialized view is derived, the materialized view has to be updated so that it is consistent with the ...
Maintaining Recursive Views of Regions and Connectivity in Networks

The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguous regions, declarative networks that maintain shortest paths, and distributed ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 22, Issue 2

June 1, 1993

558 pages

ISSN:0163-5808

DOI:10.1145/170036

Editors:
Peter Buneman
Univ. of Pennsylvania
,
Sushil Jajodia,
Won Kim
UniSQL, Inc., Austin, TX

Issue’s Table of Contents

SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data
June 1993
566 pages
ISBN:0897915925
DOI:10.1145/170035
Editors:
Peter Buneman
Univ. of Pennsylvania
,
Sushil Jajodia

Copyright © 1993 ACM.

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 1993

Published in SIGMOD Volume 22, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

597
Total Citations
View Citations
2,683
Total Downloads

Downloads (Last 12 months)437
Downloads (Last 6 weeks)59

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mackey IChimni RSu J(2024)Early detection of temporal constraint violationsInformation and Computation10.1016/j.ic.2023.105114296(105114)Online publication date: Jan-2024
https://doi.org/10.1016/j.ic.2023.105114
Aghasadeghi AVan den Bussche JStoyanovich J(2024)Temporal graph patterns by timed automataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00795-z33:1(25-47)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s00778-023-00795-z
Qayyum OYu W(2024)Coordination-Free Replicated Datalog Streams with Application-Specific AvailabilityAdvances in Databases and Information Systems10.1007/978-3-031-70626-4_11(155-169)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-70626-4_11
Zhang XHu PNenov YHorrocks IElkind E(2023)Enhancing datalog reasoning with hypertree decompositionsProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/377(3383-3393)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/377
Sheoran NChockchowwat SChheda AWang SVerma RPark Y(2023)A Step Toward Deep Online AggregationProceedings of the ACM on Management of Data10.1145/35892691:2(1-28)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589269
Svingos CHernich AGildhoff HPapakonstantinou YIoannidis Y(2023)Foreign Keys Open the Door for Faster Incremental View MaintenanceProceedings of the ACM on Management of Data10.1145/35887201:1(1-25)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588720
Litt GSchiefer NSchickling JJackson D(2023)Riffle: Reactive Relational State for Local-First ApplicationsProceedings of the 36th Annual ACM Symposium on User Interface Software and Technology10.1145/3586183.3606801(1-16)Online publication date: 29-Oct-2023
https://dl.acm.org/doi/10.1145/3586183.3606801
Aamer HMontali MVan den Bussche J(2023)What Can Database Query Processing Do for Instance-Spanning Constraints?Business Process Management Workshops10.1007/978-3-031-25383-6_11(132-144)Online publication date: 9-Feb-2023
https://doi.org/10.1007/978-3-031-25383-6_11
Sebaa A(2022)Parallel Maintenance of Materialized Views in Large-Scale Analytic PlatformsInternational Journal of Organizational and Collective Intelligence10.4018/IJOCI.30520912:1(1-19)Online publication date: 21-Jul-2022
https://dl.acm.org/doi/10.4018/IJOCI.305209
Chen HWhitters GAmiri MWang YLoo BRoychoudhury ACadar CKim M(2022)Declarative smart contractsProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3549121(281-293)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3549121
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents