{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T18:09:35Z","timestamp":1765303775864,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319589428"},{"type":"electronic","value":"9783319589435"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58943-5_43","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T08:42:07Z","timestamp":1495874527000},"page":"532-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Investigations on Path Indexing for Graph Databases"],"prefix":"10.1007","author":[{"given":"Jonathan M.","family":"Sumrall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George H. L.","family":"Fletcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Poulovassilis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Vejlstrup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Vest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"Webber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"43_CR1","unstructured":"Advogato network dataset - KONECT, October 2014. http:\/\/konect.uni-koblenz.de\/networks\/advogato"},{"issue":"1","key":"43_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2627692.2627697","volume":"43","author":"R Angles","year":"2014","unstructured":"Angles, R., et al.: The linked data benchmark council. ACM SIGMOD Rec. 43(1), 27\u201331 (2014). http:\/\/dl.acm.org\/citation.cfm?id=2627692.2627697","journal-title":"ACM SIGMOD Rec."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-6227-6_1","volume-title":"Indexing Techniques for Advanced Database Systems","author":"E Bertino","year":"1997","unstructured":"Bertino, E., et al.: Object-oriented databases. In: Bertino, E., et al. (eds.) Indexing Techniques for Advanced Database Systems, pp. 1\u201338. Kluwer, Alphen aan den Rijn (1997)"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Q., Lim, A., Ong, K.W.: D(k)-index. In: Proceedings of SIGMOD 2003, p. 134. ACM Press, San Diego, June 2003. http:\/\/dl.acm.org\/citation.cfm?id=872757.872776","DOI":"10.1145\/872757.872776"},{"issue":"2","key":"43_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-tree. ACM Comput. Surv. 11(2), 121\u2013137 (1979). http:\/\/dl.acm.org\/citation.cfm?id=356770.356776","journal-title":"ACM Comput. Surv."},{"key":"43_CR6","unstructured":"Cooper, B., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A fast index for semistructured data. In: Proceedings VLDB 2001, pp. 341\u2013350. Morgan Kaufmann Publishers Inc., Roma, September 2001. http:\/\/dl.acm.org\/citation.cfm?id=645927.672202"},{"key":"43_CR7","unstructured":"Fletcher, G.H.L., Peters, J., Poulovassilis, A.: Efficient regular path query evaluation using path indexes. In: Proceedings of EDBT 2016, pp. 636\u2013639 (2016)"},{"key":"43_CR8","unstructured":"Goldman, R., Widom, J.: DataGuides: enabling query formulation and optimization in semistructured databases. In: Proceedings of VLDB 1997, pp. 436\u2013445. Morgan Kaufmann Publishers Inc., Athens, Greece, August 1997. http:\/\/dl.acm.org\/citation.cfm?id=645923.671008"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Then, M.: Graph pattern matching - do we have to reinvent the wheel?. In: Proceedings of GRADES 2014, pp. 1\u20137 (2014)","DOI":"10.1145\/2621934.2621944"},{"issue":"2\u20133","key":"43_CR10","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., et al.: LUBM: a benchmark for OWL knowledge base systems. J. Web Seman. 3(2\u20133), 158\u2013182 (2005)","journal-title":"J. Web Seman."},{"key":"43_CR11","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: Proceedings of ICDE 2002, pp. 129\u2013140. IEEE Computer Society, San Jose (2002). http:\/\/ieeexplore.ieee.org\/lpdocs\/epic03\/wrapper.htm?arnumber=994703"},{"key":"43_CR12","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 \u2014 ICDT\u201999","author":"T Milo","year":"1999","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277\u2013295. Springer, Heidelberg (1999). doi:10.1007\/3-540-49257-7_18"},{"issue":"1","key":"43_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T Neumann","year":"2009","unstructured":"Neumann, T., Weikum, G.: The RDF-3X engine for scalable management of RDF data. VLDB J. 19(1), 91\u2013113 (2009). http:\/\/dl.acm.org\/citation.cfm?id=1731351.1731354","journal-title":"VLDB J."},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of PODS 2002, p. 39. ACM Press, Madison, June 2002. http:\/\/dl.acm.org\/citation.cfm?id=543613.543620","DOI":"10.1145\/543613.543620"},{"key":"43_CR15","unstructured":"Sumrall, J.: Path indexing for efficient path query processing in graph databases. Master\u2019s thesis, Eindhoven University of Technology (2015)"},{"issue":"3","key":"43_CR16","first-page":"277","volume":"9","author":"KF Wong","year":"2006","unstructured":"Wong, K.F., Yu, J.X., Tang, N.: Answering XML queries using path-based indexes: a survey. WWW J. 9(3), 277\u2013299 (2006)","journal-title":"WWW J."},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-1-4419-6045-0_5","volume-title":"Managing and Mining Graph Data","author":"X Yan","year":"2010","unstructured":"Yan, X., Han, J.: Graph indexing. In: Aggarwal, C.C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 161\u2013180. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2016: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58943-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:29:36Z","timestamp":1622161776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58943-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319589428","9783319589435"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58943-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2016.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}