{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:38:50Z","timestamp":1740159530695,"version":"3.37.3"},"reference-count":118,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Datenbank Spektrum"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s13222-017-0255-8","type":"journal-article","created":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:56:44Z","timestamp":1497862604000},"page":"101-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Big Graph Data Analytics on Single Machines \u2013 An Overview"],"prefix":"10.1007","volume":"17","author":[{"given":"Marcus","family":"Paradies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2148-9592","authenticated-orcid":false,"given":"Hannes","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"255_CR1","unstructured":"Abadi DJ, Marcus A, Madden S, Hollenbach KJ (2007) Scalable semantic web data management using vertical partitioning. VLDB. ACM, pp 411\u2013422"},{"key":"255_CR2","first-page":"431","volume-title":"Emptyheaded: a relational engine for graph processing","author":"CR Aberger","year":"2016","unstructured":"Aberger CR, Tu S, Olukotun K, R\u00e9 C (2016) Emptyheaded: a relational engine for graph processing. SIGMOD, pp 431\u2013446"},{"key":"255_CR3","first-page":"714","volume-title":"Empirical evaluation of guarded structural indexing","author":"E Agterdenbos","year":"2016","unstructured":"Agterdenbos E, Fletcher GHL, Chan C, Vansummeren S (2016) Empirical evaluation of guarded structural indexing. EDBT, pp 714\u2013715"},{"key":"255_CR4","doi-asserted-by":"crossref","unstructured":"Ahn J, Hong S, Yoo S, Mutlu O, Choi K (2015) A scalable processing-in-memory accelerator for parallel graph processing. ISCA. ACM, pp 105\u2013117","DOI":"10.1145\/2749469.2750386"},{"key":"255_CR5","unstructured":"Ailamaki A, DeWitt DJ, Hill MD, Wood DA (1999) DBMss on a modern processor: where does time go? VLDB. Morgan Kaufmann, pp 266\u2013277"},{"key":"255_CR6","doi-asserted-by":"crossref","unstructured":"\u00c1lvarez-Garc\u00eda S, Brisaboa NR, Ladra S, Pedreira O (2010) A compact representation of graph databases. MLG. ACM, pp 18\u201325","DOI":"10.1145\/1830252.1830255"},{"key":"255_CR7","doi-asserted-by":"crossref","unstructured":"Angles R (2012) A comparison of current graph database models. GDM. IEEE, pp 171\u2013177","DOI":"10.1109\/ICDEW.2012.31"},{"issue":"1","key":"255_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R Angles","year":"2008","unstructured":"Angles R, Guti\u00e9rrez C (2008) Survey of graph database models. ACM Comput Surv 40(1):1\u201339. doi: 10.1145\/1322432.1322433","journal-title":"ACM Comput Surv"},{"key":"255_CR9","first-page":"12","volume":"749","author":"R Angles","year":"2011","unstructured":"Angles R, Gutierrez C (2011) Subqueries in SPARQL. AMW 749:12","journal-title":"AMW"},{"key":"255_CR10","series-title":"CoRR abs\/1610.06264","volume-title":"Foundations of modern graph query languages","author":"R Angles","year":"2016","unstructured":"Angles R, Arenas M, Barcel\u00f3 P, Hogan A, Reutter JL, Vrgoc D (2016) Foundations of modern graph query languages. CoRR abs\/1610.06264."},{"issue":"3","key":"255_CR11","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.3390\/a2031031","volume":"2","author":"A Apostolico","year":"2009","unstructured":"Apostolico A, Drovandi G (2009) Graph compression by BFS. Algorithms 2(3):1031\u20131044","journal-title":"Algorithms"},{"key":"255_CR12","unstructured":"Blandford DK, Blelloch GE, Kash IA (2004) An experimental analysis of a compact graph representation. ALENEX. SIAM, pp 49\u201361"},{"key":"255_CR13","doi-asserted-by":"crossref","unstructured":"Boldi P, Vigna S (2004) The webgraph framework I: compression techniques. WWW. ACM, pp 595\u2013602","DOI":"10.1145\/988672.988752"},{"key":"255_CR14","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Santini M, Vigna S (2011) Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. WWW. ACM, pp 587\u2013596","DOI":"10.1145\/1963405.1963488"},{"key":"255_CR15","doi-asserted-by":"crossref","unstructured":"Bornea MA, Dolby J, Kementsietsidis A, Srinivas K, Dantressangle P, Udrea O, Bhattacharjee B (2013) Building an efficient RDF store over a relational database. SIGMOD. ACM, pp 121\u2013132","DOI":"10.1145\/2463676.2463718"},{"key":"255_CR16","unstructured":"Bornh\u00f6vd C, Kubis R, Lehner W, Voigt H, Werner H (2012) Flexible information management, exploration and analysis in SAP HANA. DATA. SciTePress, pp 15\u201328"},{"key":"255_CR17","first-page":"18","volume-title":"k2-trees for compact web graph representation","author":"NR Brisaboa","year":"2009","unstructured":"Brisaboa NR, Ladra S, Navarro G (2009) k2-trees for compact web graph representation. SPIRE, pp 18\u201330"},{"issue":"4","key":"255_CR18","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1177\/1094342011403516","volume":"25","author":"A Bulu\u00e7","year":"2011","unstructured":"Bulu\u00e7 A, Gilbert JR (2011) The Combinatorial BLAS: design, implementation, and applications. Int J High Perform Comput Appl 25(4):496\u2013509","journal-title":"Int J High Perform Comput Appl"},{"key":"255_CR19","volume-title":"An NSA Big Graph experiment","author":"P Burkhardt","year":"2013","unstructured":"Burkhardt P, Waring C (2013) An NSA Big Graph experiment. http:\/\/www.pdl.cmu.edu\/SDI\/2013\/slides\/big_graph_nsa_rd_2013_%56002v1.pdf"},{"key":"255_CR20","volume-title":"What\u2019s new in SAP HANA SPS12 \u2013 SAP HANA Graph Engine","author":"M Chen","year":"2016","unstructured":"Chen M (2016) What\u2019s new in SAP HANA SPS12 \u2013 SAP HANA Graph Engine. https:\/\/blogs.sap.com\/2016\/08\/01\/what-s-new-in-sap-hana-sps12-sap-hana-graph-engine\/ . Accessed 16.06.2017"},{"key":"255_CR21","doi-asserted-by":"crossref","unstructured":"Chen R, Shi J, Chen Y, Chen H (2015) PowerLyra: differentiated graph computation and partitioning on skewed graphs. EuroSys. ACM, pp 1:1\u20131:15","DOI":"10.1145\/2741948.2741970"},{"key":"255_CR22","doi-asserted-by":"crossref","unstructured":"Cheng J, Liu Q, Li Z, Fan W, Lui JCS, He C (2015) VENUS: Vertex-centric streamlined graph computation on a single PC. ICDE. IEEE Computer Society, pp 1131\u20131142","DOI":"10.1109\/ICDE.2015.7113362"},{"key":"255_CR23","unstructured":"Chong EI, Das S, Eadon G, Srinivasan J (2005) An efficient SQL-based RDF querying scheme. VLDB. ACM, pp 1216\u20131227"},{"key":"255_CR24","doi-asserted-by":"crossref","unstructured":"Chu E, Beckmann JL, Naughton JF (2007) The case for a wide-table approach to manage sparse relational data sets. SIGMOD. ACM, pp 821\u2013832","DOI":"10.1145\/1247480.1247571"},{"key":"255_CR25","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-12476-1_5","volume-title":"Algorithms and applications, essays dedicated to Esko Ukkonen on the occasion of his 60th birthday","author":"F Claude","year":"2010","unstructured":"Claude F, Navarro G (2010) Extended compact web graph representations. In: Algorithms and applications, essays dedicated to Esko Ukkonen on the occasion of his 60th birthday. Springer, Berlin Heidelberg, pp 77\u201391"},{"issue":"4","key":"255_CR26","doi-asserted-by":"crossref","first-page":"16:1","DOI":"10.1145\/1841909.1841913","volume":"4","author":"F Claude","year":"2010","unstructured":"Claude F, Navarro G (2010) Fast and compact web graph representations. ACM Trans Web 4(4):16:1\u201316:31","journal-title":"ACM Trans Web"},{"key":"255_CR27","unstructured":"Cong G, Makarychev K (2012) Optimizing large-scale graph analysis on a multi-threaded, multi-core platform. IPDPS. IEEE, pp 414\u2013425"},{"key":"255_CR28","unstructured":"Cormen TH, Leiserson CE, Rivest R, Stein C (2009) Introduction to Algorithms. Third Edition. MIT Press"},{"key":"255_CR29","first-page":"722","volume-title":"A parallelization of Dijkstra\u2019s shortest path algorithm","author":"A Crauser","year":"1998","unstructured":"Crauser A, Mehlhorn K, Meyer U, Sanders P (1998) A parallelization of Dijkstra\u2019s shortest path algorithm. MFCS. Springer, Berlin Heidelberg, pp 722\u2013731"},{"key":"255_CR30","volume-title":"The application\/json Media Type for JavaScript Object Notation (JSON), RFC 4627","author":"D Crockford","year":"2006","unstructured":"Crockford D (2006) The application\/json Media Type for JavaScript Object Notation (JSON), RFC 4627. http:\/\/tools.ietf.org\/html\/rfc4627"},{"key":"255_CR31","doi-asserted-by":"crossref","unstructured":"Deppisch U (1986) S\u2011tree: a dynamic balanced signature index for office retrieval. SIGIR. ACM, pp 77\u201387","DOI":"10.1145\/253168.253189"},{"key":"255_CR32","first-page":"59","volume":"113","author":"O Erling","year":"2007","unstructured":"Erling O, Mikhailov I (2007) RDF Support in the Virtuoso DBMS. CSSW 113:59\u201368","journal-title":"CSSW"},{"key":"255_CR33","volume-title":"The case against specialized graph analytics engines","author":"J Fan","year":"2015","unstructured":"Fan J, Raj AGS, Patel JM (2015) The case against specialized graph analytics engines. CIDR."},{"key":"255_CR34","first-page":"598","volume-title":"Declarative graph querying in practice and theory","author":"GHL Fletcher","year":"2017","unstructured":"Fletcher GHL, Voigt H, Yakovets N (2017) Declarative graph querying in practice and theory. EDBT, pp 598\u2013601"},{"key":"255_CR35","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: distributed graph-parallel computation on natural graphs. OSDI. USENIX Association, pp 17\u201330"},{"key":"255_CR36","first-page":"599","volume-title":"GraphX: graph processing in a distributed dataflow framework","author":"JE Gonzalez","year":"2014","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) GraphX: graph processing in a distributed dataflow framework. OSDI, pp 599\u2013613"},{"key":"255_CR37","first-page":"385","volume-title":"Merging adjacency lists for efficient web graph compression","author":"S Grabowski","year":"2011","unstructured":"Grabowski S, Bieniecki W (2011) Merging adjacency lists for efficient web graph compression. ICMMI. Springer, Berlin Heidelberg, pp 385\u2013392"},{"key":"255_CR38","doi-asserted-by":"crossref","unstructured":"Green O, Dukhan M, Vuduc RW (2015) Branch-avoiding graph algorithms. SPAA. ACM, pp 212\u2013223","DOI":"10.1145\/2755573.2755580"},{"issue":"3","key":"255_CR39","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/355791.355796","volume":"4","author":"FG Gustavson","year":"1978","unstructured":"Gustavson FG (1978) Two fast algorithms for sparse matrices: multiplication and permuted transposition. Trans Math Softw 4(3):250\u2013269","journal-title":"Trans Math Softw"},{"issue":"9","key":"255_CR40","doi-asserted-by":"crossref","first-page":"950","DOI":"10.14778\/2777598.2777604","volume":"8","author":"M Han","year":"2015","unstructured":"Han M, Daudjee K (2015) Giraph unchained: Barrierless asynchronous parallel execution in Pregel-like graph processing systems. Proc VLDB Endow 8(9):950\u2013961","journal-title":"Proc VLDB Endow"},{"key":"255_CR41","doi-asserted-by":"crossref","unstructured":"Han W, Lee S, Park K, Lee J, Kim M, Kim J, Yu H (2013) Turbograph: a fast parallel graph engine handling billion-scale graphs in a single PC. SIGKDD. ACM, pp 77\u201385","DOI":"10.1145\/2487575.2487581"},{"key":"255_CR42","first-page":"79","volume-title":"Database servers on chip multiprocessors: limitations and opportunities","author":"N Hardavellas","year":"2007","unstructured":"Hardavellas N, Pandis I, Johnson R, Mancheril N, Ailamaki A, Falsafi B (2007) Database servers on chip multiprocessors: limitations and opportunities. CIDR, pp 79\u201387"},{"key":"255_CR43","doi-asserted-by":"crossref","unstructured":"Harshvardhan FA, Amato NM, Rauchwerger L (2014) KLA: a new algorithmic paradigm for parallel graph computations. PACT. ACM, pp 27\u201338","DOI":"10.1145\/2628071.2628091"},{"key":"255_CR44","series-title":"CoRR abs\/1409.3288","volume-title":"Reconciliation of RDF* and property graphs","author":"O Hartig","year":"2014","unstructured":"Hartig O (2014) Reconciliation of RDF* and property graphs. CoRR abs\/1409.3288."},{"key":"255_CR45","first-page":"503","volume-title":"Highspeed graph processing exploiting main-memory column stores","author":"M Hauck","year":"2015","unstructured":"Hauck M, Paradies M, Fr\u00f6ning H, Lehner W, Rauhe H (2015) Highspeed graph processing exploiting main-memory column stores. Euro-Par, pp 503\u2013514"},{"key":"255_CR46","doi-asserted-by":"crossref","unstructured":"Herrmann K, Voigt H, Lehner W (2014) Cinderella \u2013 adaptive online partitioning of irregularly structured data. SMDB. IEEE Computer Society, pp 284\u2013291","DOI":"10.1109\/ICDEW.2014.6818342"},{"issue":"1","key":"255_CR47","first-page":"4","volume":"56","author":"K Herrmann","year":"2014","unstructured":"Herrmann K, Voigt H, Lehner W (2014) Online horizontal partitioning of heterogeneous data. Inf Technol 56(1):4\u201312","journal-title":"Inf Technol"},{"key":"255_CR48","doi-asserted-by":"crossref","unstructured":"Hong S, Oguntebi T, Olukotun K (2011) Efficient parallel graph exploration on multi-core CPU and GPU. PACT. IEEE Computer Society, pp 78\u201388","DOI":"10.1109\/PACT.2011.14"},{"key":"255_CR49","doi-asserted-by":"crossref","unstructured":"Hong S, Chafi H, Sedlar E, Olukotun K (2012) Green-Marl: a DSL for easy and efficient graph analysis. ASPLOS. ACM, pp 349\u2013362","DOI":"10.1145\/2150976.2151013"},{"key":"255_CR50","first-page":"5","volume-title":"Early experiences in using a domain-specific language for large-scale graph analysis","author":"S Hong","year":"2013","unstructured":"Hong S, Lugt JVD, Welc A, Raman R, Chafi H (2013) Early experiences in using a domain-specific language for large-scale graph analysis. GRADES, p 5"},{"key":"255_CR51","doi-asserted-by":"crossref","unstructured":"Hong S, Rodia NC, Olukotun K (2013) On fast parallel detection of Strongly Connected Components (SCC) in small-world graphs. SC. ACM, pp 92:1\u201392:11","DOI":"10.1145\/2503210.2503246"},{"key":"255_CR52","doi-asserted-by":"crossref","unstructured":"Hong S, Salihoglu S, Widom J, Olukotun K (2014) Simplifying scalable graph processing with a domain-specific language. CGO. ACM, pp 208\u2013218","DOI":"10.1145\/2581122.2544162"},{"key":"255_CR53","unstructured":"Hong S, Depner S, Manhardt T, Lugt JVD, Verstraaten M, Chafi H (2015) PGX.D: a fast distributed graph processing engine. SC. ACM, pp 58:1\u201358:12"},{"key":"255_CR54","doi-asserted-by":"crossref","unstructured":"Jindal A, Madden S (2014) GRAPHiQL: A graph intuitive query language for relational databases. BD. IEEE, pp 441\u2013450","DOI":"10.1109\/BigData.2014.7004261"},{"key":"255_CR55","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-319-49340-4_14","volume-title":"Handbook of big data technologies","author":"M Junghanns","year":"2017","unstructured":"Junghanns M, Petermann A, Neumann M, Rahm E (2017) Management and analysis of big graph data: current systems and open challenges. In: Handbook of big data technologies. Springer, Berlin Heidelberg, pp 457\u2013505"},{"key":"255_CR56","volume-title":"Distributed grouping of property graphs with GRADOOP","author":"M Junghanns","year":"2017","unstructured":"Junghanns M, Petermann A, Rahm E (2017) Distributed grouping of property graphs with GRADOOP. BTW."},{"issue":"13","key":"255_CR57","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.14778\/2733004.2733067","volume":"7","author":"A Khan","year":"2014","unstructured":"Khan A, Elnikety S (2014) Systems for big-graphs. Proc VLDB Endow 7(13):1709\u20131710","journal-title":"Proc VLDB Endow"},{"key":"255_CR58","doi-asserted-by":"crossref","unstructured":"Khayyat Z, Awara K, Alonazi A, Jamjoom H, Williams D, Kalnis P (2013) Mizan: a system for dynamic load balancing in large-scale graph processing. EuroSys. ACM, pp 169\u2013182","DOI":"10.1145\/2465351.2465369"},{"key":"255_CR59","first-page":"185","volume":"214","author":"T Kiefer","year":"2013","unstructured":"Kiefer T, Schlegel B, Lehner W (2013) Experimental evaluation of NUMA effects on database management systems. BTW 214:185\u2013204","journal-title":"BTW"},{"key":"255_CR60","unstructured":"Kyrola A, Blelloch GE, Guestrin C (2012) Graphchi: large-scale graph computation on just a PC. OSDI. USENIX Association, pp 31\u201346"},{"issue":"3","key":"255_CR61","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/s11227-010-0405-3","volume":"51","author":"CE Leiserson","year":"2010","unstructured":"Leiserson CE (2010) The Cilk++ concurrency platform. J\u00a0Supercomput 51(3):244\u2013257","journal-title":"J Supercomput"},{"key":"255_CR62","doi-asserted-by":"crossref","unstructured":"Lin Z, Kahng M, Sabrin KM, Chau DHP, Lee H, Kang U (2014) Mmap: fast billion-scale graph computation on a PC via memory mapping. Big Data. IEEE, pp 159\u2013164","DOI":"10.1109\/BigData.2014.7004226"},{"key":"255_CR63","first-page":"340","volume-title":"Graphlab: a new framework for parallel machine learning","author":"Y Low","year":"2010","unstructured":"Low Y, Gonzalez J, Kyrola A, Bickson D, Guestrin C, Hellerstein JM (2010) Graphlab: a new framework for parallel machine learning. UAI, pp 340\u2013349"},{"issue":"8","key":"255_CR64","doi-asserted-by":"crossref","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y, Gonzalez J, Kyrola A, Bickson D, Guestrin C, Hellerstein JM (2012) Distributed graphlab: a framework for machine learning in the cloud. Proc VLDB Endow 5(8):716\u2013727","journal-title":"Proc VLDB Endow"},{"key":"255_CR65","doi-asserted-by":"crossref","unstructured":"Macko P, Marathe VJ, Margo DW, Seltzer MI (2015) LLAMA: Efficient graph analytics using Large Multiversioned Arrays. ICDE. IEEE, pp 363\u2013374","DOI":"10.1109\/ICDE.2015.7113298"},{"key":"255_CR66","first-page":"281","volume-title":"Proceedings","author":"JB MacQueen","year":"1967","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings 5\u2011th Berkeley Symposium on Mathematical Statistics and Probability, June 21 - July 18, 1965. vol 1. University of California Press, Berkeley CA, pp 281\u2013297"},{"key":"255_CR67","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. SIGMOD. ACM, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"255_CR68","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Bazan N, Munt\u00e9s-Mulero V, G\u00f3mez-Villamor S, Nin J, S\u00e1nchez-Mart\u00ednez M, Larriba-Pey J (2007) DEX: high-performance exploration on large graphs for information retrieva. CIKM. ACM, pp 573\u2013582","DOI":"10.1145\/1321440.1321521"},{"key":"255_CR69","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Bazan N, G\u00f3mez-Villamor S, Escale-Claveras F (2011) DEX: a high-performance graph database management system. GDM. IEEE, pp 124\u2013127","DOI":"10.1109\/ICDEW.2011.5767616"},{"issue":"2","key":"255_CR70","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune RR, Weninger T, Madey G (2015) Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput Surv 48(2):25:1\u201325:39","journal-title":"ACM Comput Surv"},{"issue":"1","key":"255_CR71","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer U, Sanders P (2003) Delta-stepping: a parallelizable shortest path algorithm. J\u00a0Algorithm 49(1):114\u2013152","journal-title":"J Algorithm"},{"key":"255_CR72","volume-title":"JSON in DB2","author":"C Monash","year":"2013","unstructured":"Monash C (2013) JSON in DB2. http:\/\/www.dbms2.com\/2013\/09\/24\/json-in-db2\/ . Accessed: 16.06.2017"},{"key":"255_CR73","unstructured":"Nelson J, Myers B, Hunter AH, Briggs P, Ceze L, Ebeling C, Grossman D, Kahan S, Oskin M (2011) Crunching large graphs with commodity processors. HotPar. USENIX Association,"},{"key":"255_CR74","first-page":"3","volume-title":"RDFox: A Highly-Scalable RDF Store","author":"Y Nenov","year":"2015","unstructured":"Nenov Y, Piro R, Motik B, Horrocks I, Wu Z, Banerjee J (2015) RDFox: A Highly-Scalable RDF Store. ISWC. vol. 9367. Springer, Berlin Heidelberg, pp 3\u201320"},{"issue":"1","key":"255_CR75","doi-asserted-by":"crossref","first-page":"647","DOI":"10.14778\/1453856.1453927","volume":"1","author":"T Neumann","year":"2008","unstructured":"Neumann T, Weikum G (2008) RDF-3X: a RISC-style Engine for RDF. Proc VLDB Endow 1(1):647\u2013659","journal-title":"Proc VLDB Endow"},{"key":"255_CR76","first-page":"456","volume-title":"A lightweight infrastructure for graph analytics","author":"D Nguyen","year":"2013","unstructured":"Nguyen D, Lenharth A, Pingali K (2013) A lightweight infrastructure for graph analytics. SOSP, pp 456\u2013471"},{"key":"255_CR77","doi-asserted-by":"crossref","unstructured":"Nurvitadhi E, Weisz G, Wang Y, Hurkat S, Nguyen M, Hoe JC, Mart\u00ednez JF, Guestrin C (2014) Graphgen: An FPGA framework for vertex-centric graph computation. FCCM. IEEE Computer Society, pp 25\u201328","DOI":"10.1109\/FCCM.2014.15"},{"issue":"20","key":"255_CR78","doi-asserted-by":"crossref","first-page":"4021","DOI":"10.1093\/nar\/28.20.4021","volume":"28","author":"H Ogata","year":"2000","unstructured":"Ogata H, Fujibuchi W, Goto S, Kanehisa M (2000) A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Res 28(20):4021\u20134028","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"255_CR79","doi-asserted-by":"crossref","first-page":"928","DOI":"10.14778\/1920841.1920959","volume":"3","author":"I Pandis","year":"2010","unstructured":"Pandis I, Johnson R, Hardavellas N, Ailamaki A (2010) Data-oriented transaction execution. Proc VLDB Endow 3(1):928\u2013939","journal-title":"Proc VLDB Endow"},{"key":"255_CR80","doi-asserted-by":"crossref","unstructured":"Pandit S, Chau DH, Wang S, Faloutsos C (2007) Netprobe: a fast and scalable system for fraud detection in Online auction networks. WWW. ACM, pp 201\u2013210","DOI":"10.1145\/1242572.1242600"},{"key":"255_CR81","doi-asserted-by":"crossref","unstructured":"Paradies M, Lehner W, Bornh\u00f6vd C (2015) GRAPHITE: An extensible graph traversal framework for relational database management systems. SSDBM. ACM, pp 29:1\u201329:12","DOI":"10.1145\/2791347.2791383"},{"key":"255_CR82","doi-asserted-by":"crossref","unstructured":"Pham M, Passing L, Erling O, Boncz PA (2015) Deriving an emergent relational schema from RDF data. WWW. ACM, pp 864\u2013874","DOI":"10.1145\/2736277.2741121"},{"key":"255_CR83","first-page":"406","volume-title":"A structural approach to indexing triples","author":"F Picalausa","year":"2012","unstructured":"Picalausa F, Luo Y, Fletcher GHL, Hidders J, Vansummeren S (2012) A structural approach to indexing triples. ESWC. Springer, Berlin Heidelberg, pp 406\u2013421"},{"key":"255_CR84","unstructured":"Prabhakaran V, Wu M, Weng X, McSherry F, Zhou L, Haradasan M (2012) Managing large graphs on multi-cores with graph awareness. ATC. USENIX Association, pp 41\u201352"},{"key":"255_CR85","unstructured":"Raman R, van Rest O, Hong S, Wu Z, Chafi H, Banerjee J (2014) PGX.ISO: parallel and efficient in-memory engine for subgraph isomorphism. GRADES. ACM, pp 1\u20136"},{"key":"255_CR86","doi-asserted-by":"crossref","unstructured":"van Rest O, Hong S, Kim J, Meng X, Chafi H (2016) PGQL: a property graph query language. GRADES. ACM,","DOI":"10.1145\/2960414.2960421"},{"key":"255_CR87","volume-title":"Graph databases","author":"I Robinson","year":"2015","unstructured":"Robinson I, Webber J, Eifrem E (2015) Graph databases, 2nd\u00a0edn. O\u2019Reilly, Sebastopol, CA, USA","edition":"2"},{"key":"255_CR88","doi-asserted-by":"crossref","unstructured":"Rodriguez MA (2015) The gremlin graph traversal machine and language. DBPL. ACM","DOI":"10.1145\/2815072.2815073"},{"issue":"6","key":"255_CR89","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/bult.2010.1720360610","volume":"36","author":"MA Rodriguez","year":"2010","unstructured":"Rodriguez MA, Neubauer P (2010) Constructions from dots and lines. Bull Am Soc Inf Sci Technol 36(6):35\u201341","journal-title":"Bull Am Soc Inf Sci Technol"},{"key":"255_CR90","doi-asserted-by":"crossref","unstructured":"Roy A, Mihailovic I, Zwaenepoel W (2013) X\u2011stream: edge-centric graph processing using streaming partitions. SIGOPS. ACM, pp 472\u2013488","DOI":"10.1145\/2517349.2522740"},{"key":"255_CR91","first-page":"403","volume":"214","author":"M Rudolf","year":"2013","unstructured":"Rudolf M, Paradies M, Bornh\u00f6vd C, Lehner W (2013) The graph story of the SAP HANA database. BTW 214:403\u2013420","journal-title":"BTW"},{"issue":"14","key":"255_CR92","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.14778\/2556549.2556572","volume":"6","author":"J Seo","year":"2013","unstructured":"Seo J, Park J, Shin J, Lam MS (2013) Distributed Socialite: a datalog-based language for large-scale graph analysis. Proc VLDB Endow 6(14):1906\u20131917","journal-title":"Proc VLDB Endow"},{"issue":"7","key":"255_CR93","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1109\/TKDE.2015.2405562","volume":"27","author":"J Seo","year":"2015","unstructured":"Seo J, Guo S, Lam MS (2015) Socialite: An efficient graph query language based on Datalog. IEEE Trans Knowl Data Eng 27(7):1824\u20131837","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"255_CR94","doi-asserted-by":"crossref","unstructured":"Sevenich M, Hong S, Welc A, Chafi H (2014) Fast in-memory triangle listing for large real-world graphs. SNA. ACM, pp 2:1\u20132:9","DOI":"10.1145\/2659480.2659494"},{"key":"255_CR95","doi-asserted-by":"crossref","unstructured":"Shao B, Wang H, Li Y (2013) Trinity: a distributed graph engine on a memory cloud. SIGMOD. ACM, pp 505\u2013516","DOI":"10.1145\/2463676.2467799"},{"key":"255_CR96","first-page":"135","volume-title":"Ligra: a lightweight graph processing framework for shared memory","author":"J Shun","year":"2013","unstructured":"Shun J, Blelloch GE (2013) Ligra: a lightweight graph processing framework for shared memory. PPoPP, pp 135\u2013146"},{"key":"255_CR97","doi-asserted-by":"crossref","unstructured":"Slota GM, Rajamanickam S, Madduri K (2014) BFS and coloring-based parallel algorithms for strongly connected components and related problems. IPDPS. IEEE Computer Society, pp 550\u2013559","DOI":"10.1109\/IPDPS.2014.64"},{"key":"255_CR98","doi-asserted-by":"crossref","unstructured":"Sun W, Fokoue A, Srinivas K, Kementsietsidis A, Hu G, Xie GT (2015) SQLgraph: an efficient relational-based property graph store. SIGMOD. ACM, pp 1887\u20131901","DOI":"10.1145\/2723372.2723732"},{"issue":"11","key":"255_CR99","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.14778\/2809974.2809983","volume":"8","author":"N Sundaram","year":"2015","unstructured":"Sundaram N, Satish N, Patwary MMA, Dulloor S, Anderson MJ, Vadlamudi SG, Das D, Dubey P (2015) Graphmat: high performance graph analytics made productive. Proc VLDB Endow 8(11):1214\u20131225","journal-title":"Proc VLDB Endow"},{"key":"255_CR100","doi-asserted-by":"crossref","unstructured":"Tanase IG, Xia Y, Nai L, Liu Y, Tan W, Crawford J, Lin C (2014) A highly efficient runtime and graph library for large-scale graph analytics. GRADES. ACM, pp 10:1\u201310:6","DOI":"10.1145\/2621934.2621945"},{"key":"255_CR101","series-title":"CoRR abs\/1701.02628","volume-title":"Greed is good: optimistic algorithms for bipartite-graph partial coloring on Multicore architectures","author":"MK Tas","year":"2017","unstructured":"Tas MK, Kaya K, Saule E (2017) Greed is good: optimistic algorithms for bipartite-graph partial coloring on Multicore architectures. CoRR abs\/1701.02628."},{"issue":"3","key":"255_CR102","doi-asserted-by":"crossref","first-page":"193","DOI":"10.14778\/2732232.2732238","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y, Balmin A, Corsten SA, Tatikonda S, McPherson J (2013) From \u2018think like a vertex\u2019 to \u2018think like a graph\u2019. Proc VLDB Endow 7(3):193\u2013204","journal-title":"Proc VLDB Endow"},{"key":"255_CR103","volume-title":"The competitive dynamics of the consumer web: five graphs deliver a sustainable advantage","author":"R Valdes","year":"2012","unstructured":"Valdes R (2012) The competitive dynamics of the consumer web: five graphs deliver a sustainable advantage. https:\/\/www.gartner.com\/doc\/2081316\/competitive-dynamics-consumer-web-graphs"},{"issue":"8","key":"255_CR104","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"key":"255_CR105","series-title":"Tutorial Lectures (2017)","volume-title":"Declarative multidimensional graph queries","author":"H Voigt","year":"2016","unstructured":"Voigt H (2016) Declarative multidimensional graph queries. Business Intelligence \u2013 6th European Summer School, eBISS, Tours, France, July 3\u20118, 2016. Tutorial Lectures (2017)."},{"key":"255_CR106","volume-title":"SPARQL 1.1 Query Language","author":"W3C","year":"2013","unstructured":"W3C (2013) SPARQL 1.1 Query Language. https:\/\/www.w3.org\/TR\/2013\/REC-sparql11-query-20130321\/"},{"key":"255_CR107","volume-title":"RDF 1.1 Concepts and Abstract Syntax","author":"W3C","year":"2014","unstructured":"W3C (2014) RDF 1.1 Concepts and Abstract Syntax. http:\/\/www.w3.org\/TR\/2014\/REC-rdf11-concepts-20140225\/"},{"key":"255_CR108","volume-title":"Asynchronous large-scale graph processing made easy","author":"G Wang","year":"2013","unstructured":"Wang G, Xie W, Demers AJ, Gehrke J (2013) Asynchronous large-scale graph processing made easy. CIDR."},{"issue":"1","key":"255_CR109","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.14778\/1453856.1453965","volume":"1","author":"C Weiss","year":"2008","unstructured":"Weiss C, Karras P, Bernstein A (2008) Hexastore: sextuple indexing for semantic web data management. Proc VLDB Endow 1(1):1008\u20131019","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"255_CR110","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood PT (2012) Query languages for graph databases. SIGMOD Rec 41(1):50\u201360","journal-title":"SIGMOD Rec"},{"key":"255_CR111","doi-asserted-by":"crossref","unstructured":"Xia Y, Tanase IG, Nai L, Tan W, Liu Y, Crawford J, Lin C (2014) Graph analytics and storage. Big Data. IEEE, pp 942\u2013951","DOI":"10.1109\/BigData.2014.7004326"},{"key":"255_CR112","doi-asserted-by":"crossref","unstructured":"Xie C, Chen R, Guan H, Zang B, Chen H (2015) SYNC or ASYNC: time to fuse for distributed graph-parallel computation. PPoPP. ACM, pp 194\u2013204","DOI":"10.1145\/2688500.2688508"},{"key":"255_CR113","doi-asserted-by":"crossref","unstructured":"Yan D, Bu Y, Tian Y, Deshpande A, Cheng J (2016) Big graph analytics systems. SIGMOD. ACM, pp 2241\u20132243","DOI":"10.1145\/2882903.2912566"},{"key":"255_CR114","doi-asserted-by":"crossref","unstructured":"Yuan P, Zhang W, Xie C, Jin H, Liu L, Lee K (2014) Fast iterative graph computation: a path centric approach. SC. IEEE Computer Society, pp 401\u2013412","DOI":"10.1109\/SC.2014.38"},{"key":"255_CR115","first-page":"183","volume-title":"NUMA-aware graph-structured analytics","author":"K Zhang","year":"2015","unstructured":"Zhang K, Chen R, Chen H (2015) NUMA-aware graph-structured analytics. PPoPP, pp 183\u2013193"},{"key":"255_CR116","unstructured":"Zheng D, Mhembere D, Burns RC, Vogelstein JT, Priebe CE, Szalay AS (2015) Flashgraph: processing billion-node graphs on an array of commodity SSDs. FAST. USENIX Association, pp 45\u201358"},{"key":"255_CR117","unstructured":"Zhu X, Han W, Chen W (2015) Gridgraph: large-scale graph processing on a single machine using 2\u2011level hierarchical partitioning. ATC. USENIX Association, pp 375\u2013386"},{"issue":"4","key":"255_CR118","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s00778-013-0337-7","volume":"23","author":"L Zou","year":"2014","unstructured":"Zou L, \u00d6zsu MT, Chen L, Shen X, Huang R, Zhao D (2014) gStore: a graph-based SPARQL query engine. VLDB\u00a0J 23(4):565\u2013590","journal-title":"VLDB J"}],"container-title":["Datenbank-Spektrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13222-017-0255-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-017-0255-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-017-0255-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T10:40:29Z","timestamp":1602326429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13222-017-0255-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":118,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["255"],"URL":"https:\/\/doi.org\/10.1007\/s13222-017-0255-8","relation":{},"ISSN":["1618-2162","1610-1995"],"issn-type":[{"type":"print","value":"1618-2162"},{"type":"electronic","value":"1610-1995"}],"subject":[],"published":{"date-parts":[[2017,6,19]]}}}