Functional querying in graph databases
نویسندگان
چکیده
منابع مشابه
Querying Graph Databases
Graph data is an emerging model for representing a variety of database contexts ranging from object-oriented databases to hypertext data. Also many of the recursive queries that arise in relational databases are, in practice, graph traversals. In this paper we present a language for searching graph-like databases. The language permits us to express paths in a graph by means of extended regular ...
متن کاملQuerying Best Paths in Graph Databases
Querying graph databases has recently received much attention. We propose a new approach to this problem, which balances competing goals of expressive power, language clarity and computational complexity. A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria. To express complex prope...
متن کاملQuerying Wikidata: Comparing SPARQL, Relational and Graph Databases
In this paper, we experimentally compare the e ciency of various database engines for the purposes of querying the Wikidata knowledge-base, which can be conceptualised as a directed edge-labelled graph where edges can be annotated with meta-information called qualiers. We take two popular SPARQL databases (Virtuoso, Blazegraph), a popular relational database (PostgreSQL), and a popular graph da...
متن کاملSingling out functional similarities in graph databases
It has been shown that protein-protein interactions analysis may be useful to infer information about biological variations caused by evolution. All the known protein-protein interactions of a given organism may be modelled by a network, namely, the protein-protein interaction (PPI) network of that organism, stored in a graph database. The analysis and comparison of protein-protein interaction ...
متن کاملBB-Graph: A New Subgraph Isomorphism Algorithm for Efficiently Querying Big Graph Databases
With the emergence of the big data concept, the big graph database model has become very popular since it provides strong modeling for complex applications and fast querying, especially for the cases that require costly join operations in RDBMs. However, it is a big challenge to find all exact matches of a query graph in a big graph database, which is known as the subgraph isomorphism problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Computer Science
سال: 2017
ISSN: 2196-8888,2196-8896
DOI: 10.1007/s40595-017-0104-6