{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:26:41Z","timestamp":1771705601889,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T00:00:00Z","timestamp":1566172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,19]]},"DOI":"10.1145\/3340964.3340978","type":"proceedings-article","created":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T19:51:28Z","timestamp":1565985088000},"page":"90-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["PATHFINDER"],"prefix":"10.1145","author":[{"given":"Stefan","family":"Funke","sequence":"first","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Rupp","sequence":"additional","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nusser","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Storandt","sequence":"additional","affiliation":[{"name":"University of Konstanz"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"O. Cheong, M. v. Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications","author":"M.","year":"2008","unstructured":"M. d. Berg , O. Cheong, M. v. Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications . Springer-Verlag TELOS , 3 rd ed. edition, 2008 . M. d. Berg, O. Cheong, M. v. Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag TELOS, 3rd ed. edition, 2008.","edition":"3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083691"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1361730.1361733"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55998-8_5"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-3-662-48971-0_41","volume-title":"ISAAC","author":"Funke S.","year":"2015","unstructured":"S. Funke and S. Storandt . Provable efficiency of contraction hierarchies with randomized preprocessing . In ISAAC , volume 9472 of Lecture Notes in Computer Science , pages 479 -- 490 . Springer , 2015 . S. Funke and S. Storandt. Provable efficiency of contraction hierarchies with randomized preprocessing. In ISAAC, volume 9472 of Lecture Notes in Computer Science, pages 479--490. Springer, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0152-x"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996972"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666310.2666413"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525333"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2007.05.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0236-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.91"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732940"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661878"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2776927"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743025"}],"event":{"name":"SSTD '19: 16th International Symposium on Spatial and Temporal Databases","location":"Vienna Austria","acronym":"SSTD '19","sponsor":["TU Wien TU Wien"]},"container-title":["Proceedings of the 16th International Symposium on Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340964.3340978","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340964.3340978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:32Z","timestamp":1750202012000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340964.3340978"}},"subtitle":["Storage and Indexing of Massive Trajectory Sets"],"short-title":[],"issued":{"date-parts":[[2019,8,19]]},"references-count":19,"alternative-id":["10.1145\/3340964.3340978","10.1145\/3340964"],"URL":"https:\/\/doi.org\/10.1145\/3340964.3340978","relation":{},"subject":[],"published":{"date-parts":[[2019,8,19]]},"assertion":[{"value":"2019-08-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}