Technical Survey Graph Databases and Applications

2015 ◽  
Vol 09 (04) ◽  
pp. 523-545 ◽  
Author(s):  
Shao-Ting Wang ◽  
Jennifer Jin ◽  
Pete Rivett ◽  
Atsushi Kitazawa

Graph databases can be defined as databases that use graph structures with nodes, edges and properties to store data. Semantic queries and graph-oriented operations are used to access them. With a rapidly growing amount of information on the Internet in recent years, relational databases suffer performance degradation as a large number of nodes are added due to the number of entries in join tables. Therefore, based on the network nature of Internet activities, graph databases are designed for fast access to complex data found in social networks, recommendation engines and networked system. The main objective of this survey is to present the work that has been done in the area of graph database, including query languages, processing, and related application.

Author(s):  
Kornelije Rabuzin

In the past few years, many NoSQL databases have emerged, including graph databases. NoSQL databases have certain advantages and they can be used in certain domains as an alternative to relational databases. In order to use graph databases, one needs to be familiar with specific languages like Cypher Query Language (CQL) or Gremlin. However, some statements in CQL can be considered too complex for end users as it is shown later on. Because of that, the main idea of this chapter is to explore two other languages for graph databases. One of them is new and it is used to pose queries visually. Since CQL does not support recursion, views, etc., the other language is used to show how to use recursion and views on a graph database.


Author(s):  
Kornelije Rabuzin

In the past few years many NoSQL databases have emerged, including graph databases. NoSQL databases have certain advantages and they can be used in certain domains as an alternative to relational databases. In order to use graph databases, one needs to be familiar with specific languages like Cypher Query Language (CQL) or Gremlin. However, some statements in CQL can be considered too complex for end users as it is shown later on. Because of that the main idea of this paper is to explore two other languages for graph databases. One of them is new and it is used to pose queries visually. Since CQL does not support recursion, views, etc., the other language is used to show how to use recursion and views on a graph database.


2020 ◽  
Vol 245 ◽  
pp. 04004
Author(s):  
Julius Hřivnáč

Data in High Energy Physics (HEP) usually consist of complext complex data structures stored in relational databases and files with internal schema. Such architecture exhibits many shortcomings, which could be fixed by migrating into Graph Database storage. The paper describes basic principles of the Graph Database together with an overview of existing standards and implementations. The usefulness and usability are demonstrated using the concrete example of the Event Index of the ATLAS experiment at LHC in two approaches as the full storage (all data are in the Graph Database) and meta-storage (a layer of schema-less graph-like data implemented on top of more traditional storage). The usability, the interfaces with the surrounding framework and the performance of those solutions are discussed. The possible more general usefulness for generic experiments’ storage is also discussed.


Database ◽  
2020 ◽  
Vol 2020 ◽  
Author(s):  
Claire M Simpson ◽  
Florian Gnad

Abstract Graph representations provide an elegant solution to capture and analyze complex molecular mechanisms in the cell. Co-expression networks are undirected graph representations of transcriptional co-behavior indicating (co-)regulations, functional modules or even physical interactions between the corresponding gene products. The growing avalanche of available RNA sequencing (RNAseq) data fuels the construction of such networks, which are usually stored in relational databases like most other biological data. Inferring linkage by recursive multiple-join statements, however, is computationally expensive and complex to design in relational databases. In contrast, graph databases store and represent complex interconnected data as nodes, edges and properties, making it fast and intuitive to query and analyze relationships. While graph-based database technologies are on their way from a fringe domain to going mainstream, there are only a few studies reporting their application to biological data. We used the graph database management system Neo4j to store and analyze co-expression networks derived from RNAseq data from The Cancer Genome Atlas. Comparing co-expression in tumors versus healthy tissues in six cancer types revealed significant perturbation tracing back to erroneous or rewired gene regulation. Applying centrality, community detection and pathfinding graph algorithms uncovered the destruction or creation of central nodes, modules and relationships in co-expression networks of tumors. Given the speed, accuracy and straightforwardness of managing these densely connected networks, we conclude that graph databases are ready for entering the arena of biological data.


Author(s):  
Arnaud Castelltort ◽  
Anne Laurent

