Refactoring rules for graph databases

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The information generated nowadays is growing in volume and complexity, representing a technological challenge which demands more than the relational model for databases can currently offer. This situation stimulates the use of different forms of storage, such as Graph Databases. Current Graph Databases allow automatic database evolution, but do not provide adequate resources for the information organization. This is mostly left under the responsibility of the applications which access the database, compromising the data integrity and reliability. The goal of this work is the definition of refactoring rules to support the management of the evolution of Graph Databases by adapting and extending existent refactoring rules for relational databases to meet the requirements of the Graph Databases features. These refactoring rules can be used by developers of graph database management tools to guarantee the integrity of the operations of database evolution.

Cite

CITATION STYLE

APA

Fonseca, A. M., & Camolesi, L. (2015). Refactoring rules for graph databases. In Advances in Intelligent Systems and Computing (Vol. 353, pp. 33–44). Springer Verlag. https://doi.org/10.1007/978-3-319-16486-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free