EUVIMEDOpdag EUVIMED
Crossref

Evaluation of Optimization Strategies for Incremental Graph Queries

Gábor Szárnyas, János Maginecz, Dániel Varró

Periodica Polytechnica Electrical Engineering and Computer Science · 2017-05-23 · 61 (2) · 175

DOI: 10.3311/ppee.9769 ↗

At a glance

Journal article in Periodica Polytechnica Electrical Engineering and Computer Science, published online on 2017-05-23. Written by Gábor Szárnyas and 2 co-authors. Cited 7 times so far (Crossref).

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

The last decade brought considerable improvements in distributed 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 scalability and quick response times at the same time for querying large data sets is still a challenging task. Evaluating complex 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.

Cite

APA

Szárnyas, G., Maginecz, J., & Varró, D. (2017). Evaluation of Optimization Strategies for Incremental Graph Queries. Periodica Polytechnica Electrical Engineering and Computer Science, 61(2), 175. https://doi.org/10.3311/ppee.9769

Vancouver

Szárnyas G, Maginecz J, Varró D. Evaluation of Optimization Strategies for Incremental Graph Queries. Periodica Polytechnica Electrical Engineering and Computer Science. 2017;61(2):175. doi:10.3311/ppee.9769

BibTeX
@article{Szrnyas2017,
  author = {Szárnyas, Gábor and Maginecz, János and Varró, Dániel},
  title = {Evaluation of Optimization Strategies for Incremental Graph Queries},
  journal = {Periodica Polytechnica Electrical Engineering and Computer Science},
  year = {2017},
  volume = {61},
  number = {2},
  pages = {175},
  doi = {10.3311/ppee.9769}
}
Start for free →