{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T16:39:17Z","timestamp":1786120757767,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770855.3817711","type":"proceedings-article","created":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:08:33Z","timestamp":1786064913000},"page":"6152-6163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient and Accurate Grid Compression Solution for Point-to-Line Nearest Neighbor Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9573-8691","authenticated-orcid":false,"given":"Hongwei","family":"Ye","sequence":"first","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5851-7967","authenticated-orcid":false,"given":"Tsz Nam","family":"Chan","sequence":"additional","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7901-9876","authenticated-orcid":false,"given":"Dingming","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5135-5165","authenticated-orcid":false,"given":"Leong Hou","family":"U","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, University of Macau, Macau, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0745-5158","authenticated-orcid":false,"given":"Ruisheng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Architecture and Urban Planning, Shenzhen University, Shenzhen, Guangdong Province, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. ArcGIS. https:\/\/www.arcgis.com\/index.html."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. Chicago 311 Service Requests. https:\/\/data.cityofchicago.org\/Service-Requests\/311-Service-Requests\/v6vf-nfxy\/about_data."},{"key":"e_1_3_2_1_3_1","unstructured":"[n.d.]. Chicago Crimes - 2001 to Present. https:\/\/data.cityofchicago.org\/Public-Safety\/Crimes-2001-to-Present\/ijzp-q8t2\/about_data."},{"key":"e_1_3_2_1_4_1","unstructured":"[n.d.]. Chicago Data Protal. https:\/\/data.cityofchicago.org\/Public-Safety\/Crimes-2001-to-Present\/ijzp-q8t2\/about_data."},{"key":"e_1_3_2_1_5_1","unstructured":"[n.d.]. Citi Bike Trip Histories. https:\/\/citibikenyc.com\/system-data."},{"key":"e_1_3_2_1_6_1","unstructured":"[n.d.]. FastNSA. https:\/\/pypi.org\/project\/fastnsa\/."},{"key":"e_1_3_2_1_7_1","unstructured":"[n.d.]. NYC Yellow Taxi Trip Data. https:\/\/www.kaggle.com\/datasets\/elemento\/nyc-yellow-taxi-trip-data."},{"key":"e_1_3_2_1_8_1","unstructured":"[n.d.]. PostGIS. https:\/\/postgis.net\/."},{"key":"e_1_3_2_1_9_1","unstructured":"[n.d.]. QGIS. https:\/\/qgis.org\/."},{"key":"e_1_3_2_1_10_1","unstructured":"[n.d.]. San Francisco Data Portal. https:\/\/data.sfgov.org\/Public-Safety\/Fire-Department-and-Emergency-Medical-Services-Dis\/nuek-vuh3\/about_data."},{"key":"e_1_3_2_1_11_1","unstructured":"[n.d.]. spNetwork: Spatial Analysis on Network - R Project. https:\/\/cran.r-project.org\/web\/packages\/spNetwork\/spNetwork.pdf."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347116"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00778-022-00759-9"},{"key":"e_1_3_2_1_14_1","volume-title":"Elementary Linear Algebra","author":"Anton H.","unstructured":"H. Anton. 2010. Elementary Linear Algebra. John Wiley & Sons."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196976"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spasta.2020.100435"},{"key":"e_1_3_2_1_17_1","first-page":"322","article-title":"The R*-Tree","author":"Beckmann Norbert","year":"1990","unstructured":"Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. 1990. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD. 322-331.","journal-title":"In SIGMOD."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2017.05.004"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428537"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461540"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551836"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3648160.3648168"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3725346"},{"key":"e_1_3_2_1_25_1","first-page":"426","article-title":"M-tree","author":"Ciaccia Paolo","year":"1997","unstructured":"Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB. 426-435.","journal-title":"In VLDB."},{"key":"e_1_3_2_1_26_1","volume-title":"Marc Van Kreveld, and Mark Overmars","author":"Berg Mark De","year":"2008","unstructured":"Mark De Berg, Otfried Cheong, Marc Van Kreveld, and Mark Overmars. 2008. Computational geometry: algorithms and applications. Springer."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/tgis.13035"},{"key":"e_1_3_2_1_28_1","first-page":"47","article-title":"R-Trees","author":"Guttman Antonin","year":"1984","unstructured":"Antonin Guttman. 1984. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD. 47-57.","journal-title":"A Dynamic Index Structure for Spatial Searching. In SIGMOD."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457240"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00040"},{"key":"e_1_3_2_1_31_1","first-page":"928","article-title":"Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning. In NIPS. Curran Associates","author":"Jain Prateek","year":"2010","unstructured":"Prateek Jain, Sudheendra Vijayanarasimhan, and Kristen Grauman. 2010. Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning. In NIPS. Curran Associates, Inc., 928-936. https:\/\/proceedings.neurips.cc\/paper\/2010\/hash\/470e7a4f017a5476afb7eeb3f8b96f9b-Abstract.html","journal-title":"Inc."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3550486"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3704918"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1997.582015"},{"key":"e_1_3_2_1_35_1","unstructured":"Wei Liu Jun Wang Yadong Mu Sanjiv Kumar and Shih-Fu Chang. 2012. Compact Hyperplane Hashing with Bilinear Functions. In ICML. icml.cc \/ Omnipress. http:\/\/icml.cc\/2012\/papers\/16.pdf"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339637"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.553"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3287739"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aap.2025.108357"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574269"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2346496.2346515"},{"key":"e_1_3_2_1_42_1","first-page":"397","article-title":"The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data","author":"Moore Andrew W.","year":"2000","unstructured":"Andrew W. Moore. 2000. The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In UAI. 397-405.","journal-title":"UAI."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653818"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"A. Okabe and K. Sugihara. 2012. Spatial Analysis Along Networks: Statistical and Computational Methods. Wiley. https:\/\/books.google.com.hk\/books?id=48GRqj51_W8C","DOI":"10.1002\/9781119967101"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.877506"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aap.2024.107699"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2007.05.002"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467238"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10940-016-9321-x"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_3_2_1_51_1","unstructured":"H. Samet. 2006. Foundations of Multidimensional and Metric Data Structures."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00187"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3359384"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653805"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00778-014-0353-2"},{"key":"e_1_3_2_1_56_1","volume-title":"Elementary real analysis","author":"Thomson Brian S","unstructured":"Brian S Thomson, Judith B Bruckner, and Andrew M Bruckner. 2008. Elementary real analysis. Vol. 1. ClassicalRealAnalysis.com."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE65448.2025.00034"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.121"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2018.04.005"},{"key":"e_1_3_2_1_60_1","first-page":"194","article-title":"A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces","author":"Weber Roger","year":"1998","unstructured":"Roger Weber, Hans-J\u00f6rg Schek, and Stephen Blott. 1998. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In VLDB. 194-205.","journal-title":"VLDB."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339562"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2008.05.001"},{"key":"e_1_3_2_1_63_1","volume-title":"Dingming Wu, Leong Hou U, and Ruisheng Wang.","author":"Ye Hongwei","year":"2026","unstructured":"Hongwei Ye, Tsz Nam Chan, Dingming Wu, Leong Hou U, and Ruisheng Wang. 2026. Supplementary Material for ''An Efficient and Accurate Grid Compression Solution for Point-to-Line Nearest Neighbor Search''. https:\/\/github.com\/fastnsa\/grid-comp-plnns\/blob\/main\/supplementary_material.pdf."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtrangeo.2015.04.008"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3402904"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3359090"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00778-004-0146-0"}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:11:23Z","timestamp":1786065083000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770855.3817711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,8]]},"references-count":68,"alternative-id":["10.1145\/3770855.3817711","10.1145\/3770855"],"URL":"https:\/\/doi.org\/10.1145\/3770855.3817711","relation":{},"subject":[],"published":{"date-parts":[[2026,8,8]]},"assertion":[{"value":"2026-08-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}