Skip to main content

Neo4j Keys

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

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

Included in the following conference series:

  • 2570 Accesses

Abstract

Keys play a fundamental role in every data model. They stipulate how real-world entities are identified in the database but also how to physically and logically organize access to data. Neo4j is currently the most popular graph database management system. We address fundamental questions about key constraints as formally defined by the Cypher language of Neo4j. Answers include axiomatic and algorithmic solutions to their implication problem.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://db-engines.com/en/ranking_trend/graph+dbms.

  2. 2.

    https://db-engines.com/en/ranking_trend/graph+dbms.

  3. 3.

    https://neo4j.com/docs/cypher-manual/current/administration/constraints/.

References

  1. Balamuralikrishna, N., Jiang, Y., Koehler, H., Leck, U., Link, S., Prade, H.: Possibilistic keys. Fuzzy Sets Syst. 376, 1–36 (2019)

    Article  MathSciNet  Google Scholar 

  2. Bonifati, A., Fletcher, G.H.L., Voigt, H., Yakovets, N.: Querying Graphs. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2018)

    Book  Google Scholar 

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

    Article  Google Scholar 

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

  5. Chen, P.P.: The entity-relationship model - toward a unified view of data. ACM Trans. Database Syst. 1(1), 9–36 (1976)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  7. Demetrovics, J.: On the number of candidate keys. Inf. Process. Lett. 7(6), 266–269 (1978)

    Article  MathSciNet  Google Scholar 

  8. Fagin, R.: A normal form for relational databases that is based on domains and keys. ACM Trans. Database Syst. 6(3), 387–415 (1981)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. Fan, W., Lu, P.: Dependencies for graphs. ACM Trans. Database Syst. 44(2), 5:1–5:40 (2019)

    Google Scholar 

  11. Hannula, M., Link, S.: Automated reasoning about key sets. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 47–63. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94205-6_4

    Chapter  MATH  Google Scholar 

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

    Article  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. Köhler, H., Leck, U., Link, S., Zhou, X.: Possible and certain keys for SQL. VLDB J. 25(4), 571–596 (2016). https://doi.org/10.1007/s00778-016-0430-9

    Article  Google Scholar 

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

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

    Article  MathSciNet  Google Scholar 

  17. Pokorný, J., Valenta, M., Kovacic, J.: Integrity constraints in graph databases. In: The 8th International Conference on Ambient Systems, Networks and Technologies, ANT 2017/The 7th International Conference on Sustainable Energy Information Technology, SEIT 2017, Madeira, Portugal, 16–19 May 2017, vol. 109, pp. 975–981. Elsevier (2017). Procedia Computer Science

    Google Scholar 

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

    MathSciNet  Google Scholar 

  19. Thalheim, B.: Entity-Relationship Modeling - Foundations of Database Technology. Springer, Heidelberg (2000). https://doi.org/10.1007/978-3-662-04058-4

    Book  MATH  Google Scholar 

  20. 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). https://doi.org/10.1007/s10817-007-9092-z

    Article  MathSciNet  MATH  Google Scholar 

  21. Wei, Z., Leck, U., Link, S.: Discovery and ranking of embedded uniqueness constraints. PVLDB 12(13), 2339–2352 (2019)

    Google Scholar 

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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sebastian Link .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Link, S. (2020). Neo4j Keys. In: Dobbie, G., Frank, U., Kappel, G., Liddle, S.W., Mayr, H.C. (eds) Conceptual Modeling. ER 2020. Lecture Notes in Computer Science(), vol 12400. Springer, Cham. https://doi.org/10.1007/978-3-030-62522-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62522-1_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-62521-4

  • Online ISBN: 978-3-030-62522-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics