Abstract
In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user interacts with the DBMS using advanced, constraint-based languages for data mining where constraints have been specifically introduced to increase the relevance of the results and, at the same time, to reduce its volume.
In this paper we study the problem of mining frequent itemsets using an inductive database. We propose a technique for query answering which consists in rewriting the query in terms of union and intersection of the result sets of other queries, previously executed and materialized. Unfortunately, the exploitation of past queries is not always applicable. We then present sufficient conditions for the optimization to apply and show that these conditions are strictly connected with the presence of functional dependencies between the attributes involved in the queries. We show some experiments on an initial prototype of an optimizer which demonstrates that this approach to query answering is not only viable but in many practical cases absolutely necessary since it reduces drastically the execution time.
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.
References
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Knowledge Discovery in Databases, vol. 2, AAAI/MIT Press, Santiago, Chile (September 1995)
Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery 7(1), 5–22 (2003)
Chaudhuri, S., Krishnamurthy, S., Potarnianos, S., Shim, K.: Optimizing queries with materialized views. In: Proc. of 11th ICDE (March 1995)
Chaudhuri, S., Narasayya, V., Sarawagi, S.: Efficient evaluation of queries with mining predicates. In: Proc. of the 18th Int’l Conference on Data Engineering (ICDE), San Jose, USA (April 2002)
Chaudhuri, S., Shim, K.: Optimizing queries with aggregate views. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, Springer, Heidelberg (1996)
Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman, J.: Computing iceberg queries efficiently. In: Proceeding of VLDB 1998 (1998)
Gupta, A., Harinarayan, V., Quass, D.: Aggregate query processing in data warehousing environments. In: Proceedings of VLDB 1995, pp. 358–369 (1995)
Han, J., Fu, Y., Wang, W., Koperski, K., Zaiane, O.: DMQL: A data mining query language for relational databases. In: Proceedings of SIGMOD 1996 Workshop on Research Issues on Data Mining and Knowledge Discovery (1996)
Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM 39(11), 58–64 (1996)
Imielinski, T., Virmani, A., Abdoulghani, A.: Datamine: Application programming interface and query language for database mining. In: KDD 1996, pp. 256–260 (1996)
Lenz, H.-J., Shoshani, A.: Summarizability in olap and statistical data bases. In: Proceedings Ninth International Conference on Scientific and Statistical Database Management, August 1997, pp. 132–143. IEEE Computer Society, Los Alamitos (1997)
Leung, C.K.-S., Lakshmanan, L.V.S., Ng, R.T.: Exploiting succinct constraints using fp-trees. ACM SIGKDD Explorations 4(1), 40–49 (2002)
Malvestuto, F.M.: The derivation problem for summary data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 82–89 (1988)
Meo, R., Psaila, G., Ceri, S.: A new SQL-like operator for mining association rules. In: Proceedings of the 22st VLDB Conference, Bombay, India (September 1996)
Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of 1998 ACM SIGMOD International Conference Management of Data, pp. 13–24 (1998)
Nutt, W., Sagiv, Y., Shurin, S.: Deciding equivalence among aggregate queries. In: Proceedings of ACM PODS, pp. 214–223 (1998)
Park, C.-S., Kim, M.H., Lee, Y.-J.: Rewriting olap queries using materialized views and dimension hierarchies in data warehouses. In: Proceeding of ICDE 2001 (2001)
Nutt, W., Sagiv, Y., Shurin, S.: Deciding equivalence among aggregate queries. In: Proceedings of ACM PODS, pp. 214–223 (1998)
Raedt, L.D.: A perspective on inductive databases. ACM SIGKDD Explorations 4(2), 69–77 (2002)
Raedt, L.D., Jaeger, M., Lee, S.D., Mannila, H.: A theory of inductive query answering. In: Proceedings of IEEE International Conference on Data Mining, December 2002, pp. 123–130. IEEE Computer Society, Los Alamitos (2002)
Raedt, L.D.: A perspective on inductive databases. ACM SIGKDD Explorations 4(2), 69–77 (2002)
Srivastava, D., Dar, S., Jagadish, H.V., Levy, A.Y.: Answering queries with aggregation using views. In: Proceeding of VLDB 1996 (1996)
Tsur, D., Ullman, J.D., Abiteboul, S., Clifton, C., Motwani, R., Nestorov, S., Rosenthal, A.: Query flocks: A generalization of association-rule mining. In: Proceedings of 1998 ACM SIGMOD International Conference Management of Data (1998)
24. H. Wang and C. Zaniolo. User defined aggregates for logical data languages. In: Proc. of DDLP, pp. 85–97 (1998)
Wang, X.S., Li, C.: Deriving orthogonality to optimize the search for summary data. Information Systems 24(1), 47–65 (1999)
26. Y. Zhao, P. M.Deshpande, J. F. Naughton, and A. Shukla. Simultaneous optimization and evaluation of multiple dimensional queries. In: Proceedings of ACM SIGMOD 1998, pp. 271–282 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meo, R., Botta, M., Esposito, R. (2004). Query Rewriting in Itemset Mining. 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_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-25957-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22160-9
Online ISBN: 978-3-540-25957-2
eBook Packages: Springer Book Archive