Integrity constraints in graph databases | Zendy

Jaroslav Pokorný | Zendy; Michał Valenta | Zendy; Jiří Kovačič | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Integrity constraints in graph databases

Author(s) -

Jaroslav Pokorný,

Michał Valenta,

Jiří Kovačič

Publication year - 2017

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2017.05.456

Subject(s) - computer science , graph database , conceptual schema , database schema , schema (genetic algorithms) , graph , wait for graph , database , theoretical computer science , database design , information retrieval , developmental psychology , gender schema theory , psychology

One thing that is still being developed for graph databases is integrity constraint (IC) support. One possibility to IC proposal is to consider a graph conceptual schema and a graph database schema. At least inherent ICs coming from a graph conceptual schema should be considered as explicit ICs on the graph databases level, i.e., using a DDL. In the paper, we focus on graph database Neo4j and its possibilities to express a database schema and ICs. We extend these possibilities through new constructs in Neo4j DDL including their prototype implementation and experiments.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research