Skip to main content
SpringerLink
Log in

Contextual Keys

  • Conference paper
  • First Online:
Conceptual Modeling (ER 2017)

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

Included in the following conference series:

Abstract

Much work has been done on extending the relational model of data to encompass incomplete information. In particular, a plethora of research has examined the semantics of integrity constraints in the presence of null markers. We propose a new approach whose semantics relies exclusively on fragments of complete data within an incomplete relation. For this purpose, we introduce the class of contextual keys. Users can specify the context of a key as a set of attributes that selects the sub-relation of tuples with no null marker occurrences on the attributes of the context. Then the key uniquely identifies the tuples within the sub-relation. The standard notion of a key over complete relations is the special case of a contextual key whose context consists of all attributes. SQL unique constraints form the special case of a contextual key whose context coincides with the set of key attributes. We establish structural and computational characterizations of the associated implication problem, and of their Armstrong databases. The computation of Armstrong databases has been implemented in a tool, and experiments provide insight into the actual run-time behavior of the algorithms that complement our detailed computational complexity analysis.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Bisbal, J., Grimson, J.: Consistent database sampling as a database prototyping approach. J. Softw. Maint. Evol.: Res. Pract. 14(6), 447–459 (2002)

    Article  Google Scholar 

  2. Brown, P., Ganesan, J., Köhler, H., Link, S.: Keys with probabilistic intervals. In: Comyn-Wattiau, I., Tanaka, K., Song, I.-Y., Yamamoto, S., Saeki, M. (eds.) ER 2016. LNCS, vol. 9974, pp. 164–179. Springer, Cham (2016). doi:10.1007/978-3-319-46397-1_13

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  4. Codd, E.F.: Missing information (applicable and inapplicable) in relational databases. ACM SIGMOD Rec. 15(4), 53–53 (1986)

    Article  Google Scholar 

  5. 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 

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

    Article  MathSciNet  Google Scholar 

  7. Gottlob, G., Zicari, R.: Closed world databases opened through null values. VLDB 88, 50–61 (1988)

    Google Scholar 

  8. Grant, J.: Null values in a relational data base. Inf. Process. Lett. 6(5), 156–157 (1977)

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. 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). doi:10.1007/11965893_8

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  12. Hartmann, S., Link, S.: Expressive, yet tractable XML keys. In: Kersten, M.L., Novikov, B., Teubner, J., Polutin, V., Manegold, S. (eds.) EDBT 2009, pp. 357–367. ACM, New York (2009)

    Google Scholar 

  13. Khizder, V.L., Weddell, G.E.: Reasoning about uniqueness constraints in object relational databases. IEEE Trans. Knowl. Data Eng. 15(5), 1295–1306 (2003)

    Article  Google Scholar 

  14. 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). doi:10.1007/978-3-319-11558-0_13

    Chapter  Google Scholar 

  15. 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 

  16. Köhler, H., Link, S.: SQL schema design: foundations, normal forms, and normalization. In: Özcan, F., Koutrika, G., Madden, S. (eds.) Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, 26 June–01 July 2016, pp. 267–279. ACM (2016)

    Google Scholar 

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

    Google Scholar 

  18. 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 

  19. Langeveldt, W.D., 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 

  20. 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 

  21. Levene, M., Loizou, G.: Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci. 206(1), 283–300 (1998)

    Article  MathSciNet  Google Scholar 

  22. Levene, M., Loizou, G.: A generalisation of entity and referential integrity in relational databases. RAIRO-Theor. Inf. Appl. 35(2), 113–127 (2001)

    Article  MathSciNet  Google Scholar 

  23. Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer Science & Business Media, Berlin (2012)

    MATH  Google Scholar 

  24. Link, S., Prade, H.: Relational database schema design for uncertain data. In: Mukhopadhyay, S., Zhai, C., Bertino, E., Crestani, F., Mostafa, J., Tang, J., Si, L., Zhou, X., Chang, Y., Li, Y., Sondhi, P. (eds.) Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, 24–28 October 2016, pp. 1211–1220. ACM (2016)

    Google Scholar 

  25. Makinouchi, A.: A consideration on normal form of not-necessarily-normalized relation in the relational data model. In: Proceedings of the Third International Conference on Very Large Data Bases, 6–8 October 1977, Tokyo, Japan, pp. 447–453 (1977)

    Google Scholar 

  26. 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 

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

    MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  29. Thalheim, B.: The number of keys in relational and nested relational databases. Discrete Appl. Math. 40(2), 265–282 (1992)

    Article  MathSciNet  Google Scholar 

  30. Wei, Z., Link, S., Liu, J.: Contextual keys. Technical report 508, (2017). www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/

  31. Zaniolo, C.: Database relations with null values. J. Comput. Syst. Sci. 28(1), 142–166 (1984)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Ziheng Wei, Sebastian Link & Jiamou Liu

Authors
  1. Ziheng Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiamou Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebastian Link .

Editor information

Editors and Affiliations

  1. University of Klagenfurt, Klagenfurt, Austria

    Heinrich C. Mayr

  2. Free University of Bozen-Bolzano, Bozen-Bolzano, Italy

    Giancarlo Guizzardi

  3. Victoria University of Wellington, Wellington, New Zealand

    Hui Ma

  4. Valencia University of Technology, Valencia, Spain

    Oscar Pastor

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wei, Z., Link, S., Liu, J. (2017). Contextual Keys. In: Mayr, H., Guizzardi, G., Ma, H., Pastor, O. (eds) Conceptual Modeling. ER 2017. Lecture Notes in Computer Science(), vol 10650. Springer, Cham. https://doi.org/10.1007/978-3-319-69904-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69904-2_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69903-5

  • Online ISBN: 978-3-319-69904-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation