{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:56:16Z","timestamp":1775638576877,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100013290","name":"National Key Research and Development Program of China Stem Cell and Translational Research","doi-asserted-by":"publisher","award":["2018YFB1003504"],"award-info":[{"award-number":["2018YFB1003504"]}],"id":[{"id":"10.13039\/501100013290","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Australian Research Council","award":["DP160101513,FT180100256,DP180103096,FT170100128,DP170101628"],"award-info":[{"award-number":["DP160101513,FT180100256,DP180103096,FT170100128,DP170101628"]}]},{"name":"Search Results Web results National Natural Science Foundation","award":["NSFC61232006"],"award-info":[{"award-number":["NSFC61232006"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389746","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"1781-1795","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Progressive Top-K Nearest Neighbors Search in Large Road Networks"],"prefix":"10.1145","author":[{"given":"Dian","family":"Ouyang","sequence":"first","affiliation":[{"name":"University of Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms . MIT press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT press, 2009."},{"key":"e_1_3_2_2_2_1","first-page":"25","volume-title":"11th International Symposium, SSTD 2009, Aalborg, Denmark, July 8--10, 2009","author":"Demiryurek U.","year":"2009","unstructured":"U. Demiryurek , F. B. Kashani , and C. Shahabi . Efficient continuous nearest neighbor query in spatial networks using euclidean restriction. In Advances in Spatial and Temporal Databases , 11th International Symposium, SSTD 2009, Aalborg, Denmark, July 8--10, 2009 , Proceedings , pages 25 -- 43 , 2009 . U. Demiryurek, F. B. Kashani, and C. Shahabi. Efficient continuous nearest neighbor query in spatial networks using euclidean restriction. In Advances in Spatial and Temporal Databases, 11th International Symposium, SSTD 2009, Aalborg, Denmark, July 8--10, 2009, Proceedings, pages 25--43, 2009."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788912"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917434"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00118"},{"key":"e_1_3_2_2_7_1","unstructured":"C. S. Jensen D. Lin and B. C. Ooi. Query and update efficient b  C. S. Jensen D. Lin and B. C. Ooi. Query and update efficient b"},{"key":"e_1_3_2_2_8_1","first-page":"768","volume-title":"VLDB 2004","author":"Jensen C. S.","year":"2004","unstructured":"C. S. Jensen , D. Lin , and B. C. Ooi based indexing of moving objects. In (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases , VLDB 2004 , Toronto, Canada, August 31 - September 3 2004 , pages 768 -- 779 , 2004. -tree based indexing of moving objects. In (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31 - September 3 2004, pages 768--779, 2004."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(05)80078-2"},{"issue":"5","key":"e_1_3_2_2_11_1","first-page":"594","article-title":"Toain: a throughput optimizing adaptive index for answering dynamic knn queries on road networks","volume":"11","author":"Luo S.","year":"2018","unstructured":"S. Luo , B. Kao , G. Li , J. Hu , R. Cheng , and Y. Zheng . Toain: a throughput optimizing adaptive index for answering dynamic knn queries on road networks . PVLDB , 11 ( 5 ): 594 -- 606 , 2018 . S. Luo, B. Kao, G. Li, J. Hu, R. Cheng, and Y. Zheng. Toain: a throughput optimizing adaptive index for answering dynamic knn queries on road networks. PVLDB, 11(5):594--606, 2018.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007638"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2009.14"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35973-1_618"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.115"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213842"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-61350-053-8.ch009"},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5--8","author":"Xiong X.","year":"2005","unstructured":"X. Xiong , M. F. Mokbel , and W. G. Aref . SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases . In Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5--8 April 2005 , Tokyo, Japan, pages 643--654 , 2005. X. Xiong, M. F. Mokbel, and W. G. Aref. SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5--8 April 2005, Tokyo, Japan, pages 643--654, 2005."},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5--8","author":"Yu X.","year":"2005","unstructured":"X. Yu , K. Q. Pu , and N. Koudas . Monitoring k-nearest neighbor queries over moving objects . In Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5--8 April 2005 , Tokyo, Japan, pages 631--642 , 2005. X. Yu, K. Q. Pu, and N. Koudas. Monitoring k-nearest neighbor queries over moving objects. In Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, 5--8 April 2005, Tokyo, Japan, pages 631--642, 2005."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0146-0"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399306"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389746","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:44Z","timestamp":1750199924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":23,"alternative-id":["10.1145\/3318464.3389746","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389746","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}