Integrity constraints in graph databases

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10360068" target="_blank" >RIV/00216208:11320/17:10360068 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/17:00314529
Result on the web
<a href="http://dx.doi.org/10.1016/j.procs.2017.05.456" target="_blank" >http://dx.doi.org/10.1016/j.procs.2017.05.456</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.procs.2017.05.456" target="_blank" >10.1016/j.procs.2017.05.456</a>

Result language
angličtina
Original language name
Integrity constraints in graph databases
Original language description
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.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)