[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins

  • Conference paper
Flexible Query Answering Systems (FQAS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3055))

Included in the following conference series:

Abstract

In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers to queries cannot be trusted. To be of any practical use, any method for integrity checking must support aggregates and arithmetic constraints, which are among the most widespread constructs in current database technology. In this paper we propose a method of practical relevance that can be used to simplify integrity constraints possibly containing aggregates and arithmetic expressions. Simplified versions of the integrity constraints are derived at database design time and can be tested before the execution of any update. In this way, virtually no time is spent for optimization or rollbacks at run time. Both set and bag semantics are considered.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bülzingsloewen, G.: Translating and Optimizing SQL Queries Having Aggregates. In: VLDB 1987, pp. 235–243. Morgan Kaufmann, San Francisco (1987)

    Google Scholar 

  2. Chakravarthy, U.S., Grant, J., Minker, J.: Foundations of semantic query optimization for deductive databases. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 243–273. Morgan Kaufmann, San Francisco (1988)

    Google Scholar 

  3. Chakravarthy, U., Grant, J., Minker, J.: Logic-based approach to semantic query optimization. ACM TODS 15(2), 162–207 (1990)

    Article  Google Scholar 

  4. Christiansen, H., Martinenghi, D.: Simplification of database integrity constraints revisited: A transformational approach. To appear In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol. 3018, pp. 178–197. Springer, Heidelberg (2004)

    Google Scholar 

  5. Christiansen, H., Martinenghi, D.: In: Seipel, D., Turull-Torres, J.M.a. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 31–48. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Cohen, S., Nutt, W., Serebrenik, A.: Algorithms for Rewriting Aggregate Queries Using Views. In: Masunaga, Y., Thalheim, B., Štuller, J., Pokorný, J. (eds.) ADBIS 2000 and DASFAA 2000. LNCS, vol. 1884, pp. 65–78. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Carlsson, M., Ottosson, G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191–206. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Chaudhuri, S., Vardi, M.: Optimization of real conjunctive queries. In: ACM SIGACT-SIGMOD-SIGART PODS 1993, pp. 59–70. ACM Press, New York (1993)

    Google Scholar 

  9. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  10. Das, S.: Deductive Databases and Logic Programming. Addison-Wesley, Reading (1992)

    MATH  Google Scholar 

  11. Decker, H., Celma, M.: A slick procedure for integrity checking in deductive databases. In: ICLP 1994, pp. 456–469. MIT Press, Cambridge (1994)

    Google Scholar 

  12. Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate Well-founded and Stable Semantics for Logic Programs with Aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 212–226. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Frühwirth, T.W.: Theory and Practice of Constraint Handling Rules. JLP 37(1-3), 95–138 (1998)

    Article  MATH  Google Scholar 

  14. Furfaro, F., Greco, S., Ganguly, S., Zaniolo, C.: Pushing extrema aggregates to optimize logic queries. Inf. Syst. 27(5), 321–343 (2002)

    Article  MATH  Google Scholar 

  15. Grant, J., Minker, J.: Integrity Constraints in Knowledge Based Systems. In: Adeli, H. (ed.) Knowledge Eng. II, Applications, pp. 1–25. McGraw-Hill, New York (1990)

    Google Scholar 

  16. Godfrey, P., Grant, J., Gryz, J., Minker, J.: Integrity Constraints: Semantics and Applications. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information System, pp. 265–306. Kluwer, Dordrecht (1988)

    Google Scholar 

  17. Henschen, L., McCune, W., Naqvi, S.: Compiling Constraint-Checking Programs from First-Order Formulas. In: Gallaire, H., Nicolas, J.-M., Minker, J. (eds.) Advances in Database Theory 1982, vol. 2, pp. 145–169. Plenum Press (1984)

    Google Scholar 

  18. Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576–580 (1969)

    Article  MATH  Google Scholar 

  19. Jaffar, J., Maher, M.: Constraint Logic Programming: A Survey. JLP 19/20, 503–581 (1994)

    Article  MathSciNet  Google Scholar 

  20. Kemp, D., Stuckey, P.: Semantics of Logic Programs with Aggregates. In: ISLP 1991, pp. 387–401. MIT Press, Cambridge (1991)

    Google Scholar 

  21. Leuschel, M., De Schreye, D.: Creating Specialised Integrity Checks Through Partial Evaluation of Meta-Interpreters. JLP 36(2), 149–193 (1998)

    Article  MATH  Google Scholar 

  22. Lloyd, J., Sonenberg, L., Topor, R.: Integrity Constraint Checking in Stratified Databases. JLP 4(4), 331–343 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  23. Martinenghi, D.: A Simplification Procedure for Integrity Constraints. World Wide Web, http://www.dat.ruc.dk/~dm/spic/index.html (2003)

  24. Nicolas, J.-M.: Logic for Improving Integrity Checking in Relational Data Bases. Acta Inf. 18, 227–253 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  25. Nilsson, U., Małuzyński, J.: Logic, Programming and Prolog, 2nd edn. John Wiley & Sons Ltd, Chichester (1995)

    Google Scholar 

  26. Qian, X.: An Effective Method for Integrity Constraint Simplification. In: ICDE 1988, pp. 338–345. IEEE Computer Society, Los Alamitos (1988)

    Google Scholar 

  27. Wang, H., Zaniolo, C.: User-Defined Aggregates in Database Languages. In: Connor, R.C.H., Mendelzon, A.O. (eds.) DBPL 1999. LNCS, vol. 1949, pp. 43–60. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  28. Zaniolo, C.: Key Constraints and Monotonic Aggregates in Deductive Databases. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 109–134. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., Roskilde University, P.O.Box 260, DK-4000, Roskilde, Denmark

    Davide Martinenghi

Authors
  1. Davide Martinenghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research group PLIS: Programming, Logic and Intelligent Systems, Department of Communication, Business and Information Technologies, Roskilde University, P.O. Box 260, DK-4000, Roskilde, Denmark

    Henning Christiansen

  2. LIRIS - UFR d’Informatique, Université Claude Bernard Lyon 1, 43, boulevard du 11 novembre 1918,, 69622, Villeurbanne, France

    Mohand-Saïd Hacid

  3. Department of Computer Science, Roskilde University, P.O. Box 260, DK-4000, Roskilde, Denmark

    Troels Andreasen

  4. Department of Computer Science and Engineering, Aalborg University Esbjerg, Niels Bohrs Vej 8Niels Bohrs Vej 8, 6700, Esbjerg, Denmark

    Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martinenghi, D. (2004). Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins. In: Christiansen, H., Hacid, MS., Andreasen, T., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2004. Lecture Notes in Computer Science(), vol 3055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25957-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25957-2_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22160-9

  • Online ISBN: 978-3-540-25957-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation