Skip to main content
SpringerLink
Log in

Logic-Based User-Defined Aggregates for the Next Generation of Database Systems

  • Chapter
The Logic Programming Paradigm

Part of the book series: Artificial Intelligence ((AI))

Summary

In this paper, we provide logic-based foundations for the extended aggregate constructs required by advanced database applications. In particular, we focus on data mining applications and show that they require user-defined aggregates extended with early returns. Thus, we propose a simple formalization of extended user-defined aggregates using the nondeterministic construct of choice. We obtain programs that have a formal semantics based on the concept of total stable models, but are also amenable to efficient implementation. Our formalization leads to a simple syntactic characterization of user-defined aggregates that are monotone with respect to set containment. Therefore, these aggregates can be freely used in recursive programs, and the fixpoints for such programs can be computed efficiently using the standard techniques of deductive databases. We describe the many new applications of user-defined aggregates, and their implementation for the logical data language LDL++. Finally, we discuss the transfer of this technology to SQL databases.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul S., Hull R. and Vianu V., Foundations of Databases, Addison Wesley, 1995

    Google Scholar 

  2. R. Agrawal and R. Srikant, “Fast Algorithm for Mining Association Rules”. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994.

    Google Scholar 

  3. R. Agrawal and J.C. Shafer, “Parallel Mining of Association Rules: Design, Implementation and Experience”, IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 6, Dec. 1996.

    Google Scholar 

  4. P. Barghava, “User-Defined Aggregates in Database Languages”, MS Thesis, UCLA, 1998: http://www.cs.ucla.edu/~csdemo/SQL-AG

    Google Scholar 

  5. S.Br in, R1 Motwani,J. Ullman, and S. Tsur, “Dynamic Itemset: Counting and Implication Rules for Market Basket Data”, Proceedings ACM-SIGMOD Int. Conf on Management of Data, May 1997

    Google Scholar 

  6. C. X. Chen and C. Zaniolo, “Universal Temporal Data Languages”, DDLP’98 Workshop, 1998

    Google Scholar 

  7. M. P. Consens and A. O. Mendelzon, “Low Complexity Aggregation in Graphlog and Datalog ”, ICDT’90,1990

    Google Scholar 

  8. I.F. Cruz and T. S. Nor veil, “Aggregative Closure: an Extension of Transitive Closure”, Proc. Fifth Int. Conference on Data Engineering, pp. 384–389, 1989.

    Google Scholar 

  9. D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, C. Zaniolo: The LDL System Prototype. IEEE Transactions on Knowledge and Data Engineering 2(1): 76–90 (1990).

    Article  Google Scholar 

  10. Charles Elkan. “Boosting and Naive Bayesian Learning”. Technical report no cs97–557, Dept. of Computer Science and Engineering, UCSD, September 1997

    Google Scholar 

  11. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motawni, J. Ullman, “Computing Iceberg Queries Efficiently”, Proceedings of the 1998 VLDB Conference, New York, NY, 1998.

    Google Scholar 

  12. J. Gray, A. Bosworth, H. Pirahesh, A. Layman. “Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total”. Proc. International Conference on Data Engineering, 1996.

    Google Scholar 

  13. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. Proceedings of Joint International Conference and Symposium on Logic Programming, pp. 1070–1080, Seattle, WA, 1988

    Google Scholar 

  14. Gyssen, M., Van Gucht, D. and Badia, A., Query Languages with Generalized Quantifiers, in Applications of Logic Databases, R. Ramakrishan, Kluwer, 1995.

    Google Scholar 

  15. F. Gianotti, D. Pedreschi, and C.Zaniolo, “Semantics and Expressive Power of Non-Deterministic Constructs in Deductive Databases”,JCSS to appear

    Google Scholar 

  16. S. Greco and C. Zaniolo, “Greedy Algorithms in Datalog with Choice and Negation”, JICSLP’98, Manchester UK, June 16,–19, 1998.

    Google Scholar 

  17. J. M. Hellerstein, P.J. Haas, and H.J. Wang. “Online Aggregation.” Proceedings of the 1997 ACM-SIGMOND Conference on Management of Data, 249–256, ACM Press, 1997.

    Google Scholar 

  18. Hsu, P. Y. and Parker, D. S., Improving SQL with Generalized Quantifiers, Procs Eleventh Intl. Conference on Data Engineering, 1995, 398–305, IEEE Computer Society Press, 1995.

    Google Scholar 

  19. “Database Language SQL - Part 2: SQL/Foundation”., July 1996

    Google Scholar 

  20. David B. Kemp and Peter J. Stuckey. “Semantics of logic programs with aggregates” Proceedings of the 1991 International Symposium on Logic Programming, pages 387–401, October 1991.

    Google Scholar 

  21. I. Motakis and C. Zaniolo, Proceedings of the 1997 ACM-SIGMOD Conference on Management of Data, 440–451, ACM Press, New York, 1997.

    Google Scholar 

  22. S. Mumick, H. Pirahesh, and R. Ramakrishan, “The magic of duplicates and aggregates”, VLDB 1990, pp. 264–277, 1990.

    Google Scholar 

  23. K. A. Ross and Yehoshua Sagiv, “Monotonic Aggregation in Deductive Database”, JCSS, 54(1), 79–97 (1997).

    MATH  Google Scholar 

  24. L. Rowe and M. Stonebraker. “The POSTGRES Data Model”. VLDB 1987, 83–96, Morgan Kaufmann, 1987.

    Google Scholar 

  25. D. Saccà and C. Zaniolo. Stable models and non-determinism in logic programs with negation. Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 205–217, 1990.

    Google Scholar 

  26. D. Saccà and C. Zaniolo. Deterministic and non-deterministic stable models. Journal of Logic and Computation, 7(5):555–579, October 1997.

    Article  MathSciNet  MATH  Google Scholar 

  27. S. Sarawagi, S. Thomas, R. Agrawal, “Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications”, Proceedings ACM-SIGMOD Int. Conf on Management of Data, 343–354, ACM Press, 1999.

    Google Scholar 

  28. K. Shim and R. Rastogi, “PUBLIC: A Decision Tree Classifier that Integrates Building and Prun ing” VLDB’98, 405–415, Morgan Kaufmann, 1998.

    Google Scholar 

  29. W. Shen, K.Ong, B. Mitbander and C. Zaniolo,Metaqueries for Data Mining, Chapter 15 of Advances in Knowledge Discovery and Data Mining, U. M. Fayyad et al. (eds.), 395–398, MIT Press, 1996.

    Google Scholar 

  30. M. Stonebraker, L. Rowe, and M. Hirohama. “The Implementation of POSTGRES”. IEEE Transactions on Knowledge and Data Engineering, 2(1), 145–152, March 1990.

    Article  Google Scholar 

  31. A. Van Gelder. Foundations of Aggregations in Deductive Databases Proc. of the Int. Conf. On Deductive and Object-Oriented databases DOOD’93, 13–34 Springer Verlag, 1993.

    Google Scholar 

  32. Keenan, E. and Westertahl, D., Generalized Quantifiers in Linguistic and Logic, In Generalized quantifiers in Natural Language, van Benthem and ter Meulen (eds.) Foris Publications, 1985.

    Google Scholar 

  33. Carlo Zaniolo. “Design and Implementation of a Logic Based Language for Data Intensive Applications”. Proceeding of the International Conference on Logic Programming, 1666–1687, MIT Press, 1988.

    Google Scholar 

  34. Carlo Zaniolo, N. Arni, and K. Ong. “Negation and Aggregates in Recursive Rules: the LDL++ Approach”. DOOD, 204–221, 1993.

    Google Scholar 

  35. C. Zaniolo S. Ceri et al., Advanced Database Systems, Morgan Kaufmann Publishers, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of California at Los Angeles, Los Angeles, CA 90095, USA

    Carlo Zaniolo & Haixun Wang

Authors
  1. Carlo Zaniolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haixun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Stichting Mathematisch Centrum, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098, Amsterdam, SJ, The Netherlands

    Krzysztof R. Apt

  2. Department of Computer Science, University of Kentucky, 773 Anderson Hall, 40506-0046, Lexington, KY, USA

    Victor W. Marek  & Mirek Truszczynski  & 

  3. Computer Science Department, University at Stony Brook, Stony Brook, 11794-4400, NY, USA

    David S. Warren

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Zaniolo, C., Wang, H. (1999). Logic-Based User-Defined Aggregates for the Next Generation of Database Systems. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds) The Logic Programming Paradigm. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60085-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60085-2_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64249-4

  • Online ISBN: 978-3-642-60085-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation