Szárnyas, Gábor and Maginecz, János and Varró, Dániel (2017) Evaluation of Optimization Strategies for Incremental Graph Queries. PERIODICA POLYTECHNICA-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, 61 (2). pp. 175-192. ISSN 2064-5260
|
Text
pp_graph_queries_u.pdf Download (995kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 31 Jul 2017 01:32 |
| Last Modified: | 31 Jul 2017 01:32 |
| URI: | http://real.mtak.hu/id/eprint/57492 |
Actions (login required)
 |
Edit Item |
