SpringerLink
Log in

A Formal Context for Acyclic Join Dependencies

  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 2017)

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

Included in the following conference series:

Abstract

Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this paper, we use Formal Concept Analysis (FCA) to characterize a set of AJDs that hold in a given dataset. This present work simplifies and generalizes the characterization of Multivalued Dependencies with FCA.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.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
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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 ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Baixeries, J.: A formal concept analysis framework to model functional dependencies. In: Mathematical Methods for Learning (2004)

    Google Scholar 

  2. Baixeries, J., Balcázar, J.L.: Characterization and armstrong relations for degenerate multivalued dependencies using formal concept analysis. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 162–175. Springer, Heidelberg (2005). doi:10.1007/978-3-540-32262-7_11

    Chapter  Google Scholar 

  3. Baixeries, J., Balcázar, J.L.: A lattice representation of relations, multivalued dependencies and armstrong relations. In: ICCS, pp. 13–26 (2005)

    Google Scholar 

  4. Baixeries,J., Kaytoue, M., Napoli, A.: Computing similarity dependencies with pattern structures. In: Ojeda-Aciego, M., Outrata, J. (eds.) CLA. CEUR Workshop Proceedings, vol. 1062, pp. 33–44 (2013). http://ceur-ws.org/

  5. Baixeries, J., Kaytoue, M., Napoli, A.: Characterizing functional dependencies in formal concept analysis with pattern structures. Ann. Math. Artif. Intell. 72(1–2), 129–149 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30(3), 479–513 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  7. Beeri, C., Vardi, M.Y.: Formal systems for join dependencies. Theoret. Comput. Sci. 38, 99–116 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  8. Berge, C.: Hypergraphs. North-Holland Mathematical Library, vol. 45. North-Holland, Amsterdam (1989)

    MATH  Google Scholar 

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

    Google Scholar 

  10. Codd, E.F.: Further normalization of the data base relational model. IBM Research Report, San Jose, California, RJ909 (1971)

    Google Scholar 

  11. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Berlin (1999)

    Book  MATH  Google Scholar 

  12. Gyssens, M.: On the complexity of join dependencies. ACM Trans. Database Syst. 11(1), 81–108 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kanellakis, P.C.: Elements of relational database theory. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science (Vol. B), pp. 1073–1156. MIT Press, Cambridge (1990)

    Google Scholar 

  14. Kuznetsov, S.O.: Machine learning on the basis of formal concept analysis. Autom. Remote Control 62(10), 1543–1564 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lopes, S., Petit, J.-M., 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 

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

    MATH  Google Scholar 

  17. Malvestuto, F.: A complete axiomatization of full acyclic join dependencies. Inf. Process. Lett. 68(3), 133–139 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Medina, R., Nourine, L.: Conditional functional dependencies: an FCA point of view. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 161–176. Springer, Heidelberg (2010). doi:10.1007/978-3-642-11928-6_12

    Chapter  Google Scholar 

Download references

Acknowledgments

This research work has been supported by the SGR2014-890 (MACDA) project of the Generalitat de Catalunya, and MINECO project APCOM (TIN2014-57226-P).

Author information

Authors and Affiliations

  1. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya, 08024, Barcelona, Catalonia, Spain

    Jaume Baixeries

Authors
  1. Jaume Baixeries
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaume Baixeries .

Editor information

Editors and Affiliations

  1. Warsaw University of Technology, Warsaw, Poland

    Marzena Kryszkiewicz

  2. University of Bari Aldo Moro, Bari, Italy

    Annalisa Appice

  3. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Dominik Ślęzak

  4. Faculty of Electronics & Information, Warsaw University of Technology, Warsaw, Poland

    Henryk Rybinski

  5. Institute of Mathematics, Warsaw University, Warsaw, Poland

    Andrzej Skowron

  6. Department of Computer Science, University of North Carolina at Charlotte, North Carolina, USA

    Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Baixeries, J. (2017). A Formal Context for Acyclic Join Dependencies. In: Kryszkiewicz, M., Appice, A., Ślęzak, D., Rybinski, H., Skowron, A., Raś, Z. (eds) Foundations of Intelligent Systems. ISMIS 2017. Lecture Notes in Computer Science(), vol 10352. Springer, Cham. https://doi.org/10.1007/978-3-319-60438-1_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60438-1_55

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60437-4

  • Online ISBN: 978-3-319-60438-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation