{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:42Z","timestamp":1750307622499,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T00:00:00Z","timestamp":1225843200000},"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":[[2008,11,5]]},"DOI":"10.1145\/1463434.1463484","type":"proceedings-article","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T00:11:33Z","timestamp":1228349493000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Dual-heap\n            <i>k<\/i>\n            NN"],"prefix":"10.1145","author":[{"given":"Hideki","family":"Hayashi","sequence":"first","affiliation":[{"name":"Central Research Laboratory, Kokubunji-shi, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daisuke","family":"Ito","sequence":"additional","affiliation":[{"name":"Central Research Laboratory, Kokubunji-shi, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaaki","family":"Tanizaki","sequence":"additional","affiliation":[{"name":"Central Research Laboratory, Kokubunji-shi, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohji","family":"Kimura","sequence":"additional","affiliation":[{"name":"Hitachi, Ltd., Totsuka, Yokohama, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisanori","family":"Kajiyama","sequence":"additional","affiliation":[{"name":"Hitachi, Software Engineering Co., Ltd., Totsuka, Yokohama, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Hitachi Ltd. Entier Embedded Database URL: http:\/\/www.hitachi.us\/Apps\/hitachicom\/content.jsp?page=index.html&path=jsp\/hitachi\/forbus\/entier\/.  Hitachi Ltd. Entier Embedded Database URL: http:\/\/www.hitachi.us\/Apps\/hitachicom\/content.jsp?page=index.html&path=jsp\/hitachi\/forbus\/entier\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Oracle Oracle Database Lite 10g URL: http:\/\/www.oracle.com\/technology\/products\/lite\/index.html.  Oracle Oracle Database Lite 10g URL: http:\/\/www.oracle.com\/technology\/products\/lite\/index.html."},{"key":"e_1_3_2_1_3_1","unstructured":"IBM DB2 Everyplace URL: http:\/\/www-306.ibm.com\/software\/data\/db2\/everyplace\/.  IBM DB2 Everyplace URL: http:\/\/www-306.ibm.com\/software\/data\/db2\/everyplace\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.15"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"H. Samet \"The Design and Analysis of Spatial Data Structures \" Addison-Wesley series (1990).   H. Samet \"The Design and Analysis of Spatial Data Structures \" Addison-Wesley series (1990).","DOI":"10.1007\/3-540-52208-5_28"},{"key":"e_1_3_2_1_10_1","first-page":"79","author":"Song Z.","year":"2001","journal-title":"\"K-Nearest Neighbor Search for Moving Query Point,\" Proc. of Int'l Symp. on Advances in Spatial and Temporal Databases"},{"key":"e_1_3_2_1_11_1","first-page":"287","author":"Tao Y.","year":"2002","journal-title":"\"Continuous Nearest Neighbor Search,\" Proc. of Int'l Conf. on VLDB"},{"key":"e_1_3_2_1_12_1","first-page":"516","author":"White D. A.","year":"1996","journal-title":"\"Similarity Indexing with the SS-tree,\" Proc. of Int'l Conf. on Data Engineering (ICDE'96)"}],"event":{"name":"GIS '08: 16th International Symposium on Advances in Geographic Information Systems","sponsor":["ESRI","Google Inc.","Oak Ridge National Laboratory","Microsoft Microsoft","SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Irvine California","acronym":"GIS '08"},"container-title":["Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1463434.1463484","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1463434.1463484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:51Z","timestamp":1750250751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1463434.1463484"}},"subtitle":["<i>k<\/i>\n            -nearest neighbor search for spatial data retrieval in embedded DBMS"],"short-title":[],"issued":{"date-parts":[[2008,11,5]]},"references-count":12,"alternative-id":["10.1145\/1463434.1463484","10.1145\/1463434"],"URL":"https:\/\/doi.org\/10.1145\/1463434.1463484","relation":{},"subject":[],"published":{"date-parts":[[2008,11,5]]},"assertion":[{"value":"2008-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}