{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:04Z","timestamp":1746115864056,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_29","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"325-337","source":"Crossref","is-referenced-by-count":0,"title":["Regular Expressions with Binding over Data Words for Querying Graph Databases"],"prefix":"10.1007","author":[{"given":"Leonid","family":"Libkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Vrgo\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kauffman (1999)"},{"key":"29_CR2","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)"},{"key":"29_CR3","first-page":"428","volume":"58","author":"S. Abiteboul","year":"1999","unstructured":"Abiteboul, S., Vianu, V.: Regular path queries with constraints. JCSS\u00a058, 428\u2013452 (1999)","journal-title":"JCSS"},{"issue":"1","key":"29_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"Renzo Angles","year":"2008","unstructured":"Angles, R., Guti\u00e9rrez, C.: Survey of graph database models. ACM Comput. Surv.\u00a040(1) (2008)","journal-title":"ACM Computing Surveys"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3, P., Figueira, D., Libkin, L.: Graph logics with rational relations and the generalized intersection problem. In: LICS (2012)","DOI":"10.1109\/LICS.2012.23"},{"issue":"4","key":"29_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2389241.2389250","volume":"37","author":"Pablo Barcel\u00f3","year":"2012","unstructured":"Barcel\u00f3, P., Libkin, L., Lin, A.W., Wood, P.: Expressive languages for path queries over graph-structured data. ACM TODS\u00a037(4) (2012)","journal-title":"ACM Transactions on Database Systems"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4204\/EPTCS.25.1","volume":"25","author":"Miko\u0142aj Boja\u0144czyk","year":"2010","unstructured":"Bojanczyk, M.: Automata for Data Words and Data Trees. In: RTA, pp. 1\u20134 (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"29_CR8","unstructured":"Calvanese, D., de Giacomo, G., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: KR 2000, pp. 176\u2013185 (2000)"},{"issue":"3","key":"29_CR9","first-page":"443","volume":"64","author":"D. Calvanese","year":"2002","unstructured":"Calvanese, D., de Giacomo, G., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. JCSS\u00a064(3), 443\u2013465 (2002)","journal-title":"JCSS"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Consens, M.P., Mendelzon, A.O.: GraphLog: a visual formalism for real life recursion. In: PODS 1990, pp. 404\u2013416 (1990)","DOI":"10.1145\/298514.298591"},{"issue":"3","key":"29_CR11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/38714.38749","volume":"16","author":"Isabel F. Cruz","year":"1987","unstructured":"Cruz, I., Mendelzon, A., Wood, P.: A graphical query language supporting recursion. In: SIGMOD 1987, pp. 323\u2013330 (1987)","journal-title":"ACM SIGMOD Record"},{"issue":"3","key":"29_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"St\u00e9phane Demri","year":"2009","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM TOCL\u00a010(3) (2009)","journal-title":"ACM Transactions on Computational Logic"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. In: ICDT 2012, pp. 8\u201321 (2012)","DOI":"10.1145\/2274576.2274578"},{"key":"29_CR14","unstructured":"Figueira, D.: Reasoning on words and trees with data. PhD thesis (2010)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Figueira, D.: Alternating register automata on finite words and trees. Logical Methods in Computer Science\u00a08(1) (2012)","DOI":"10.2168\/LMCS-8(1:22)2012"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O. Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 561\u2013572. Springer, Heidelberg (2010)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets (2011) (manuscript)","DOI":"10.1007\/978-3-642-13089-2_47"},{"issue":"3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.jcss.2010.04.009","volume":"77","author":"C. Gutierrez","year":"2011","unstructured":"Gutierrez, C., Hurtado, C., Mendelzon, A.: Foundations of semantic Web databases. J. Comput. Syst. Sci.\u00a077(3), 520\u2013541 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"29_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. TCS\u00a0134(2), 329\u2013363 (1994)","journal-title":"TCS"},{"issue":"3","key":"29_CR20","doi-asserted-by":"crossref","first-page":"301","DOI":"10.3233\/FUN-2006-69304","volume":"69","author":"M. Kaminski","year":"2006","unstructured":"Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundamenta Informaticae\u00a069(3), 301\u2013318 (2006)","journal-title":"Fundamenta Informaticae"},{"issue":"suppl. 2","key":"29_CR21","doi-asserted-by":"crossref","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(suppl. 2), 33\u201339 (2005)","journal-title":"Bioinformatics"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: ICDT 2012, pp. 74\u201385 (2012)","DOI":"10.1145\/2274576.2274585"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-28717-6_22","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L. Libkin","year":"2012","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular expressions for data words. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol.\u00a07180, pp. 274\u2013288. Springer, Heidelberg (2012)"},{"issue":"5594","key":"29_CR24","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., et al.: Network motifs: simple building blocks of complex networks. Science\u00a0298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"3","key":"29_CR25","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM TOCL\u00a05(3), 403\u2013435 (2004)","journal-title":"ACM TOCL"},{"key":"29_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1089\/153623103322006652","volume":"7","author":"F. Olken","year":"2003","unstructured":"Olken, F.: Graph data management for molecular biology. OMICS\u00a07, 75\u201378 (2003)","journal-title":"OMICS"},{"issue":"3","key":"29_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1567274.1567278","volume":"34","author":"J. P\u00e9rez","year":"2009","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM TODS\u00a034(3), 1\u201345 (2009)","journal-title":"ACM TODS"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Ronen, R., Shmueli, O.: SoQL: a language for querying and creating data in social networks. In: ICDE 2009, pp. 1595\u20131602 (2009)","DOI":"10.1109\/ICDE.2009.172"},{"key":"29_CR29","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., et al. (eds.) ESWC 2009. LNCS, vol.\u00a05554, pp. 293\u2013307. Springer, Heidelberg (2009)"},{"key":"29_CR30","unstructured":"Schwentick, T.: A Little Bit Infinite? On Adding Data to Finitely Labelled Structures. In: STACS 2008, pp. 17\u201318 (2008)"},{"key":"29_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"29_CR32","unstructured":"A. Tal. Decidability of Inclusion for Unification Based Automata. M.Sc. thesis (in Hebrew), Technion (1999)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T12:00:28Z","timestamp":1746014428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}