Evaluation of Optimization Strategies for Incremental Graph Queries
2017
The last decade brought considerable improvements in dis
-
tributed storage and query technologies, known as NoSQL
systems. These systems provide quick evaluation of simple
retrieval operations and are able to answer certain complex
queries in a scalable way, albeit not instantly. Providing scal
-
ability and quick response times at the same time for querying
large data sets is still a challenging task. Evaluating com
-
plex graph queries is particularly difficult, as it requires lots
of join, antijoin and filtering operations. This paper presents
optimization techniques used in relational database systems
and applies them on graph queries. We evaluate various query
plans on multiple datasets and discuss the effect of different
optimization techniques.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
14
References
6
Citations
NaN
KQI