{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:55:53Z","timestamp":1765356953420,"version":"3.37.3"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/icde51399.2021.00067","type":"proceedings-article","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T20:21:20Z","timestamp":1624393280000},"page":"708-719","source":"Crossref","is-referenced-by-count":16,"title":["REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries"],"prefix":"10.1109","author":[{"given":"Bolong","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Lianggui","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Xi","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"220","article-title":"T-drive: Enhancing driving directions with taxi drivers’ intelligence","volume":"25","author":"yuan","year":"2013","journal-title":"TKDE"},{"key":"ref32","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"1993","journal-title":"SODA"},{"key":"ref31","first-page":"201","article-title":"Efficient retrieval of similar time sequences under time warping","author":"yi","year":"1998","journal-title":"ICDE"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1504\/IJKESDP.2010.030466"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3371316.3371335"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2030112.2030127"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.55"},{"key":"ref34","first-page":"15","article-title":"Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing","author":"zaharia","year":"2012","journal-title":"NSDI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.244"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2008.25"},{"key":"ref12","first-page":"37:1","article-title":"Locality-sensitive hashing of curves","author":"driemel","year":"2017","journal-title":"SoCG LIPIcs"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/191843.191925"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367927"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/PL00010672"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50043-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463513"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SSDBM.2006.19"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183743"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137655"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1097064.1097091"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623656"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1071246.1071259"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115411"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2880215"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00065-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066213"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274943"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24587-2_40"},{"key":"ref1","first-page":"75","article-title":"Computing the fréchet distance between two polygonal curves","volume":"5","author":"alt","year":"1995","journal-title":"IJCGA"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359599"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00574-9"},{"key":"ref21","article-title":"Pm-tree: Pivoting metric tree for similarity search in multimedia databases","author":"skopal","year":"2004","journal-title":"ADBIS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2651821"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956777"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994784"}],"event":{"name":"2021 IEEE 37th International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2021,4,19]]},"location":"Chania, Greece","end":{"date-parts":[[2021,4,22]]}},"container-title":["2021 IEEE 37th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9458599\/9458600\/09458807.pdf?arnumber=9458807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:42:41Z","timestamp":1652197361000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9458807\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icde51399.2021.00067","relation":{},"subject":[],"published":{"date-parts":[[2021,4]]}}}