Skip to main content
SpringerLink
Log in

Conditional Functional Dependencies: An FCA Point of View

  • Conference paper
Formal Concept Analysis (ICFCA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5986))

Included in the following conference series:

Abstract

Conditional Functional Dependencies (CFDs) are Functional Dependencies (FDs) that hold on a fragment relation of the original relation. In [17], the hierarchy between CFDs, association rules and some other dependencies have been shown.

This paper exhibits the relation between CFDs and FCA. Given a many-valued relation we define a labeled lattice which gives a synthetic representation of the hierarchy of dependencies. Moreover, a formal concept in the nominal scaling of the relation is an instance of a closed set in the labeled lattice. Pure CFDs correspond to edges in this labeled lattice. We exhibit a monotone function on CFDs allowing search and pruning strategies. We also show that transitive edges induce redundant CFDs.

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

Access this chapter

Log in via an institution
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.

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)

    Google Scholar 

  2. Baixeries, J., Balcàzar, J.-L.: A lattice representation of relations, multivalued dependencies and armstrong relations. In: ICCS 2005, International Conference on Conceptual Structures (2005)

    Google Scholar 

  3. Baudinet, M., Chomicki, J., Wolper, P.: Constraint-generating dependencies. J. Comput. Syst. Sci. 59(1), 94–115 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Beeri, C., Vardi, M.Y.: Formal systems for tuple and equality generating dependencies. SIAM J. Comput. 13(1), 76–98 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  5. Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. Journal of the ACM 31, 30–46 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bell, S., Brockhausen, P.: Discovery of data dependencies in relational databases. Technical Report LS-8 Report-14, University of Dortmund (1995)

    Google Scholar 

  7. Bohannon, P., Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for data cleaning. In: ICDE, pp. 746–755 (2007)

    Google Scholar 

  8. Chaudron, L., Maille, N.: Generalized formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, pp. 357–370. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Chomicki, J., Marcinkowski, J.: On the computational complexity of minimal-change integrity maintenance in relational databases. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 119–150. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Codd, E.F.: Further normalizations of the database relational model. In: Rustin, R. (ed.) Data Base Systems, pp. 33–64. Prentice-Hall, Englewood Cliffs (1972)

    Google Scholar 

  11. De Bra, P., Paredaens, J.: An algorithm for horizontal decompositions. Inf. Process. Lett. 17(2), 91–95 (1983)

    Article  MATH  Google Scholar 

  12. Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst. 33(2) (2008)

    Google Scholar 

  13. Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, pp. 371–385. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  15. Gugish, R.: Many-valued context analysis using descriptions. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 157–168. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Medina, R., Nourine, L.: A unified hierarchy for functional dependencies, conditional functional dependencies and association rules. In: Ferré, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 98–113. Springer, Heidelberg (2009)

    Google Scholar 

  18. Missaoui, R., Nourine, L., Renaud, Y.: Generating positive and negative exact rules using formal concept analysis: Problems and solutions. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 169–181. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Petit, J.-M., Toumani, F., Boulicaut, J.-F., Kouloumdjian, J.: Towards the reverse engineering of denormalized relational databases. In: ICDE, pp. 218–227. IEEE Computer Society, Los Alamitos (1996)

    Google Scholar 

  20. Weddell, G.E.: Reasoning about functional dependencies generalized for semantic data models. ACM Transactions on Database Systems 17(1), 32–64 (1992)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Blaise Pascal – LIMOS, Campus des Cézeaux, 63173, Aubière Cedex, France

    Raoul Medina & Lhouari Nourine

Authors
  1. Raoul Medina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lhouari Nourine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, Zurich University of Applied Sciences, Technikumstraße 9, 8401, Winterthur, Switzerland

    Léonard Kwuida

  2. SAP Research Center, Chemnitzer Straße 48, 01187, Dresden, Germany

    Barış Sertkaya

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Medina, R., Nourine, L. (2010). Conditional Functional Dependencies: An FCA Point of View. In: Kwuida, L., Sertkaya, B. (eds) Formal Concept Analysis. ICFCA 2010. Lecture Notes in Computer Science(), vol 5986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11928-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11928-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11927-9

  • Online ISBN: 978-3-642-11928-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation