Skip to main content
SpringerLink
Log in
Book cover

Advances in Data Base Theory pp 171–209Cite as

Applications of Finite Differencing to Database Integrity Control and Query/Transaction Optimization

  • Chapter

Abstract

Koenig and Paige have presented a view maintenance strategy based on finite differencing for explicitly storing the values of database views, and updating these values whenever parameters on which they depend are modified. Examples were given that illustrated how this view maintenance strategy could be used to monitor integrity constraints. In this paper, we extend that idea to demonstrate how a DBMS can automatically define its own views that will be maintained efficiently by differencing. Based on this approach, we define a new class of deferred integrity constraints that can be monitored efficiently. In particular we show that the computational cost of each block of constraint monitoring code introduced within the original unmonitored code is bounded by a constant. It is also shown how this approach provides a simple and unified solution to the problem of integrity control and query/ transaction optimization.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, F. E. [1969] “Program Optimization”, Annual Review of Automatic Programming Vol. 5 ,(1969) 239–307.

    Google Scholar 

  2. Bernstein, P. A., Blaustein, B. T., and Clarke, E. M. [1980] “Fast Maintenance of Semantic Integrity Assertions using Redundant Aggregate Data,” Proceedings 6th International Conference on VLDB ,Montreal, Canada, October 1980, 126–136.

    Google Scholar 

  3. Blaustein, B. T. [1981] “Enforcing Database Assertions: Techniques and Applications,” Tech. Report TR-21-81, Center for Research in Computing Technology, Harvard University.

    Google Scholar 

  4. Chen, P.P.S. [1976] “The Entity -Relationship Model: Toward a Unified View of Data,” ACM TODS, 1 ,1 (Mar. 1976) 9–36.

    Article  Google Scholar 

  5. Cocke, J. and Kennedy, K. [1977] “An Algorithm for Reduction of Operator Strength”, CACM 20 ,11 (Nov. 1977) 850–856.

    MATH  Google Scholar 

  6. Cocke, J. and Schwartz, J. T. [1969] Programming Languages and Their Compilers ,CIMS, New York University, 1969, Lecture Notes.

    Google Scholar 

  7. Codd, E. F. [1970] “A Relational Model of Data for Large Shared Data Banks,” CACM 13 ,6 (June 1970) 377–387.

    MATH  Google Scholar 

  8. Date, C. J. [1982] Introduction to Database Systems, II ,Addison-Wesley.

    Google Scholar 

  9. Downey, P., Sethi, R., and Tarjan, R. [1980] “Variations on the Common Subexpression Problem,” JACM 27 ,4 (Oct. 1980) 758–771.

    Article  MathSciNet  MATH  Google Scholar 

  10. Earley, J. [1976] “High Level Iterators and a Method for Automatically Designing Data Structure Representation,” Journal of Computer Languages 1 ,4 (1976) 321–342.

    Article  Google Scholar 

  11. Fagin, R., Nievergelt, J., Pippenger, N. and Strong, J. [1979] “Extendible Hashing -A Fast Access Method for Dynamic Files,” ACM TODS 4 ,3 (Sept. 1979), 315–344.

    Article  Google Scholar 

  12. Finkelstein, S. [1982] “Common Expression Analysis in Database Applications,” Proceedings ACM International Symposium on Management of Data ,235–245.

    Google Scholar 

  13. Fong, A. C. [1977] “Elimination of Common Subexpressions in Very High Level Languages,” Proceedings 4th ACM Symposium on Principles of Programming Languages ,48–57.

    Google Scholar 

  14. Fong, A. C. [1979] “Inductively Computable Constructs in Very High Level Languages,” Proceedings 6th ACM Symposium on Principles of Programming Languages ,21–28.

    Google Scholar 

  15. Fong, A. C. and Ullman, J. D. [1976] “Induction Variables in Very High Level Languages,” Proceedings Third ACM Symposium on Principles of Programming Languages ,104–112.

    Google Scholar 

  16. Grant, J. and Minker, J. [1982] “Numerical Dependencies,” Proceedings Workshop on the Logical Bases of Databases ,ONERA-CERT, Toulouse, France.

    Google Scholar 

  17. Halmos, P. R. [1960] Naive Set Theory, Van Nostrand.

    Google Scholar 

  18. Hammer, M., and Sarin, S. [1978] “Efficient Monitoring of Database Assertions,” Proceedings ACM International Symposium on Management of Data-Extension ,159–168.

    Google Scholar 

  19. Hecht, M. [1977] Flow Analysis of Computer Programs ,North-Holland.

    MATH  Google Scholar 

  20. Hoffmann, C. M., and O’Donnell, J. O. [1982] “Pattern Matching in Trees,” JACM 29, 1, (Jan. 1982), 68–95.

    Article  MathSciNet  MATH  Google Scholar 

  21. Kennedy, K. [1981] “A Survey of Compiler Optimization Techniques,” In: Program Flow Analysis (Muchnick, S. and Jones, N., Eds.), Prentice-Hall, 5–54.

    Google Scholar 

  22. Koenig, S. and Paige, R. [1981] “A Transformational Framework for the Automatic Control of Derived Data,” Proceedings 7th International Conference on VLDB ,306–318.

    Google Scholar 

  23. Nicolas, J. M. [1982] “Logic for Improving Integrity Checking in Relational Data Bases,” Acta Informatica 18 ,(1982), 227–253.

    Article  MathSciNet  MATH  Google Scholar 

  24. Paige, R. [1981] Formal Differentiation ,UMI Research Press, Ann Arbor, Mich., Rev. of Ph.D. thesis, NYU, June 1979.

    Google Scholar 

  25. Paige, R. [1983] “Transformational Programming -Applications to Algorithms and Systems,” Proceedings Tenth ACM Symposium on Principles of Programming Languages ,73–87.

    Google Scholar 

  26. Paige, R., and Koenig, S., [1982] “Finite Differencing of Computable Expressions,” ACM TOPLAS 4 ,3, (July 1982) 402–454.

    Article  MATH  Google Scholar 

  27. Sarin, S. K. [1978] “Automatic Synthesis of Efficient Procedures for Database Semantic Integrity Checking,” Master’s thesis, M.I.T., Dept. of Computer Science.

    Google Scholar 

  28. Schonberg, E., Schwartz, J. T., and Sharir, M. [1981] “An Automatic Technique for Selection of Data Representations in SETL Programs,” ACM TOPLAS 3 ,2, (April 1981) 126–143.

    Article  MATH  Google Scholar 

  29. Schwartz, J. T. [1974] On Programming: An Interim Report on the SETL Project, Installments I and II ,CIMS, New York Univ., New York.

    Google Scholar 

  30. Shipman, D. W. [1981] “The Functional Data Model and the Data Language DAPLEX,” ACM TODS 6 ,1, (March 1981) 140–173.

    Article  Google Scholar 

  31. Sintzoff, M. [1972] “Calculating Properties of Programs by Valuations on Specific Models,” ACM SIGPLAN Notices, 7 ,1 (1972), 203–207.

    Article  Google Scholar 

  32. Stonebraker, M. [1975] “Implementation of Integrity Constraints and Views by Query Modification,” Proceedings ACM International Symposium on Management of Data ,65–78.

    Google Scholar 

  33. Ullman, J. D. [1980] Principles of Database Systems ,Computer Science Press.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rutgers University, New Brunswick, New Jersey, USA

    Robert Paige

  2. Stanford University, Palo Alto, California, USA

    Robert Paige

Authors
  1. Robert Paige
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CGE—Laboratoire de Marcoussis, Route de Nozay, 91460, Marcoussis, France

    Hervé Gallaire

  2. Department of Computer Science, University of Maryland, College Park, Maryland, 20742, USA

    Jack Minker

  3. Department d’ Informatique, ONERA-Centre d’ Etudes et de Recherches de Toulouse, 4025 2, av. E. Belin, 31055, Toulouse Cedex, France

    Jean Marie Nicolas

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Plenum Press, New York

About this chapter

Cite this chapter

Paige, R. (1984). Applications of Finite Differencing to Database Integrity Control and Query/Transaction Optimization. In: Gallaire, H., Minker, J., Nicolas, J.M. (eds) Advances in Data Base Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9385-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-9385-0_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4615-9387-4

  • Online ISBN: 978-1-4615-9385-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation