{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:27:03Z","timestamp":1743053223173,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319639628"},{"type":"electronic","value":"9783319639628"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-63962-8_215-1","type":"book-chapter","created":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T01:14:28Z","timestamp":1519434868000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Query Processing"],"prefix":"10.1007","author":[{"given":"S.","family":"Salihoglu","sequence":"first","affiliation":[]},{"given":"N.","family":"Yakovets","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,10]]},"reference":[{"key":"215-1_CR1","doi-asserted-by":"crossref","unstructured":"Aberger CR, Tu S, Olukotun K, R\u00e9 C (2016) EmptyHeaded: a relational engine for graph processing. In: SIGMOD","DOI":"10.1145\/2882903.2915213"},{"key":"215-1_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R (1988) Alpha: an extension of relational algebra to express a class of recursive queries. IEEE TSE 14(7):879\u2013885","DOI":"10.1109\/32.42731"},{"key":"215-1_CR3","doi-asserted-by":"crossref","unstructured":"Aref M, ten Cate B, Green TJ, Kimelfeld B, Olteanu D, Pasalic E, Veldhuizen TL, Washburn G (2015) Design and implementation of the logicblox system. In: SIGMOD","DOI":"10.1145\/2723372.2742796"},{"key":"215-1_CR4","doi-asserted-by":"crossref","unstructured":"Atserias A, Grohe M, Marx D (2013) Size bounds and query plans for relational joins. SIAM J Comput 42(4):1737\u20131767","DOI":"10.1137\/110859440"},{"key":"215-1_CR5","doi-asserted-by":"crossref","unstructured":"Consens MP, Mendelzon AO, Vista D, Wood PT (1995) Constant propagation versus join reordering in datalog. In: Rules in database systems. Springer, Berlin, Heidelberg, pp 245\u2013259","DOI":"10.1007\/3-540-60365-4_131"},{"key":"215-1_CR6","doi-asserted-by":"crossref","unstructured":"Cordella L, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. TPAMI 26(10):1367\u20131372","DOI":"10.1109\/TPAMI.2004.75"},{"key":"215-1_CR7","doi-asserted-by":"crossref","unstructured":"Dey S, Cuevas-Vicentt\u00edn V, K\u00f6hler S, Gribkoff E, Wang M, Lud\u00e4scher B (2013) On implementing provenance-aware regular path queries with relational query engines. In: Proceedings of the joint EDBT\/ICDT 2013 workshops. ACM, pp 214\u2013223","DOI":"10.1145\/2457317.2457353"},{"key":"215-1_CR8","doi-asserted-by":"crossref","unstructured":"F\u00e4rber F, Cha SK, Primsch J, Bornh\u00f6vd C, Sigg S, Lehner W (2012) SAP HANA database: data management for modern business applications. SIGMOD Rec 40(4): 45\u201351","DOI":"10.1145\/2094114.2094126"},{"key":"215-1_CR9","unstructured":"Fletcher GH, Peters J, Poulovassilis A (2016) Efficient regular path query evaluation using path indexes. In: Proceedings of the 19th international conference on extending database technology"},{"key":"215-1_CR10","doi-asserted-by":"crossref","unstructured":"Gou G, Chirkova R (2007) Efficiently querying large XML data repositories: a survey. TKDE 19(10): 1381\u20131403","DOI":"10.1109\/TKDE.2007.1060"},{"key":"215-1_CR11","doi-asserted-by":"crossref","unstructured":"Gubichev A, Bedathur SJ, Seufert S (2013) Sparqling Kleene: fast property paths in RDF-3X. In: Workshop on graph data management experiences and systems. ACM, pp 14\u201320","DOI":"10.1145\/2484425.2484443"},{"key":"215-1_CR12","doi-asserted-by":"crossref","unstructured":"Han WS, Lee J, Lee JH (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD","DOI":"10.1145\/2463676.2465300"},{"key":"215-1_CR13","doi-asserted-by":"crossref","unstructured":"Kankanamge C, Sahu S, Mhedbhi A, Chen J, Salihoglu S (2017) Graphflow: an active graph database. In: SIGMOD","DOI":"10.1145\/3035918.3056445"},{"key":"215-1_CR14","unstructured":"Kochut KJ, Janik M (2007) SPARQLeR: extended SPARQL for semantic association discovery. In: The semantic web: research and applications. Springer, Berlin, pp 145\u2013159"},{"key":"215-1_CR15","doi-asserted-by":"crossref","unstructured":"Koschmieder A, Leser U (2012) Regular path queries on large graphs. In: Scientific and statistical database management. Springer, Berlin\/Heidelberg, pp 177\u2013194","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"215-1_CR16","doi-asserted-by":"crossref","unstructured":"Lai L, Qin L, Lin X, Zhang Y, Chang L (2016) Scalable distributed subgraph enumeration. In: VLDB","DOI":"10.14778\/3021924.3021937"},{"key":"215-1_CR17","doi-asserted-by":"crossref","unstructured":"Lai L, Qin L, Lin X, Chang L (2017) Scalable subgraph enumeration in MapReduce: a cost-oriented approach. VLDB J 26(3):421\u2013446","DOI":"10.1007\/s00778-017-0459-4"},{"key":"215-1_CR18","doi-asserted-by":"crossref","unstructured":"Losemann K, Martens W (2012) The complexity of evaluating path expressions in SPARQL. In: Proceedings of the 31st symposium on principles of database systems. ACM, pp 101\u2013112","DOI":"10.1145\/2213556.2213573"},{"key":"215-1_CR19","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: SIGMOD","DOI":"10.1145\/1807167.1807184"},{"key":"215-1_CR20","doi-asserted-by":"crossref","unstructured":"Mendelzon A, Wood P (1995) Finding regular simple paths in graph databases. SIAM J Comput 24(6): 1235\u20131258","DOI":"10.1137\/S009753979122370X"},{"key":"215-1_CR21","doi-asserted-by":"crossref","unstructured":"Neumann T, Weikum G (2010) The RDF-3X engine for scalable management of RDF data. VLDB 19:91\u2013113","DOI":"10.1007\/s00778-009-0165-y"},{"key":"215-1_CR22","doi-asserted-by":"crossref","unstructured":"Ngo HQ, Porat E, R\u00e9 C, Rudra A (2012) Worst-case optimal join algorithms. In: PODS","DOI":"10.1145\/2213556.2213565"},{"key":"215-1_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen D, Aref M, Bravenboer M, Kollias G, Ngo HQ, R\u00e9 C, Rudra A (2015) Join processing for graph patterns: an old dog with new tricks. In: GRADES workshop","DOI":"10.1145\/2764947.2764948"},{"key":"215-1_CR24","doi-asserted-by":"crossref","unstructured":"Olteanu D, Schleich M (2016) Factorized databases. SIGMOD Rec 45(2):5\u201316","DOI":"10.1145\/3003665.3003667"},{"key":"215-1_CR25","doi-asserted-by":"crossref","unstructured":"P\u00e9rez J, Arenas M, Gutierrez C (2010) nSPARQL: a navigational language for RDF. Web Semant Sci Serv Agents World Wide Web 8(4):255\u2013270","DOI":"10.1016\/j.websem.2010.01.002"},{"key":"215-1_CR26","doi-asserted-by":"crossref","unstructured":"Qiao M, Zhang H, Cheng H (2017) Subgraph matching: on compression and computation. VLDB 11(2):17\u2013188","DOI":"10.14778\/3149193.3149198"},{"key":"215-1_CR27","doi-asserted-by":"crossref","unstructured":"Thompson K (1968) Regular expression search algorithm. Commun ACM 11(6):419\u2013422","DOI":"10.1145\/363347.363387"},{"key":"215-1_CR28","unstructured":"Veldhuizen TL (2012) Leapfrog Triejoin: a worst-case optimal join algorithm. CoRR abs\/1210.0481"},{"key":"215-1_CR29","unstructured":"Yakovets N, Godfrey P, Gryz J (2013) Evaluation of SPARQL property paths via recursive SQL. In: AMW"},{"key":"215-1_CR30","doi-asserted-by":"crossref","unstructured":"Yakovets N, Godfrey P, Gryz J (2016) Query planning for evaluating SPARQL property paths. In: SIGMOD, San Francisco, pp 1875\u20131889","DOI":"10.1145\/2882903.2882944"},{"key":"215-1_CR31","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-15918-3_25","volume-title":"Web reasoning and rule systems","author":"H Zauner","year":"2010","unstructured":"Zauner H, Linse B, Furche T, Bry F (2010) A RPL through RDF: expressive navigation in RDF graphs. In: Web reasoning and rule systems. Springer, Heidelberg, pp 251\u2013257"},{"issue":"1\u20132","key":"215-1_CR32","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao P, Han J (2010) On graph query optimization in large networks. VLDB 3(1\u20132):340\u2013351","journal-title":"VLDB"}],"container-title":["Encyclopedia of Big Data Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63962-8_215-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T02:23:04Z","timestamp":1557454984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63962-8_215-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319639628","9783319639628"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63962-8_215-1","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"10 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}