2016
DOI: 10.5121/ijdms.2016.8401
|View full text |Cite
|
Sign up to set email alerts
|

Query Optimization Techniques in Graph Databases

Abstract: Graph databases (GDB) have recently been arisen to overcome the limits of traditional databases for storing and managing data with graph-like structure. Today, they represent a requirementfor many applications that manage graph-like data,like social networks.Most of the techniques, applied to optimize queries in graph databases, have been used in traditional databases, distribution systems,… or they are inspired from graph theory. However, their reuse in graph databases should take care of the main characteris… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…Another area that is often used for graph databases is the Geographical sector, refer to publications [44,45] and [46]. Ten titles on studies, including [47,48,49] take works that could be implemented in all subjects or areas. It means that GDB is really sophisticated to not be taken technology in nowadays.…”
Section: Research Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Another area that is often used for graph databases is the Geographical sector, refer to publications [44,45] and [46]. Ten titles on studies, including [47,48,49] take works that could be implemented in all subjects or areas. It means that GDB is really sophisticated to not be taken technology in nowadays.…”
Section: Research Resultsmentioning
confidence: 99%
“…Neo4j product is comprehensive database, occupy to accommodate ranging from small-scale applications to applications with millions of users, Large Data processing to Big Data implementation. Additionally, most researcher implements SparkSee (DEX) [48][57] [61], ArangoDB [34,46] for RDF store, TitanGraph [14][41] [62], OrientDB [63], TigerGraph [36][64] and AllegroGraph discussed in [38][44][65], as alternative.…”
Section: Research Resultsmentioning
confidence: 99%
“…There are works that improve performance of specific algorithms (e.g., delta stepping for SSSP [23]); however, our goal is to develop optimizations that apply to multiple iterative graph algorithms. There has been a great deal of work on graph based query languages (e.g., Gremlin [29]) and query support in graph databases (e.g., Neo4J and DEX [2,9,20]) that enable graph traversals and joins via lower-level graph primitives (e.g., vertices, edges, etc.). However, they are not efficient for iterative graph algorithms over large graphs.…”
Section: Related Workmentioning
confidence: 99%
“…There is prior work on graph based query languages (e.g., Gremlin [29]) and query support in graph databases (e.g., Neo4J and DEX [2,9,20]) that enable graph traversals and joins via lower-level graph primitives (e.g., vertices, edges, etc.). The strength of these systems is their versatility.…”
Section: Introductionmentioning
confidence: 99%