{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:09:32Z","timestamp":1742933372106,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319484716"},{"type":"electronic","value":"9783319484723"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48472-3_53","type":"book-chapter","created":{"date-parts":[[2016,10,17]],"date-time":"2016-10-17T04:43:13Z","timestamp":1476679393000},"page":"844-861","source":"Crossref","is-referenced-by-count":3,"title":["Processing Regular Path Queries on Arbitrarily Distributed Data"],"prefix":"10.1007","author":[{"given":"Alan","family":"Davoust","sequence":"first","affiliation":[]},{"given":"Babak","family":"Esfandiari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,18]]},"reference":[{"key":"53_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-62222-5_50","volume-title":"Database Theory \u2014 ICDT \u201997","author":"S Abiteboul","year":"1997","unstructured":"Abiteboul, S., Vianu, V.: Queries and computation on the web. In: Afrati, F., Kolaitis, P. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 262\u2013275. Springer, Heidelberg (1997). doi: 10.1007\/3-540-62222-5_50"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Vianu, V.: Regular path queries with constraints. In: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 122\u2013133. ACM (1997)","DOI":"10.1145\/263661.263676"},{"key":"53_CR3","unstructured":"Baeza, P.B.: Querying graph databases. In: Hull, R., Fan, W., (eds.) PODS, pp. 175\u2013188. ACM (2013)"},{"issue":"4","key":"53_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/959060.959076","volume":"32","author":"D Calvanese","year":"2003","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Reasoning on regular path queries. SIGMOD Rec. 32(4), 83\u201392 (2003)","journal-title":"SIGMOD Rec."},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Q., Lim, A., Ong, K.W.: D(k)-index: an adaptive structural summary for graph-structured data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2003), pp. 134\u2013144, New York, NY, USA. ACM (2003)","DOI":"10.1145\/872757.872776"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"Consens, M.P., Mendelzon, A.O.: The G+\/Graphlog visual query system. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 1990), p. 388, New York, NY, USA. ACM (1990)","DOI":"10.1145\/93597.98748"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Cruz, I.F., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: ACM SIGMOD Record, vol. 16, pp. 323\u2013330. ACM (1987)","DOI":"10.1145\/38713.38749"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Fernandez, M.F., Suciu, D.: Optimizing regular path expressions using graph schemas. In: Urban, S.D., Bertino, E., (eds.) ICDE, pp. 14\u201323. IEEE Computer Society (1998)","DOI":"10.1109\/ICDE.1998.655753"},{"issue":"4","key":"53_CR9","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"key":"53_CR10","unstructured":"Goldman, R., Widom, J.: Dataguides: enabling query formulation and optimization in semistructured databases. Technical Report 1997\u201350, Stanford InfoLab (1997)"},{"issue":"7","key":"53_CR11","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1109\/TKDE.2004.1318562","volume":"16","author":"A Halevy","year":"2004","unstructured":"Halevy, A., Ives, Z., Madhavan, J., Mork, P., Suciu, D., Tatarinov, I.: The piazza peer data management system. IEEE Trans. Knowl. Data Eng. 16(7), 787\u2013798 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"Harth, A., Hose, K., Karnstedt, M., Polleres, A., Sattler, K.-U., Umbrich, J.: Data summaries for on-demand queries over linked data. In: Proceedings of the 19th International Conference on World Wide Web (WWW 2010), pp. 411\u2013420, New York, NY, USA. ACM (2010)","DOI":"10.1145\/1772690.1772733"},{"key":"53_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-3-642-04930-9_19","volume-title":"The Semantic Web - ISWC 2009","author":"O Hartig","year":"2009","unstructured":"Hartig, O., Bizer, C., Freytag, J.-C.: Executing SPARQL queries over the web of linked data. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 293\u2013309. Springer, Heidelberg (2009)"},{"key":"53_CR14","unstructured":"Koschmieder, A.: Cost-based optimization of regular path queries on large graphs. In: Balke, W.-T., Lofi, C., (eds.), Grundlagen von Datenbanken, vol. 581 of CEUR Workshop Proceedings (2010). CEUR-WS.org"},{"key":"53_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-642-31235-9_12","volume-title":"Scientific and Statistical Database Management","author":"A Koschmieder","year":"2012","unstructured":"Koschmieder, A., Leser, U.: Regular path queries on large graphs. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 177\u2013194. Springer, Heidelberg (2012)"},{"key":"53_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/978-3-642-17746-0_29","volume-title":"The Semantic Web \u2013 ISWC 2010","author":"G Ladwig","year":"2010","unstructured":"Ladwig, G., Tran, T.: Linked data query processing strategies. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 453\u2013469. Springer, Heidelberg (2010)"},{"issue":"1","key":"53_CR17","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/s007990050004","volume":"1","author":"AO Mendelzon","year":"1997","unstructured":"Mendelzon, A.O., Mihaila, G.A., Milo, T.: Querying the world wide web. Int. J. Digital Libr. 1(1), 54\u201367 (1997)","journal-title":"Int. J. Digital Libr."},{"key":"53_CR18","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: Apers, P.M.G., Wiederhold, G., (eds.) VLDB, pp. 185\u2013193. Morgan Kaufmann (1989)"},{"issue":"8","key":"53_CR19","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1080\/0266476042000270527","volume":"31","author":"G Navarro","year":"2004","unstructured":"Navarro, G.: Pattern matching. J. Appl. Stat. 31(8), 925\u2013949 (2004). Special issue on Pattern Discovery","journal-title":"J. Appl. Stat."},{"key":"53_CR20","doi-asserted-by":"crossref","unstructured":"Nejdl, W., Wolf, B., Qu, C., Decker, S., Sintek, M., Naeve, A., Nilsson, M., Palm\u00e9r, M., Risch, T.: EDUTELLA: a P2P networking infrastructure based on RDF. In: Proceedings of the 11th International Conference on World Wide Web (WWW 2002), pp. 604\u2013615, New York, NY, USA. ACM (2002)","DOI":"10.1145\/511446.511525"},{"issue":"19","key":"53_CR21","doi-asserted-by":"crossref","first-page":"2444","DOI":"10.1093\/bioinformatics\/btl408","volume":"22","author":"C Plake","year":"2006","unstructured":"Plake, C., Schiemann, T., Pankalla, M., Hakenberg, J., Leser, U.: AliBaba: PubMed as a graph. Bioinformatics 22(19), 2444\u20132445 (2006)","journal-title":"Bioinformatics"},{"key":"53_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/978-3-642-41335-3_36","volume-title":"The Semantic Web \u2013 ISWC 2013","author":"M Saleem","year":"2013","unstructured":"Saleem, M., Ngonga Ngomo, A.-C., Xavier Parreira, J., Deus, H.F., Hauswirth, M.: DAW: duplicate-aware federated query processing over the web of data. In: Alani, H., et al. (eds.) ISWC 2013, Part I. LNCS, vol. 8218, pp. 574\u2013590. Springer, Heidelberg (2013)"},{"issue":"1","key":"53_CR23","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2008.09.061","volume":"410","author":"M Shoaran","year":"2009","unstructured":"Shoaran, M., Thomo, A.: Fault-tolerant computation of distributed regular path queries. Theor. Comput. Sci. 410(1), 62\u201377 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"53_CR24","unstructured":"Suciu, D.: Query decomposition and view maintenance for query languages for unstructured data. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L., (eds.) VLDB, pp. 227\u2013238. Morgan Kaufmann (1996)"},{"issue":"6","key":"53_CR25","doi-asserted-by":"crossref","first-page":"585","DOI":"10.3233\/SW-140164","volume":"6","author":"J Umbrich","year":"2014","unstructured":"Umbrich, J., Hogan, A., Polleres, A., Decker, S.: Link traversal querying for a diverse web of data. Semant. Web J. 6(6), 585\u2013624 (2014)","journal-title":"Semant. Web J."},{"key":"53_CR26","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 137\u2013146, New York, NY, USA. ACM (1982)","DOI":"10.1145\/800070.802186"},{"key":"53_CR27","doi-asserted-by":"crossref","unstructured":"Yakovets, N., Godfrey, P., Gryz, J.: Towards query optimization for SPARQL property paths. CoRR, abs\/1504.08262 (2015)","DOI":"10.1145\/2882903.2882944"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems: OTM 2016 Conferences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48472-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T13:39:12Z","timestamp":1568468352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48472-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319484716","9783319484723"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48472-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}