{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:10:09Z","timestamp":1743984609689,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331572"},{"type":"electronic","value":"9783642331589"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-33158-9_3","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T09:54:23Z","timestamp":1345283663000},"page":"78-111","source":"Crossref","is-referenced-by-count":7,"title":["Federation and Navigation in SPARQL 1.1"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Arenas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Alkhateeb, F., Baget, J.-F., Euzenat, J.: Constrained regular expressions in SPARQL. In: SWWS, pp. 91\u201399 (2008)"},{"issue":"2","key":"3_CR2","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). JWS\u00a07(2), 57\u201373 (2009)","journal-title":"JWS"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"C. \u00c0lvarez","year":"1993","unstructured":"\u00c0lvarez, C., Jenner, B.: A very hard log-space counting class. Theor. Comput. Sci.\u00a0107(1), 3\u201330 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Anyanwu, K., Maduko, A., Sheth, A.P.: Sparq2l: towards support for subgraph extraction queries in rdf databases. In: WWW, pp. 797\u2013806 (2007)","DOI":"10.1145\/1242572.1242680"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Arenas, M., Conca, S., P\u00e9rez, J.: Counting beyond a yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard. In: WWW, pp. 629\u2013638 (2012)","DOI":"10.1145\/2187836.2187922"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3, P., Hurtado, C.A., Libkin, L., Wood, P.T.: Expressive languages for path queries over graph-structured data. In: PODS, pp. 3\u201314 (2010)","DOI":"10.1145\/1807085.1807089"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-21064-8_1","volume-title":"The Semanic Web: Research and Applications","author":"C. Buil-Aranda","year":"2011","unstructured":"Buil-Aranda, C., Arenas, M., Corcho, O.: Semantics and Optimization of the SPARQL 1.1 Federation Extension. In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part II. LNCS, vol.\u00a06644, pp. 1\u201315. Springer, Heidelberg (2011)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Buil-Aranda, C., Arenas, M., Corcho, \u00d3., Polleres, A.: Federating queries in SPARQL 1.1: Syntax, semantics and evaluation. Submitted for Journal Publication","DOI":"10.1016\/j.websem.2012.10.001"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. In: PODS, pp. 194\u2013204 (1999)","DOI":"10.1145\/303976.303996"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Carroll, J.J., Dickinson, I., Dollin, C., Reynolds, D., Seaborne, A., Wilkinson, K.: Jena: implementing the semantic web recommendations. In: WWW (Alternate Track Papers & Posters), pp. 74\u201383 (2004)","DOI":"10.1145\/1010432.1010446"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Corby, O., Faron-Zucker, C.: The kgram abstract machine for knowledge graph querying. In: Web Intelligence, pp. 338\u2013341 (2010)","DOI":"10.1109\/WI-IAT.2010.144"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Durst, M., Suignard, M.: Rfc 3987, internationalized resource identifiers (iris) (2005)","DOI":"10.17487\/rfc3987"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1307\/mmj\/1028998975","volume":"10","author":"L.C. Eggan","year":"1963","unstructured":"Eggan, L.C.: Transition graphs and the star-height of regular events. The Michigan Mathematical Journal\u00a010(4), 385\u2013397 (1963)","journal-title":"The Michigan Mathematical Journal"},{"key":"3_CR14","unstructured":"Glimm, B., Ogbuji, C.: Sparql 1.1 entailment regimes (2010)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1071610.1071614","volume":"30","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. TODS\u00a030(2), 444\u2013491 (2005)","journal-title":"TODS"},{"key":"3_CR16","unstructured":"Harris, S., Seaborne, A.: SPARQL 1.1 query language. W3C Working Draft, (January 5, 2012), http:\/\/www.w3.org\/TR\/2012\/WD-sparql11-query-20120105\/"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a05823, pp. 293\u2013309. Springer, Heidelberg (2009)"},{"key":"3_CR18","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":"3_CR19","doi-asserted-by":"crossref","unstructured":"Losemann, K., Martens, W.: The complexity of evaluating path expressions in sparql. In: PODS, pp. 101\u2013112 (2012)","DOI":"10.1145\/2213556.2213573"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/1114244.1114247","volume":"30","author":"M. Marx","year":"2005","unstructured":"Marx, M.: Conditional XPath. TODS\u00a030(4), 929\u2013959 (2005)","journal-title":"TODS"},{"issue":"6","key":"3_CR21","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 J. Comput.\u00a024(6), 1235\u20131258 (1995)","journal-title":"SIAM J. Comput."},{"key":"3_CR22","unstructured":"Olson, M., Ogbuji, U.: The Versa specification, http:\/\/uche.ogbuji.net\/tech\/rdf\/versa\/etc\/versa-1.0.xml"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11926078_3","volume-title":"The Semantic Web - ISWC 2006","author":"J. P\u00e9rez","year":"2006","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: Semantics and Complexity of SPARQL. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol.\u00a04273, pp. 30\u201343. Springer, Heidelberg (2006)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. TODS\u00a034(3) (2009)","DOI":"10.1145\/1567274.1567278"},{"issue":"4","key":"3_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.websem.2010.01.002","volume":"8","author":"J. P\u00e9rez","year":"2010","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: nSPARQL: A navigational language for RDF. JWS\u00a08(4), 255\u2013270 (2010)","journal-title":"JWS"},{"key":"3_CR26","unstructured":"Prud\u2019hommeaux, E., Seaborne, A.: SPARQL query language for RDF (January 2008)"},{"key":"3_CR27","unstructured":"Prud\u2019hommeaux, E., Buil-Aranda, C.: SPARQL 1.1 federated query. W3C Working Draft (November 17, 2011), http:\/\/www.w3.org\/TR\/2011\/+WD-sparql11-federated-query-20111117\/"},{"key":"3_CR28","unstructured":"Prud\u2019hommeaux, E., Seaborne, A.: SPARQL query language for RDF. W3C Recommendation (January 15 (2008), http:\/\/www.w3.org\/TR\/rdf-sparql-query\/"},{"issue":"2","key":"3_CR29","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","volume":"48","author":"A.L. Selman","year":"1994","unstructured":"Selman, A.L.: A taxonomy of complexity classes of functions. J. Comput. Syst. Sci.\u00a048(2), 357\u2013381 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K.W. Wagner","year":"1987","unstructured":"Wagner, K.W.: More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci.\u00a051, 53\u201380 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR33","unstructured":"ARQ, http:\/\/sourceforge.net\/projects\/jena\/files\/ARQ\/"},{"key":"3_CR34","unstructured":"KGRAM, http:\/\/www-sop.inria.fr\/edelweiss\/software\/corese\/"},{"key":"3_CR35","unstructured":"RDF: Query, http:\/\/search.cpan.org\/~gwilliams\/RDF-Query"},{"key":"3_CR36","unstructured":"Sesame, http:\/\/sourceforge.net\/projects\/sesame\/"},{"key":"3_CR37","unstructured":"Psparql, http:\/\/exmo.inrialpes.fr\/software\/psparql\/"},{"key":"3_CR38","unstructured":"RDF data access working group mailing list, http:\/\/lists.w3.org\/Archives\/Public\/public-rdf-dawg-comments\/"},{"key":"3_CR39","unstructured":"Gleen, http:\/\/sig.biostr.washington.edu\/projects\/ontviews\/gleen\/"},{"key":"3_CR40","unstructured":"Semantic Web Client Library, http:\/\/www4.wiwiss.fu-berlin.de\/bizer\/ng4j\/semwebclient\/"}],"container-title":["Lecture Notes in Computer Science","Reasoning Web. Semantic Technologies for Advanced Query Answering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33158-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T23:43:18Z","timestamp":1743982998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33158-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331572","9783642331589"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33158-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}