Data mining using query flocks with views

Date

2000-01-01

Author

Yetisgen, Meliha
Toroslu, İsmail Hakkı

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

10
views

0
downloads

Cite This

© Springer-Verlag Berlin Heidelberg 2000.Data Mining is the process of finding trends and patterns in large data. Association rule mining become one of the most important techniques for extracting useful information such as regularities in the historical data. Query flocks extends the concept of association rule mining with a ”generate-and-test” model for many different kind of patterns. This paper further extends the query flocks with view definitions. Also, a new data mining architecture simply compiles the query flocks from datalog to SQL. On this architecture, optimizations suitable for the extended query flocks are introduced. The prototype of the system is developed on a commercial database environment. Advantages of the new design and the extension to the query flocks, together with the optimizations, are also presented.

Subject Keywords

Association rule, Total execution time, Connection graph, View evaluation, Parameterized query

URI

https://hdl.handle.net/11511/56759

Collections

Department of Computer Engineering, Conference / Seminar