Title
Data Mining In Deductive Databases Using Query Flocks: Extended Abstract
Abstract
An important technique for extracting useful information, such as regularities, from usually historical data, is called as association rule mining. The query flocks technique, which extends the concept of association rule mining with a "generate-and-test" model for different kind of patterns, can also be applied to deductive databases. In this paper, query flocks technique is extended further, with view definitions including recursive views. We have designed architecture to compile query flocks from datalog into SQL in order to be able to use commercially available DBMS's as an underlying engine. Since recursive datalog views (IDB's) cannot be converted directly into SQL statements, they are materialized before the final compilation operation.
Publication Date
12-1-2002
Publication Title
Proceedings of the Joint Conference on Information Sciences
Volume
6
Number of Pages
494-497
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
1642409373 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/1642409373
STARS Citation
Toroslu, Ismail H. and Yetisgen, Meliha, "Data Mining In Deductive Databases Using Query Flocks: Extended Abstract" (2002). Scopus Export 2000s. 2304.
https://stars.library.ucf.edu/scopus2000/2304