| License: Creative Commons Attribution Non-commercial Share Alike 4.0 PDF - Published Version (2MB) |
- URN to cite this document:
- urn:nbn:de:bvb:355-epub-598269
- DOI to cite this document:
- 10.5283/epub.59826
Abstract
Equivalent to relational databases, there is a need for an evolution language for graph databases that describes how evolution operations such as add, rename, delete, copy, move, split and merge are specified domain independent. Previous work proposes the graph evolution language called GEO, which we build upon. In this paper, we present our program called Nautilus, implementing this formal ...

Owner only: item control page

Download Statistics