{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:39:41Z","timestamp":1725745181724},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399916"},{"type":"electronic","value":"9783642399923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39992-3_4","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T06:08:18Z","timestamp":1376460498000},"page":"29-30","source":"Crossref","is-referenced-by-count":0,"title":["Counting in SPARQL Property Paths: Perspectives from Theory and Practice"],"prefix":"10.1007","author":[{"given":"Wim","family":"Martens","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","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: World Wide Web Conference (WWW), pp. 629\u2013638 (2012)","DOI":"10.1145\/2187836.2187922"},{"key":"4_CR2","unstructured":"Barcelo, P.: Querying graph databases. In: Symposium on Principles of Database Systems (PODS), Invited tutorial (to appear, 2013)"},{"key":"4_CR3","unstructured":"Harris, S., Seaborne, A., Prud\u2019hommeaux, E.: SPARQL 1.1 query language. Technical report, W3C (January 2012), \n                  \n                    http:\/\/www.w3.org\/TR\/2012\/WD-sparql11-query-20120105\/"},{"key":"4_CR4","unstructured":"Hayes, P., McBride, B.: RDF semantics. Technical report, W3C (February 2004), \n                  \n                    http:\/\/www.w3.org\/TR\/2004\/REC-rdf-mt-20040210\/"},{"key":"4_CR5","unstructured":"Klyne, G., Carroll, J.J., McBride, B.: RDF 1.1 concepts and abstract syntax. Technical report, W3C (January 2013), \n                  \n                    http:\/\/www.w3.org\/TR\/2013\/WD-rdf11-concepts-20130115\/"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Losemann, K., Martens, W.: The complexity of evaluating path expressions in SPARQL. In: Symposium on Principles of Database Systems (PODS), pp. 101\u2013112 (2012)","DOI":"10.1145\/2213556.2213573"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39992-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:36:02Z","timestamp":1558006562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39992-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399916","9783642399923"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39992-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}