Query Answering in Relational Inductive Databases

Inductive databases can be viewed as a natural extension of traditional databases to contain not only persistent data but also the generalization of stored data, which are called patterns. The idea of inductive databases has been proposed originally as a support system for the knowledge discovery or data mining process. Many SQL-like languages have been designed and implemented to include mining operators in the SQL primitives. We percept the concept of inductive databases in a different angle. In stead of designing yet another inductive database system, we are looking for the deployment of an existing inductive query language and environment to support the database tasks. We focus on the task of query answering which has a high potential of being a beneficiary of the stored patterns in inductive databases. Our experimental results of query rewriting technique using induced patterns as a semantic knowledge confirm this advantage.

[1]  Francesco Bergadano,et al.  Inductive Database Relations , 1993, IEEE Trans. Knowl. Data Eng..

[2]  Kyuseok Shim,et al.  Developing Tightly-Coupled Data Mining Applications on a Relational Database System , 1996, KDD.

[3]  Zhaohui Tang,et al.  Data Mining with SQL Server 2005 , 2005 .

[4]  Sunita Sarawagi,et al.  Integrating association rule mining with relational database systems: alternatives and implications , 1998, SIGMOD '98.

[5]  Heikki Mannila,et al.  Inductive Databases and Condensed Representations for Data Mining , 1997, ILPS.

[6]  Heikki Mannila,et al.  A database perspective on knowledge discovery , 1996, CACM.

[7]  Giuseppe Psaila,et al.  A tightly-coupled architecture for data mining , 1998, Proceedings 14th International Conference on Data Engineering.

[8]  Tomasz Imielinski,et al.  MSQL: A Query Language for Database Mining , 1999, Data Mining and Knowledge Discovery.

[9]  Giuseppe Psaila,et al.  A New SQL-like Operator for Mining Association Rules , 1996, VLDB.

[10]  Jean-François Boulicaut,et al.  Modeling KDD Processes within the Inductive Database Framework , 1999, DaWaK.

[11]  Yang Yang,et al.  CRD: A New Data Mining Method in Deductive Databases , 1997, DDLP.

[12]  Luc De Raedt,et al.  An algebra for inductive query evaluation , 2003, Third IEEE International Conference on Data Mining.

[13]  Gregory Piatetsky-Shapiro,et al.  Advances in Knowledge Discovery and Data Mining , 2004, Lecture Notes in Computer Science.

[14]  Shalom Tsur,et al.  Integrating Data Mining with Relational DBMS: A Tightly-Coupled Approach , 1999, NGITS.

[15]  Luc De Raedt,et al.  A perspective on inductive databases , 2002, SKDD.

[16]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[17]  Rosa Meo.  Inductive databases: towards a new generation of databases for knowledge discovery , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[18]  Agathoniki Trigoni,et al.  Using association rules to add or eliminate query constraints automatically , 2001, Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001.

[19]  Jean-François Boulicaut,et al.  Querying Inductive Databases: A Case Study on the MINE RULE Operator , 1998, PKDD.

[20]  Wei Wang,et al.  DMQL: A Data Mining Query Language for Relational Databases , 2007 .