{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:10Z","timestamp":1763467930481},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,2,6]],"date-time":"2009-02-06T00:00:00Z","timestamp":1233878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10707-009-0076-5","type":"journal-article","created":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T06:43:31Z","timestamp":1236581011000},"page":"55-82","source":"Crossref","is-referenced-by-count":54,"title":["High-dimensional kNN joins with incremental updates"],"prefix":"10.1007","volume":"14","author":[{"given":"Cui","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaochun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,6]]},"reference":[{"key":"76_CR1","unstructured":"The UCI KDD Archive (1999) KDD Cup 1999 Data. http:\/\/kdd.ics.uci.edu\/databases\/kddcup99\/kddcup99.html ( http:\/\/kdd.ics.uci.edu )"},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kr\u00f6ger P, Kunath P, Pryakhin A, Renz M (2006) Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: SIGMOD\u201906: proceedings of the 2006 ACM SIGMOD international conference on management of data, pp 515\u2013526","DOI":"10.1145\/1142473.1142531"},{"key":"76_CR3","doi-asserted-by":"crossref","unstructured":"Berchtold S, Keim DA (1998) High-dimensional index structures database support for next decade\u2019s applications (tutorial). In: SIGMOD \u201998: proceedings of the 1998 ACM SIGMOD international conference on management of data, p 501","DOI":"10.1145\/276304.276353"},{"key":"76_CR4","doi-asserted-by":"crossref","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful? In: Proceeding of the 7th international conference on database theory (ICDT), pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"3","key":"76_CR5","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3):322\u2013373","journal-title":"ACM Comput Surv"},{"issue":"6","key":"76_CR6","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm C, Krebs F (2004) The k-nearest neighbor join: turbo charging the kdd process. Knowl Inf Syst (KAIS) 6(6):728\u2013749","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"76_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Kriegel H-P (2000) Dynamically optimizing high-dimensional index structures. In: Proceedings of the 7th international conference on extending database technology (EDBT), pp 36\u201350","DOI":"10.1007\/3-540-46439-5_3"},{"key":"76_CR8","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: VLDB \u201997: proceedings of the 23rd international conference on very large data bases, pp 426\u2013435"},{"key":"76_CR9","volume-title":"Nearest neighbor (nn) norms - nn pattern classification techniques","author":"BV Dasarathy","year":"1991","unstructured":"Dasarathy BV (1991) Nearest neighbor (nn) norms - nn pattern classification techniques. IEEE Computer Society, Silver Spring"},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD \u201984: proceedings of the 1984 ACM SIGMOD international conference on management of data, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"76_CR11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"J Hartigan","year":"1979","unstructured":"Hartigan J, Wong M (1979) A K-means clustering algorithm. Appl Stat 28:100\u2013108","journal-title":"Appl Stat"},{"key":"76_CR12","doi-asserted-by":"crossref","unstructured":"Huang X, Jensen CS, Saltenis S (2006) Multiple k nearest neighbor query processing in spatial network databases. In: ADBIS \u201906: proceedings of 10th East European conference of advances in databases and information systems, pp 266\u2013281","DOI":"10.1007\/11827252_21"},{"issue":"2","key":"76_CR13","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan K-L, Yu C, Zhang R (2005) iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst (TODS) 30(2):364\u2013397","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Korn F, Muthukrishnan S (2000) Influence sets based on reverse nearest neighbor queries. In: SIGMOD \u201900: proceedings of the 2000 ACM SIGMOD international conference on management of data, pp 201\u2013212","DOI":"10.1145\/342009.335415"},{"key":"76_CR15","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K-I Lin","year":"1994","unstructured":"Lin K-I, Jagadish HV, Faloutsos C (1994) The TV-tree: an index structure for high-dimensional data. VLDB J 3:517\u2013542","journal-title":"VLDB J"},{"issue":"5","key":"76_CR16","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/69.877502","volume":"12","author":"D Rafiei","year":"2000","unstructured":"Rafiei D, Mendelzon A (2000) Querying time series data based on similarity. IEEE Trans Knowl Data Eng 12(5):675\u2013693","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"76_CR17","unstructured":"Tao Y, Papadias D, Lian X (2004) Reverse knn search in arbitrary dimensionality. In: VLDB \u201904: Proceedings of the 30th international conference on very large data bases, pp 744\u2013755"},{"issue":"9","key":"76_CR18","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1109\/TKDE.2006.148","volume":"18","author":"Y Tao","year":"2006","unstructured":"Tao Y, Yiu, ML, Mamoulis N (2006) Reverse nearest neighbor search in metric spaces. IEEE Trans Knowl Data Eng 18(9):1239\u20131252","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"76_CR19","unstructured":"Weber R, Schek H, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB \u201998: proceedings of the 24rd international conference on very large data bases, pp 194\u2013205"},{"key":"76_CR20","unstructured":"Wong R, Tao Y, Fu A, Xiao X, Pryakhin A, Renz M (2007) On efficient spatial matching. In: VLDB \u201907: proceedings of the 33rd international conference on very large data bases, pp 579\u2013590"},{"key":"76_CR21","unstructured":"Xia C, Lu H, Ooi BC, Hu J (2004) Gorder: an efficient method for knn join processing. In: VLDB \u201904: proceedings of the 30th international conference on very large data bases, pp 756\u2013767"},{"key":"76_CR22","doi-asserted-by":"crossref","unstructured":"Yang C, Lin K (2001) An index structure for efficient reverse nearest neighbor queries In: Proceedings of the 17th international conference on data engineering (ICDE), pp 485\u2013492","DOI":"10.1109\/ICDE.2001.914862"},{"issue":"4","key":"76_CR23","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","volume":"49","author":"C Yu","year":"2007","unstructured":"Yu C, Cui B, Wang S, Su J (2007) Efficient index-based knn join processing for high-dimensional data. Inf Softw Technol 49(4):332\u2013344","journal-title":"Inf Softw Technol"},{"key":"76_CR24","unstructured":"Yu C, Ooi BC, Tan K-L, Jagadish HV (2001) Indexing the distance: an efficient method to knn processing. In: VLDB \u201901: proceedings of the 27th international conference on very large data bases, pp 166\u2013174"},{"key":"76_CR25","doi-asserted-by":"crossref","unstructured":"Zhang R, Koudas N, Ooi BC, Srivastava D (2005) Multiple aggregations over data streams. In: SIGMOD \u201905: proceedings of the 2005 ACM SIGMOD international conference on management of data, pp 299\u2013310","DOI":"10.1145\/1066157.1066192"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-009-0076-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-009-0076-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-009-0076-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:16:58Z","timestamp":1559240218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-009-0076-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1007\/s10707-009-0076-5","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,6]]}}}