Skip to main content

Data Mining Using Query Flocks with Views

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1873))

Included in the following conference series:

  • 1786 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. Agrawal. Fast Algorithms for Mining Association Rules. Proceedings of the 20th VLDB Conference, pages 487–499, 1994.

    Google Scholar 

  2. R. Agrawal, T. Imielinski, and A. Swami. Mining Assocation Rules between Sets of Items in Large Databases. Proceedings of ACM SIGMOD International Conference on Management of Data, pages 207–216, 1993.

    Google Scholar 

  3. R. Groth. Data Mining-Building Competitive Advantage. Prentice Hall, 1999.

    Google Scholar 

  4. L. J. Henschen. On Compiling Queries in Recursive First-Order Databases. Journal of the Associations for Computing Machinery, 31(1):47–85, 1984.

    Article  MathSciNet  Google Scholar 

  5. R. Ramakrishnan. Database Management Systems. McGraw-Hill, 1997.

    Google Scholar 

  6. R. Srikant and R. Agrawal. Mining Generalized Association Rules. Proceedings of the 21th VLDB Conference, 1995.

    Google Scholar 

  7. D. Tsur, S. Nestorov, and A. Rosenthal. Integrating Data Mining with Relational DBMS: A Tightly Coupled Approach. Proceedings of 4th Workshop on Next Generation Information Technologies and Systems NGITS’99, 1999.

    Google Scholar 

  8. D. Tsur, J.D. Ullman, S. Abiteboul, C. Clifton, R. Motwani, S. Nestorov, and A. Rosenthal. Query ocks: A Generalization of Association-Rule Mining. Proceedings of ACM SIGMOD International Conference on Management of Data, pages 1–12, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yetisgen, M., Toroslu, I.H. (2000). Data Mining Using Query Flocks with Views. In: Ibrahim, M., Küng, J., Revell, N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44469-6_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-44469-6_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67978-3

  • Online ISBN: 978-3-540-44469-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics