Results 11 to 20 of about 1,586,831 (297)
Functional querying in graph databases [PDF]
Vietnam Journal of Computer Science, 2017 The paper is focused on a functional querying in graph databases. We consider labelled property graph model and mention also the graph model behind XML databases. An attention is devoted to functional modelling of graph databases both at a conceptual and
Jaroslav Pokorný
doaj +5 more sources
Journal of Advanced Engineering and Computation, 2017 Comparing graph databases with traditional,e.g., relational databases, some important database features are often missing there. Particularly, a graph database schema including integrity constraints is mostly not explicitly defined, also a conceptual ...
Jaroslav Pokorny
doaj +3 more sources
GRAPH DATABASES AND GRAPH VIZUALIZATION [PDF]
, 2013 The thesis presents graph databases. Graph databases are a part of NoSQL databases, which is why this thesis presents basics of NoSQL databases as well. We have focused on advantages of graph databases compared to rela- tional databases. We have used one of native graph databases (Neo4j), to present more detailed processing of graph databases.
Klančar, Jure
core +3 more sources
Graph databases in systems biology: a systematic review. [PDF]
Brief BioinformGraph databases are becoming increasingly popular across scientific disciplines, being highly suitable for storing and connecting complex heterogeneous data.
Mazein I +12 more
europepmc +2 more sources
CoRR, 2022 Graph databases (GDBs) enable processing and analysis of unstructured, complex, rich, and usually vast graph datasets. Despite the large significance of GDBs in both academia and industry, little effort has been made into integrating them with the predictive power of graph neural networks (GNNs).
Maciej Besta +7 more
openaire +3 more sources
Semantic acyclicity on graph databases [PDF]
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, 2013 It is known that unions of acyclic conjunctive queries (CQs) can be evaluated in linear time, as opposed to arbitrary CQs, for which the evaluation problem is NP-complete. It follows from techniques in the area of constraint-satisfaction problems that semantically acyclic unions of CQs---i.e., unions of CQs that are equivalent to a union of acyclic ...
Pablo Barceló Baeza +2 more
openaire +9 more sources
A logical approach to graph databases
Journal of Logical and Algebraic Methods in Programming, 2022 Peer ...
Pino Blanco, Elvira +3 more
openaire +5 more sources
Context-free path querying with all-path semantics using matrices with sets of intermediate vertices [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2021 The study considers the problem of context-free path querying with all-path query semantics. This problem consists in finding all paths of the graph, the labels on the edges of which form words from the language generated by the input context-free ...
Rustam Sh. Azimov, Semyon V. Grigorev
doaj +1 more source
Standard Framework for Comparison of Graph Partitioning Techniques
JISR on Computing, 2015 Graph Partitioning is used to distribute graph partitions across nodes for processing. It is very important in the pre-processing step for distributed graph processing.
Mudasser Iqbal, Saif-ur-Rahman
doaj +1 more source
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source