Skip to main content
SpringerLink
Log in

Old Keys that Open New Doors

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10833))

Abstract

Keys are a core enabler for data management. They are fundamental for understanding the structure and semantics of data.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Similar content being viewed by others

References

  1. Abedjan, Z., Golab, L., Naumann, F.: Profiling relational data: a survey. VLDB J. 24(4), 557–581 (2015)

    Article  Google Scholar 

  2. Armstrong, W.W.: Dependency structures of data base relationships. In: IFIP Congress, pp. 580–583 (1974)

    Google Scholar 

  3. Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of Armstrong relations for functional dependencies. J. ACM 31(1), 30–46 (1984)

    Article  MathSciNet  Google Scholar 

  4. Biskup, J.: Some remarks on relational database schemes having few minimal keys. In: Düsterhöft, A., Klettke, M., Schewe, K.-D. (eds.) Conceptual Modelling and Its Theoretical Foundations. LNCS, vol. 7260, pp. 19–28. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28279-9_3

    Chapter  Google Scholar 

  5. Bläsius, T., Friedrich, T., Schirneck, M.: The parameterized complexity of dependency detection in relational databases. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 63. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)

    Google Scholar 

  6. Bohannon, P., Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for data cleaning. In: Chirkova, R., Dogac, A., Özsu, M.T., Sellis, T.K. (eds.) Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, 15–20 April 2007, pp. 746–755. IEEE Computer Society (2007)

    Google Scholar 

  7. Brown, P., Link, S.: Probabilistic keys. IEEE Trans. Knowl. Data Eng. 29(3), 670–682 (2017)

    Article  Google Scholar 

  8. Buneman, P., Davidson, S.B., Fan, W., Hara, C.S., Tan, W.C.: Keys for XML. Comput. Netw. 39(5), 473–487 (2002)

    Article  Google Scholar 

  9. Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM 13(6), 377–387 (1970)

    Article  Google Scholar 

  10. Demetrovics, J.: On the equivalence of candidate keys with Sperner systems. Acta Cybern. 4(3), 247–252 (1979)

    MathSciNet  MATH  Google Scholar 

  11. Demetrovics, J., Füredi, Z., Katona, G.O.H.: Minimum matrix representation of closure operations. Discrete Appl. Math. 11(2), 115–128 (1985)

    Article  MathSciNet  Google Scholar 

  12. Demetrovics, J., Katona, G.O.H., Miklós, D., Seleznjev, O., Thalheim, B.: Asymptotic properties of keys and functional dependencies in random databases. Theor. Comput. Sci. 190(2), 151–166 (1998)

    Article  MathSciNet  Google Scholar 

  13. Fagin, R.: Horn clauses and database dependencies. J. ACM 29(4), 952–985 (1982)

    Article  MathSciNet  Google Scholar 

  14. Fan, W., Fan, Z., Tian, C., Dong, X.L.: Keys for graphs. PVLDB 8(12), 1590–1601 (2015)

    Google Scholar 

  15. Ferrarotti, F., Hartmann, S., Link, S., Marin, M., Muñoz, E.: The finite implication problem for expressive XML keys: foundations, applications, and performance evaluation. In: Hameurlain, A., Küng, J., Wagner, R., Liddle, S.W., Schewe, K.-D., Zhou, X. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems X. LNCS, vol. 8220, pp. 60–94. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41221-9_3

    Chapter  Google Scholar 

  16. Gottlob, G.: Hypergraph transversals. In: Seipel, D., Turull-Torres, J.M. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 1–5. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24627-5_1

    Chapter  Google Scholar 

  17. Greco, S., Molinaro, C., Spezzano, F.: Incomplete Data and Data Dependencies in Relational Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2012)

    MATH  Google Scholar 

  18. Hannula, M., Link, S.: Automated reasoning about key sets (2018, to appear)

    Google Scholar 

  19. Hartmann, S., Leck, U., Link, S.: On Codd families of keys over incomplete relations. Comput. J. 54(7), 1166–1180 (2011)

    Article  Google Scholar 

  20. Hartmann, S., Link, S.: Unlocking keys for XML trees. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 104–118. Springer, Heidelberg (2006). https://doi.org/10.1007/11965893_8

    Chapter  Google Scholar 

  21. Hartmann, S., Link, S.: Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst. 10:34(2), 1–10:33 (2009)

    Article  Google Scholar 

  22. Katona, G.O.H., Tichler, K.: Some contributions to the minimum representation problem of key systems. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol. 3861, pp. 240–257. Springer, Heidelberg (2006). https://doi.org/10.1007/11663881_14

    Chapter  MATH  Google Scholar 

  23. Koehler, H., Leck, U., Link, S., Prade, H.: Logical foundations of possibilistic keys. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 181–195. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11558-0_13

    Chapter  Google Scholar 

  24. Köhler, H., Leck, U., Link, S., Zhou, X.: Possible and certain keys for SQL. VLDB J. 25(4), 571–596 (2016)

    Article  Google Scholar 

  25. Köhler, H., Link, S., Zhou, X.: Possible and certain SQL keys. PVLDB 8(11), 1118–1129 (2015)

    Google Scholar 

  26. Köhler, H., Link, S., Zhou, X.: Discovering meaningful certain keys from incomplete and inconsistent relations. IEEE Data Eng. Bull. 39(2), 21–37 (2016)

    Google Scholar 

  27. Koutris, P., Wijsen, J.: Consistent query answering for self-join-free conjunctive queries under primary key constraints. ACM Trans. Database Syst. 42(2), 9:1–9:45 (2017)

    Article  MathSciNet  Google Scholar 

  28. Langeveldt, W., Link, S.: Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies. Inf. Syst. 35(3), 352–374 (2010)

    Article  Google Scholar 

  29. Lausen, G.: Relational databases in RDF: keys and foreign keys. In: Christophides, V., Collard, M., Gutierrez, C. (eds.) ODBIS/SWDB -2007. LNCS, vol. 5005, pp. 43–56. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70960-2_3

    Chapter  Google Scholar 

  30. Le, V.B.T., Link, S., Ferrarotti, F.: Empirical evidence for the usefulness of Armstrong tables in the acquisition of semantically meaningful SQL constraints. Data Knowl. Eng. 98, 74–103 (2015)

    Article  Google Scholar 

  31. Levene, M., Loizou, G.: A generalisation of entity and referential integrity in relational databases. ITA 35(2), 113–127 (2001)

    MathSciNet  MATH  Google Scholar 

  32. Lucchesi, C.L., Osborn, S.L.: Candidate keys for relations. J. Comput. Syst. Sci. 17(2), 270–279 (1978)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  34. Mannila, H., Raihä, K.: Design by example: an application of Armstrong relations. J. Comput. Syst. Sci. 33(2), 126–141 (1986)

    Article  MathSciNet  Google Scholar 

  35. Paredaens, J., Bra, P.D., Gyssens, M., Gucht, D.V.: The Structure of the Relational Database Model. EATCS Monographs on Theoretical Computer Science, vol. 17. Springer, Heidelberg (1989). https://doi.org/10.1007/978-3-642-69956-6

    Book  MATH  Google Scholar 

  36. Sali, A., Schewe, K.: Keys and Armstrong databases in trees with restructuring. Acta Cybern. 18(3), 529–556 (2008)

    MathSciNet  MATH  Google Scholar 

  37. Sali, A., Székely, L.: On the existence of Armstrong instances with bounded domains. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol. 4932, pp. 151–157. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77684-0_12

    Chapter  MATH  Google Scholar 

  38. Thalheim, B.: Dependencies in Relational Databases. Teubner (1991)

    Google Scholar 

  39. Thalheim, B.: On semantic issues connected with keys in relational databases permitting null values. Elektronische Informationsverarbeitung Kybernetik 25(1/2), 11–20 (1989)

    MathSciNet  Google Scholar 

  40. Thi, V.D.: Minimal keys and antikeys. Acta Cybern. 7(4), 361–371 (1986)

    MathSciNet  MATH  Google Scholar 

  41. Toman, D., Weddell, G.E.: On keys and functional dependencies as first-class citizens in description logics. J. Autom. Reason. 40(2–3), 117–132 (2008)

    Article  MathSciNet  Google Scholar 

  42. Trinh, T.: Using transversals for discovering XML functional dependencies. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol. 4932, pp. 199–218. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77684-0_15

    Chapter  Google Scholar 

  43. Wei, Z., Link, S.: Discovering embedded uniqueness constraints (2018, to appear)

    Google Scholar 

  44. Wei, Z., Link, S.: DataProf: semantic profiling for iterative data cleansing and business rule acquisition. In: SIGMOD (2018, to appear)

    Google Scholar 

  45. Wei, Z., Link, S., Liu, J.: Contextual keys. In: Mayr, H.C., Guizzardi, G., Ma, H., Pastor, O. (eds.) ER 2017. LNCS, vol. 10650, pp. 266–279. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69904-2_22

    Chapter  Google Scholar 

  46. Wijsen, J.: A survey of the data complexity of consistent query answering under key constraints. In: Beierle, C., Meghini, C. (eds.) FoIKS 2014. LNCS, vol. 8367, pp. 62–78. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-04939-7_2

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, Auckland, New Zealand

    Sebastian Link

Authors

Corresponding author

Correspondence to Sebastian Link .

Editor information

Editors and Affiliations

  1. Software Competence Center Hagenberg, Hagenberg im Mühlkreis, Austria

    Flavio Ferrarotti

  2. Vienna University of Technology, Vienna, Austria

    Stefan Woltran

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Link, S. (2018). Old Keys that Open New Doors. In: Ferrarotti, F., Woltran, S. (eds) Foundations of Information and Knowledge Systems. FoIKS 2018. Lecture Notes in Computer Science(), vol 10833. Springer, Cham. https://doi.org/10.1007/978-3-319-90050-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-90050-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-90049-0

  • Online ISBN: 978-3-319-90050-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation