Computing supports of conjunctive queries on relational tables with functional dependencies

Fundamenta Informaticae

Volumn 99, Issue 3, 2010, Pages 263-292

  Jen, Tao Yuan ^a   Laurent, Dominique ^a   Spyratos, Nicolas ^b  

^a UNIVERSITÉ DE CERGY PONTOISE   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

data mining; equivalent queries; frequent queries; Functional dependencies; level wise algorithms

Indexed keywords

DATA MINING; SET THEORY;

ANTI-MONOTONICITY; CONJUNCTIVE QUERIES; EQUIVALENCE RELATIONS; EQUIVALENT QUERIES; FREQUENT QUERIES; FUNCTIONAL DEPENDENCY; LEVEL-WISE ALGORITHMS; RELATIONAL TABLES;

EQUIVALENCE CLASSES;

EID: 77954081613     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2010-249     Document Type: Article

References (18)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 309-328. AAAI-MIT Press, 1996.
2. W.W. Armstrong. Dependency structures of data base relationships. In IFIP Congress, pages 580-583. North Holland, 1974.
3. C. Beeri, M. Downd, R. Fagin, and R. Statman. On the structure of armstrong relations for functional dependencies. Journal of the ACM, 31(1):30-46, 1984.
4. Ph. Bohannon, W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Conditional functional dependencies for data cleaning. In ICDE, pages 746-755, 2007.
5. L. Dehaspe and L. De Raedt. Mining association rules in multiple relations. In 7th International Workshop on Inductive Logic Programming, volume 1297 of LNCS, pages 125-132. Springer Verlag, 1997.
6. C.T. Diop, A. Giacometti, D. Laurent, and N. Spyratos. Composition of mining contexts for efficient extraction of association rules. In EDBT'02, volume 2287 of LNCS, pages 106-123. Springer Verlag, 2002.
7. A. Faye, A. Giacometti, D. Laurent, and N. Spyratos. Mining rules in databases with multiple tables: Problems and perspectives. In 3rd International Conference on Computing Anticipatory Systems (CASYS), 1999.
8. B. Goethals. Mining queries, (unpublished paper). In Workshop on inductive databases and constraint based mining. Available at http://www.informatik.uni-freiburg.de/ml/IDB/talks/Goethals- slides.pdf, 2004.
9. B. Goethals and J. Van den Bussche. Relational association rules: getting warmer. In ESF Exploratory Workshop on Pattern Detection and Discovery in Data Mining, volume 2447 of LNCS, pages 125-139. Springer-Verlag, 2002.
10. B. Goethals, E. Hoekx, and J. Van den Bussche. Mining tree queries in a graph. In 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 61-69, 2005.
11. B. Goethals, W. Le Page, and H. Mannila. Mining association rules of simple conjunctive queries. In SIAM-SDM, pages 96-107, 2008.
12. J. Han, Y. Fu, W. Wang, K. Koperski, and O. Zaiane. Dmql: A data mining query language for relational databases. In SIGMOD-DMKD'96, pages 27-34, 1996.
13. T.Y. Jen, D. Laurent, and N. Spyratos. Mining all frequent selection-projection queries from a relational table. In EDBT'08, pages 368-379. ACM Press, 2008.
14. T.Y. Jen, D. Laurent, and N. Spyratos. Mining frequent conjunctive queries in star schemas. In International Database Engineering and Applications Symposium (IDEAS), pages 97-108. ACM Press, 2009.
15. T.Y. Jen, D. Laurent, N. Spyratos, and O. Sy. Towards mining frequent queries in star schemes. In International Workshop on Knowledge Discovery in Databases (KDID), volume 3933 of LNCS, pages 104-123. Springer Verlag, 2005.
16. R. Meo, G. Psaila, and S. Ceri. An extension to sql for mining association rules. Data Mining and Knowledge Discovery, 9:275-300, 1997.
17. T. Turmeaux, A. Salleb, C. Vrain, and D. Cassard. Learning caracteristic rules relying on quantified paths. In PKDD, volume 2838 of LNCS, pages 471-482. Springer Verlag, 2003.
18. J.D. Ullman. Principles of Databases and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.