{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:04:48Z","timestamp":1743138288497,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022784"},{"type":"electronic","value":"9783642022791"}],"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-02279-1_32","type":"book-chapter","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T02:51:59Z","timestamp":1242787919000},"page":"444-460","source":"Crossref","is-referenced-by-count":5,"title":["Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods"],"prefix":"10.1007","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Katzdobler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality. In: Proc. VLDB (2004)","key":"32_CR1","DOI":"10.1016\/B978-012088469-8\/50066-8"},{"doi-asserted-by":"crossref","unstructured":"Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with a multi-resolution tree structure. In: Proc. SIGMOD (2001)","key":"32_CR2","DOI":"10.1145\/375663.375718"},{"doi-asserted-by":"crossref","unstructured":"Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient olap operations in spatial data warehouses. In: Proc. SSTD (2001)","key":"32_CR3","DOI":"10.1007\/3-540-47724-1_23"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD, pp. 47\u201357 (1984)","key":"32_CR4","DOI":"10.1145\/602259.602266"},{"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)","key":"32_CR5","DOI":"10.1145\/93597.98741"},{"doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00e4hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: Proc. SIGMOD (2006)","key":"32_CR6","DOI":"10.1145\/1142473.1142531"},{"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)","key":"32_CR7","DOI":"10.1145\/1183614.1183731"},{"doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor estimation. In: Proc. BTW (2007)","key":"32_CR8","DOI":"10.1007\/s00450-007-0027-z"},{"issue":"9","key":"32_CR9","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"},{"doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influenced sets based on reverse nearest neighbor queries. In: Proc. SIGMOD (2000)","key":"32_CR10","DOI":"10.1145\/342009.335415"},{"unstructured":"Yang, C., Lin, K.I.: An index structure for efficient reverse nearest neighbor queries. In: Proc. ICDE (2001)","key":"32_CR11"},{"doi-asserted-by":"crossref","unstructured":"Singh, A., Ferhatosmanoglu, H., Tosun, A.S.: High dimensional reverse nearest neighbor queries. In: Proc. CIKM (2003)","key":"32_CR12","DOI":"10.1145\/956863.956882"},{"unstructured":"Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: Proc. DMKD (2000)","key":"32_CR13"},{"unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-Tree: An index structure for high-dimensional data. In: Proc. VLDB (1996)","key":"32_CR14"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02279-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:05:34Z","timestamp":1558321534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02279-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022784","9783642022791"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02279-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}