{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:25:26Z","timestamp":1768109126643,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642312342","type":"print"},{"value":"9783642312359","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31235-9_12","type":"book-chapter","created":{"date-parts":[[2012,6,14]],"date-time":"2012-06-14T12:12:45Z","timestamp":1339675965000},"page":"177-194","source":"Crossref","is-referenced-by-count":46,"title":["Regular Path Queries on Large Graphs"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Koschmieder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Leser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s007990050005","volume":"1","author":"S. Abiteboul","year":"1997","unstructured":"Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The lorel query language for semistructured data. Int. Journal on Digital Libraries\u00a01, 68\u201388 (1997)","journal-title":"Int. Journal on Digital Libraries"},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1038\/nbt1203","volume":"24","author":"S. Aerts","year":"2006","unstructured":"Aerts, S., Lambrechts, D., Maity, S., Van Loo, P., et al.: Gene prioritization through genomic data fusion. Nat. Biotechnol.\u00a024(5), 537\u2013544 (2006)","journal-title":"Nat. Biotechnol."},{"key":"12_CR3","volume-title":"Compilers: principles, techniques, and tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Boston (1986)"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.websem.2009.02.002","volume":"7","author":"F. Alkhateeb","year":"2009","unstructured":"Alkhateeb, F., Baget, J.-F., Euzenat, J.: Extending SPARQL with regular expression patterns (for querying RDF). Web Semant.\u00a07(2), 57\u201373 (2009)","journal-title":"Web Semant."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Anyanwu, K., Maduko, A., Sheth, A.: Sparq2l: towards support for subgraph extraction queries in rdf databases. In: WWW 2007, Banff, Alberta, Canada, pp. 797\u2013806 (2007)","DOI":"10.1145\/1242572.1242680"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00778-003-0094-0","volume":"12","author":"C.-Y. Chan","year":"2003","unstructured":"Chan, C.-Y., Garofalakis, M., Rastogi, R.: Re-tree: an efficient index structure for regular expressions. The VLDB Journal\u00a012(2), 102\u2013119 (2003)","journal-title":"The VLDB Journal"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Ding, B., Yu, P.S., Wang, H.: Fast graph pattern matching. In: ICDE 2008, pp. 913\u2013922. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"12_CR8","unstructured":"Cho, J., Rajagopalan, S.: A fast regular expression indexing engine. In: ICDE 2002, p. 0419 (2002)"},{"key":"12_CR9","unstructured":"Detwiler, L.T., Suciu, D., Brinkley, J.F.: Regular paths in sparql: Querying the nci thesaurus. American Medical Informatics Association, 161\u2013165 (2008)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Dries, A., Nijssen, S., De Raedt, L.: A query language for analyzing networks. In: CIKM 2009, New York, NY, USA, pp. 485\u2013494 (2009)","DOI":"10.1145\/1645953.1646016"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. In: ICDE, pp. 39\u201350 (2011)","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"12_CR12","first-page":"14","volume-title":"ICDE 1998","author":"M.F. Fernandez","year":"1998","unstructured":"Fernandez, M.F., Suciu, D.: Optimizing regular path expressions using graph schemas. In: ICDE 1998, pp. 14\u201323. IEEE, Washington, DC (1998)"},{"key":"12_CR13","unstructured":"Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: VLDB 1997, pp. 436\u2013445 (1997)"},{"key":"12_CR14","unstructured":"Goldman, R., Widom, J.: Approximate dataguides. In: Workshop on Query Processing (1999)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD 2008, New York, USA, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"12_CR16","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"suppl. 8","key":"12_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-9-S8-S2","volume":"9","author":"S. Jaeger","year":"2008","unstructured":"Jaeger, S., Gaudan, S., Leser, U., Rebholz-Schuhmann, D.: Integrating protein-protein interactions and text mining for protein function prediction. BMC Bioinformatics\u00a09(suppl. 8), S2 (2008)","journal-title":"BMC Bioinformatics"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: Proceedings of the 2010 International Conference on Management of Data, SIGMOD 2010, New York, NY, USA, pp. 123\u2013134 (2010)","DOI":"10.1145\/1807167.1807183"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: SIGMOD Conference, pp. 133\u2013144 (2002)","DOI":"10.1145\/564704.564707"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-72667-8_12","volume-title":"The Semantic Web: Research and Applications","author":"K.J. Kochut","year":"2007","unstructured":"Kochut, K.J., Janik, M.: SPARQLeR: Extended Sparql for Semantic Association Discovery. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol.\u00a04519, pp. 145\u2013159. Springer, Heidelberg (2007)"},{"key":"12_CR21","series-title":"LNCS","first-page":"177","volume-title":"SSDBM 2012","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.\u00a07338, pp. 177\u2013194. Springer, Heidelberg (2012)"},{"issue":"9","key":"12_CR22","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M. Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. IEEE Trans. on Knowl. and Data Eng.\u00a016(9), 1038\u20131051 (2004)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1093\/bioinformatics\/bti1105","volume":"21","author":"U. Leser","year":"2005","unstructured":"Leser, U.: A query language for biological networks. Bioinformatics\u00a021(2), 33\u201339 (2005)","journal-title":"Bioinformatics"},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1080\/15427951.2005.10129111","volume":"2","author":"L. Li","year":"2006","unstructured":"Li, L., Alderson, D., Tanaka, R., Doyle, J.C., Willinger, W.: Towards a theory of scale-free graphs: Definition, properties, and implications (ext. version). Internet Mathematics\u00a02(4), 431\u2013523 (2006)","journal-title":"Internet Mathematics"},{"key":"12_CR25","unstructured":"Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDB 2001, Roma, Italy, pp. 361\u2013370 (2001)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: PODC 2009, New York, NY, USA, p. 6 (2009)","DOI":"10.1145\/1582716.1582723"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Bazan, et al.: Dex: high-performance exploration on large graphs for information retrieval. In: CIKM 2007, New York, NY, USA, pp. 573\u2013582 (2007)","DOI":"10.1145\/1321440.1321521"},{"issue":"6","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"A.O. Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM Journal on Computing\u00a024(6), 1235\u20131258 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory - ICDT\u201999","author":"T. Milo","year":"1998","unstructured":"Milo, T., Suciu, D.: Index Structures for Path Expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"issue":"3","key":"12_CR30","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/601858.601869","volume":"31","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata theory for xml researchers. SIGMOD Rec.\u00a031(3), 39\u201346 (2002)","journal-title":"SIGMOD Rec."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Palaga, P., Nguyen, L., Leser, U., Hakenberg, J.: High-performance information extraction with alibaba. In: EDBT 2009, New York, USA, pp. 1140\u20131143 (2009)","DOI":"10.1145\/1516360.1516498"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Ronen, R., Shmueli, O.: SoQL: A language for querying and creating data in social networks. In: ICDE 2009, Shanghai, China, pp. 1595\u20131602 (2009)","DOI":"10.1109\/ICDE.2009.172"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-02121-3_24","volume-title":"The Semantic Web: Research and Applications","author":"M. San Mart\u00edn","year":"2009","unstructured":"San Mart\u00edn, M., Gutierrez, C.: Representing, Querying and Transforming Social Networks with RDF\/SPARQL. In: Aroyo, L., Traverso, P., Ciravegna, F., Cimiano, P., Heath, T., Hyv\u00f6nen, E., Mizoguchi, R., Oren, E., Sabou, M., Simperl, E. (eds.) ESWC 2009. LNCS, vol.\u00a05554, pp. 293\u2013307. Springer, Heidelberg (2009)"},{"issue":"2","key":"12_CR34","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1515\/jib-2008-100","volume":"5","author":"P. Sevon","year":"2008","unstructured":"Sevon, P., Eronen, L.: Subgraph queries by context-free grammars. Journal of Integrative Bioinformatics\u00a05(2), 100 (2008)","journal-title":"Journal of Integrative Bioinformatics"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Tri\u00dfl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD 2007, New York, NY, USA, pp. 845\u2013856 (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD 2004, New York, NY, USA, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"16","key":"12_CR37","doi-asserted-by":"publisher","first-page":"5934","DOI":"10.1073\/pnas.0306752101","volume":"101","author":"E. Yeger-Lotem","year":"2004","unstructured":"Yeger-Lotem, E., Sattath, S., Kashtan, N., et al.: Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction. Proc. Natl. Acad. Sci. USA\u00a0101(16), 5934\u20135939 (2004)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: Scalable reachability index for large graphs. In: VLDB 2010. VLDB Endowment (2010)","DOI":"10.14778\/1920841.1920879"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","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.: A RPL through RDF: Expressive Navigation in RDF Graphs. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol.\u00a06333, pp. 251\u2013257. Springer, Heidelberg (2010)"},{"issue":"1","key":"12_CR40","first-page":"886","volume":"2","author":"L. Zou","year":"2009","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: Distance-join: Pattern match query in a large graph database. PVLDB\u00a02(1), 886\u2013897 (2009)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31235-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:52:39Z","timestamp":1620129159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31235-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312342","9783642312359"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31235-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}