Skip to main content

Towards a Parallel Approach for Incremental Mining of Functional Dependencies on Multi-core Systems

  • Conference paper
Knowledge-Based and Intelligent Information and Engineering Systems (KES 2011)

Abstract

A general assumption in all existing algorithms for mining functional dependencies is that the database is static. However, real life databases are frequently updated. To the best of our knowledge, the discovery of functional dependencies in dynamic databases has never been studied. A naïve solution consists in re-applying one of the existing algorithms to discover functional dependencies holding on the updated database. Nevertheless, in many domains, where response time is crucial, re-executing algorithms from the scratch would be inacceptable. To address this problem, we propose to harness the multi-core systems for an incremental technique for discovering the new set of functional dependencies satisfied by the updated database. Through a detailed experimental study, we show that our parallel algorithm scales very well with the number of cores available.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Baixeries, J.: A formal concept analysis framework to mine functional dependencies. In: Proceeding of the Workshop on Mathematical Methods for Learning, Villa Geno, Italy (2004)

    Google Scholar 

  3. Demetrovics, J., Libkin, L., Muchnik, I.B.: Functional dependencies in relational databases: A lattice point of view. Discrete Applied Mathematics 40, 155–185 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Flesca, S., Furfaro, F., Greco, S., Zumpano, E.: Repairing inconsistent xml data with functional dependencies. In: Rivero, L.C., Doorn, J.H., Ferraggine, V.E. (eds.) Encyclopedia of Database Technologies and Applications, pp. 542–547. Idea Group, USA (2005)

    Chapter  Google Scholar 

  5. Huhtala, Y., Kärkkäinen, J., Porkka, P., Toivonen, H.: Tane: An efficient algorithm for discovering functional and approximate dependencies. Computer Journal 42(2), 100–111 (1999)

    Article  MATH  Google Scholar 

  6. Lopes, S., Petit, J., Lakhal, L.: Efficient discovery of functional dependencies and armstrong relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 350–364. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Lopes, S., Petit, J., Lakhal, L.: Functional and approximate dependency mining: database and FCA points of view. J. Exp. Theor. Artif. Intell. 14(2-3), 93–114 (2002)

    Article  MATH  Google Scholar 

  8. Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)

    MATH  Google Scholar 

  9. Mannila, H., Räihä, K.: Design by example: An application of armstrong relations. Journal of Computer and System Sciences 33(2), 126–141 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mannila, H., Räihä, K.: Dependency inference. In: Proceedings of 13th International Conference on Very Large Data Bases, Brighton, England, September 1-4, pp. 155–158 (1987)

    Google Scholar 

  11. Mannila, H., Räihä, K.: Algorithms for inferring functional dependencies from relations. Data Knowl. Eng. 12(1), 83–99 (1994)

    Article  MATH  Google Scholar 

  12. Novelli, N., Cicchetti, R.: Fun: An efficient algorithm for mining functional and embedded dependencies. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 189–203. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Tan, H.B.K., Zhao, Y.: Automated elicitation of functional dependencies from source codes of database transactions. Information & Software Technology 46(2), 109–117 (2004)

    Article  Google Scholar 

  14. Wyss, C.M., Giannella, C., Robertson, E.L.: Fastfds: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances - extended abstract. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 101–110. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Yao, H., Hamilton, H.J., Butz, C.J.: Fd_mine: Discovering functional dependencies in a database using equivalences. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan, December 9-12, pp. 729–732 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gasmi, G., Slimani, Y., Lakhal, L. (2011). Towards a Parallel Approach for Incremental Mining of Functional Dependencies on Multi-core Systems. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6881. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23851-2_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23851-2_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23850-5

  • Online ISBN: 978-3-642-23851-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics