{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:52Z","timestamp":1742913292859,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029813"},{"type":"electronic","value":"9783642029820"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02982-0_18","type":"book-chapter","created":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T01:31:51Z","timestamp":1246239111000},"page":"265-282","source":"Crossref","is-referenced-by-count":15,"title":["Incremental Reverse Nearest Neighbor Ranking in Vector Spaces"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Emrich","sequence":"first","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with a multi-resolution tree structure. In: Proc. SIGMOD (2001)","DOI":"10.1145\/375663.375718"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-47724-1_23","volume-title":"Advances in Spatial and Temporal Databases","author":"D. Papadias","year":"2001","unstructured":"Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, p. 443. Springer, Heidelberg (2001)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influenced sets based on reverse nearest neighbor queries. In: Proc. SIGMOD (2000)","DOI":"10.1145\/342009.335415"},{"key":"18_CR4","unstructured":"Yang, C., Lin, K.I.: An index structure for efficient reverse nearest neighbor queries. In: Proc. ICDE (2001)"},{"key":"18_CR5","unstructured":"Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: Proc. DMKD (2000)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Singh, A., Ferhatosmanoglu, H., Tosun, A.S.: High dimensional reverse nearest neighbor queries. In: Proc. CIKM (2003)","DOI":"10.1145\/956863.956882"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality. In: Proc. VLDB (2004)","DOI":"10.1016\/B978-012088469-8\/50066-8"},{"issue":"7","key":"18_CR8","first-page":"894","volume":"20","author":"K.C.K. Lee","year":"2008","unstructured":"Lee, K.C.K., Zheng, B., Lee, W.C.: Ranked reverse nearest neighbor search. IEEE TKDE\u00a020(7), 894\u2013910 (2008)","journal-title":"IEEE TKDE"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: Proc. SIGMOD (2006)","DOI":"10.1145\/1142473.1142531"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Approximate reverse k-nearest neighbor search in general metric spaces. In: Proc. CIKM (2006)","DOI":"10.1145\/1183614.1183731"},{"issue":"9","key":"18_CR11","first-page":"1239","volume":"18","author":"Y. Tao","year":"2006","unstructured":"Tao, Y., Yiu, M.L., Mamoulis, N.: Reverse nearest neighbor search in metric spaces. IEEE TKDE\u00a018(9), 1239\u20131252 (2006)","journal-title":"IEEE TKDE"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An efficient and robust access method for points and rectangles. In: Proc. SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"18_CR14","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-Tree: An index structure for high-dimensional data. In: Proc. VLDB (1996)"},{"key":"18_CR15","unstructured":"Hettich, S., Bay, S.D.: The uci kdd archive (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02982-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:57:59Z","timestamp":1558396679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02982-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029813","9783642029820"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02982-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}