{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:14:33Z","timestamp":1740100473913,"version":"3.37.3"},"reference-count":6,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,15]]},"DOI":"10.1109\/bigdata52589.2021.9671654","type":"proceedings-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T20:39:16Z","timestamp":1642106356000},"page":"6006-6007","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Learned Index for A Higher Recall Trajectory K-Nearest Neighbor Search"],"prefix":"10.1109","author":[{"given":"Hani","family":"Ramadhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joonho","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6226-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9377839"},{"key":"ref6","article-title":"Computing discrete fréchet distance","author":"eiter","year":"1994","journal-title":"Citeseer Tech Rep"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1018628609742","article-title":"Least squares support vector machine classifiers","volume":"9","author":"suykens","year":"1999","journal-title":"Neural Process Lett"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380579"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-89657-7_8"}],"event":{"name":"2021 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2021,12,15]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2021,12,18]]}},"container-title":["2021 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9671263\/9671273\/09671654.pdf?arnumber=9671654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:36Z","timestamp":1652201736000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9671654\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1109\/bigdata52589.2021.9671654","relation":{},"subject":[],"published":{"date-parts":[[2021,12,15]]}}}