{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:47Z","timestamp":1750221287307,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T00:00:00Z","timestamp":1519257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2018,2,22]]},"abstract":"<jats:p>In this work we present Digree, a system prototype that enables distributed execution of graph pattern matching queries in a cloud of interconnected graph databases. We explain how a graph query can be decomposed into independent sub-patterns that are processed in parallel by the distributed independent graph database systems and how the results are finally synthesized at a master node. We experimentally compare a prototype of our system against a popular big data engine and show that Digree provides significantly faster query execution.<\/jats:p>","DOI":"10.1145\/3186549.3186555","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T16:40:01Z","timestamp":1519404001000},"page":"22-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Digree"],"prefix":"10.1145","volume":"46","author":[{"given":"Vasilis","family":"Spyropoulos","sequence":"first","affiliation":[{"name":"Athens University of Economics and Business, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis Kotidis","family":"Kotidis","sequence":"additional","affiliation":[{"name":"Athens University of Economics and Business, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Digree: A Middleware for a Graph Databases Polystore,\" in Proc. of IEEE BigData","author":"Spyropoulos V.","year":"2016","unstructured":"V. Spyropoulos , C. Vasilakopoulou , and Y. Kotidis , \" Digree: A Middleware for a Graph Databases Polystore,\" in Proc. of IEEE BigData , 2016 . V. Spyropoulos, C. Vasilakopoulou, and Y. Kotidis, \"Digree: A Middleware for a Graph Databases Polystore,\" in Proc. of IEEE BigData, 2016."},{"key":"e_1_2_1_2_1","volume-title":"Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases,\" in Proc. of EDBT","author":"Nicoara D.","year":"2015","unstructured":"D. Nicoara , S. Kamali , K. Daudjee , and L. Chen , \" Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases,\" in Proc. of EDBT , 2015 . D. Nicoara, S. Kamali, K. Daudjee, and L. Chen, \"Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases,\" in Proc. of EDBT, 2015."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363735"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.2172\/895418","volume-title":"A survey on Graph-based Pattern Matching,\" AAAI FS","author":"Gallagher B.","year":"2006","unstructured":"B. Gallagher , \"Matching Structure and Semantics : A survey on Graph-based Pattern Matching,\" AAAI FS , vol. 6 , 2006 . B. Gallagher, \"Matching Structure and Semantics: A survey on Graph-based Pattern Matching,\" AAAI FS, vol. 6, 2006."},{"key":"e_1_2_1_5_1","volume-title":"Query Optimization of Distributed Pattern Matching,\" in Proceedings of ICDE","author":"Huang J.","year":"2014","unstructured":"J. Huang , K. Venkatraman , and D. J. Abadi , \" Query Optimization of Distributed Pattern Matching,\" in Proceedings of ICDE , 2014 . J. Huang, K. Venkatraman, and D. J. Abadi, \"Query Optimization of Distributed Pattern Matching,\" in Proceedings of ICDE, 2014."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960416"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224229"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3186549.3186555","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3186549.3186555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:27Z","timestamp":1750212687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3186549.3186555"}},"subtitle":["Building A Distributed Graph Processing Engine out of Single-node Graph Database Installations"],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,2,22]]}},"alternative-id":["10.1145\/3186549.3186555"],"URL":"https:\/\/doi.org\/10.1145\/3186549.3186555","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2018,2,22]]},"assertion":[{"value":"2018-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}