NoSQL graph databases have been introduced in recent years for dealing with large collections of graph-based data. Scientific data and social networks are among the best examples of the dramatic increase of the use of such structures. NoSQL repositories allow the management of large amounts of data in order to store and query them. Such data are not structured with a predefined schema as relational databases could be. They are rather composed by nodes and relationships of a certain type. For instance, a node can represent a Person and a relationship Friendship. Retrieving the structure of the graph database is thus of great help to users, for example when they must know how to query the data or to identify relevant data sources for recommender systems. For this reason, this paper introduces methods to retrieve structural summaries. Such structural summaries are extracted at different levels of information from the NoSQL graph database. The expression of the mining queries is facilitated by the use of two frame-works: Fuzzy4S allowing to define fuzzy operators and operations with Scala; Cypherf allowing the use of fuzzy operators and operations in the declarative queries over NoSQL graph databases. We show that extracting such summaries can be impossible with the NoSQL query engines because of the data volume and the complexity of the task of automatic knowledge extraction. A novel method based on in memory architectures is thus introduced. This paper provides the definitions of the summaries with the methods to automatically extract them from NoSQL graph databases only and with the help of in-memory architectures. The benefit of our proposition is demonstrated by experimental results.


2019 ◽  
Vol 1 (2) ◽  
pp. 14-20
Author(s):  
Ray Neiheiser ◽  
Roland Schmitz ◽  
Luciana Rech ◽  
Manfredo Manfredini

Through the ongoing trend in graph technologies due to the massive growth of linked data produced by social networks graph databases gained popularity. Replication, a common approach to increase availability in databases, is also used by diverse graph database solutions. Few approaches implementing fault-tolerance in graph databases have been proposed yet.This paper considers deferred update replication using atomic broadcast in order to implement fault-tolerance in distributed graph databases. The main contribution of this paper is a deferred update algorithm adapted to graph databases offering a more scalable and faster solution, showing a performance advantage of over 30\% compared to existing approaches.


Author(s):  
Mohamed Fazil Mohamed Firdhous

In today's world, information plays a vital role in determining the success of many endeavors. Hence, people try to gain access to information by employing many techniques that are not used under normal circumstances. Today Internet is an important resource in the lives of people and carries a vast amount of information. Hence gaining access to this information through some surreptitious means is known as cyber espionage. Cyber espionage has been a real threat to the users as it compromises the security of their precious information. Cyber espionage could be carried out by individuals, organizations or governments targeting individuals, organizations and states for obtaining information for personal, economic, political or military advantages over the other. In this chapter, the author takes an in depth look at the attacks carried out three main domains of the Internet, namely social networks, websites and email. The author not only discusses the attacks and the mechanisms used, but also proposes the precautionary methods that can be employed to protect these resources.


2019 ◽  
Vol 30 (1) ◽  
pp. 41-60 ◽  
Author(s):  
Gustavo Cordeiro Galvão Van Erven ◽  
Rommel Novaes Carvalho ◽  
Waldeyr Mendes Cordeiro da Silva ◽  
Sergio Lifschitz ◽  
Harley Vera-Olivera ◽  
...  

In recent years, graph database systems have become very popular and been deployed mainly in situations where the relationship between data is significant, such as in social networks. Although they do not require a particular schema design, a data model contributes to their consistency. Designing diagrams is an approach to satisfying this demand for a conceptual data model. While researchers and companies have been developing concepts and notations for graph database modeling, their notations focus on their specific implementations. In this article, the authors propose a diagram to address this lack of a generic and comprehensive notation for graph databases modeling, named GRAPHED (Graph Description Diagram for Graph Databases). The authors verified the effectiveness and compatibility of GRAPHED in two case studies: fraud identification, and a biological network model.


Relational databases are holding the maximum amount of data underpinning the web. They show excellent record of convenience and efficiency in repository, optimized query execution, scalability, security and accuracy. Recently graph databases are seen as an good replacement for relational database. When compared to the relational data model, graph data model is more vivid, strong and data expressed in it models relationships among data properly. An important requirement is to increase the vast quantities of data stored in RDB into web. In this situation, migration from relational to graph format is very advantageous. Both databases have advantages and limitations depending on the form of queries. Thus, this paper converts relational to graph database by utilizing the schema in order to develop a dual database system through migration, which merges the capability of both relational db and graph db. The experimental results are provided to demonstrate the practicability of the method and query response time over the target database. The proposed concept is proved by implementing it on MySQL and Neo4j


2019 ◽  
Vol 8 (2) ◽  
pp. 1722-1726

Paper Relational database model (also called SQL databases) are one of the prevalent databases that are used with structured data. Currently news demands are arising owing to the magnitude with which the internet and social networks are getting used which brought importance to graph-structured data. Graph database (a nosql database) deal more naturally with highly connected data and are thus becoming popular and efficient choice. Due to limitations faced by relational databases in handling relationships (highly connected data), enterprise information systems find graph database as a promising alternative. According to the form of queries and property of data both relational and graph databases have vitality and flaws. Since most of the data is available in relational schema in this context, the conversion of an application from a relational to a graph format is very beneficial. Thus, this paper develops a dual database system through migration, which unifies the strengths of both relational databases and graph databases. Experimental results have shown that, this hybrid system has efficient performance.


Sign in / Sign up

Export Citation Format

Share Document