Abstract
User-defined aggregates (UDAs) can be the linchpin of sophisticated data mining functions and other advanced database applications, but they find little support in current database systems.In this paper, we describe the SQL-AG prototype that overcomes these limitations by supporting UDAs as originally proposed in Postgres and SQL3. Then we extend the power and flexibility of UDAs by adding (i) early returns, (to express online aggregation) and (ii) syntactically recognizable monotonic UDAs that can be used in recursive queries to support applications, such as Bill of Materials (BoM) and greedy algorithms for graph optimization, that cannot be expressed under stratified aggregation. This paper proposes a unified solution to both the theoretical and practical problems of UDAs, and demonstrates the power of UDAs in dealing with advanced database applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul S., Hull R. and Vianu V., Foundations of Databases, Addison Wesley, 1995. 54
S. Brin, R. Motwani, J. D. Ullman, S.L. Tsur, “Dynamic Itemset Counting and Implication Rules for Market Basket Data”.In SIGMOD’97. 48
D. Chamberlin, “Using the new DB2, IBM’s Object-Relational Database System,” Morgan Kaufmann, 1996. 45, 49
Cindy Xinmin Chen, Carlo Zaniolo: Universal Temporal Extensions for Database Languages.ICDE 1999: 428–437. 45, 46
Charles Elkan. “Boosting and Naive Bayesian Learning”. Technical report no cs97-557, Dept.of Computer Science and Engineering, UCSD, September 1997. 44
J.M. Hellerstein, P. J. Haas, H.J. Wang. “Online Aggregation”. SIGMOD, 1997. 46
M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, J.D. Ullman, “Computing Iceberg Queries Efficiently”.In VLDB 1998. 48
ISO/IEC JTC1/SC21 N10489, ISO//IEC 9075, “Committee Draft (CD), Database Language SQL”, July 1996. 43, 45, 46
Finkelstein, S.J., N. Mattos, I.S. Mumick, and H. Pirahesh, Expressing Recursive Queries in SQL, ISO WG3 report X3H2-96-075, March 1966. 47
S. Ganguly, S. Greco, and C. Zaniolo, “Extrema Predicates in Deductive Databases,” JCSS 51(2): 244–259 (1995). 47, 50, 58
M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. Procs. Joint International Conference and Symposium on Logic Programming, pp. 1070–1080, 1988. 48, 54, 56
F. Giannotti, D. Pedreschi, and C. Zaniolo, “Semantics and Expressive Power of Non-Deterministic Constructs in Deductive Databases,” JCSS, to appear. 54, 56
Gyssen, M., Van Gucht, D. and Badia, A., Query Languages with Generalized Quantifiers, in Applications of Logic Databases, R. Ramakrishan, Kluwer, 1995. 53
Hsu, P.Y.and Parker, D.S., “Improving SQL with Generalized Quantifiers,” Proc. ICDE 1995. 53
A. Van Gelder. “Foundations of Aggregations in Deductive Databases.” Proc. of the Int. Conf. On Deductive and Object-Oriented databases, 1993. 47, 50, 58
David B. Kemp and Peter J. Stuckey, “Semantics of logic programs with aggregates” Proc. 1991 International Symposium on Logic Programming, pages 387–401, October 1991. 56
D. Srivastava, R. Ramakrishnan, P. Seshadri, S. Sudarshan. Coral++: Adding Object-Orientation to a Logic Database Language.In VLDB 1993: 158–170. 47, 53, 58
R. Rastogi, K. Shim. “PUBLIC: A Decision Tree Classiffier that Integrates Building and Pruning”.VLDB 1998: 404–415. 48
K.A. Ross and Yehoshua Sagiv, “Monotonic Aggregation in Deductive Database”, JCSS 54(1), 79–97 (1997). 47, 50, 57, 58
S.A. Naqvi, S. Tsur “A Logical Language for Data and Knowledge Bases”, W. H. Freeman, 1989. 51
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. 54, 56
D. Saccá and C. Zaniolo, Deterministic and non-deterministic Stable Models, Journal of Logic and Computation, 7(5):555–579, October 1997. 54, 56
S. Sarawagi, S. Thomas, R. Agrawal, “Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications”.In SIGMOD, 1998. 45
J.C. Shafer, R. Agrawal, M. Mehta, “SPRINT: A Scalable Parallel Classiffier for Data Mining”.In VLDB 1996. 45
Haixun Wang, The SQL-AG System, http://magna.cs.ucla.edu/~hxwang/sqlag/sqlag.html 49, 58
H. Wang and C. Zaniolo “User-Defined Aggregates in Datamining,” ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD’99, May 30, 1999. 46
H. Wang, and C. Zaniolo “User Defined Aggregates in Object-Relational Systems” ICDE 2000 Conference, San Diego, CA, February 29-March 3, 2000. 59
C. Zaniolo et al. LDL++ Documentation and Web Demo, http://www.cs.ucla.edu/ldl 51, 53, 57, 58
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H., Zaniolo, C. (2000). User-Defined Aggregates in Database Languages. In: Connor, R., Mendelzon, A. (eds) Research Issues in Structured and Semistructured Database Programming. DBPL 1999. Lecture Notes in Computer Science, vol 1949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44543-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-44543-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41481-0
Online ISBN: 978-3-540-44543-2
eBook Packages: Springer Book Archive