{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:39Z","timestamp":1759683759747},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T00:00:00Z","timestamp":1180569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Forsch. Entw."],"published-print":{"date-parts":[[2007,6,6]]},"DOI":"10.1007\/s00450-007-0027-z","type":"journal-article","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T05:12:56Z","timestamp":1180501976000},"page":"179-195","source":"Crossref","is-referenced-by-count":14,"title":["Efficient reverse k-nearest neighbor estimation"],"prefix":"10.1007","volume":"21","author":[{"given":"Elke","family":"Achtert","sequence":"first","affiliation":[]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Kunath","sequence":"additional","affiliation":[]},{"given":"Alexey","family":"Pryakhin","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,31]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kr\u00f6ger P, Kunath P, Pryakhin A, Renz M (2006) Approximate reverse k-nearest neighbor queries in general metric spaces. Proc CIKM","DOI":"10.1145\/1183614.1183731"},{"key":"27_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. Proc. SIGMOD","DOI":"10.1145\/1142473.1142531"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kr\u00f6ger P, Kunath P, Pryakhin A, Renz M (2007) Efficient reverse k-nearest neighbor estimation. Proc. BTW","DOI":"10.1007\/s00450-007-0027-z"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R\u2217-Tree: An efficient and robust access method for points and rectangles. In: Proc. SIGMOD, pp. 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"27_CR5","unstructured":"Berchtold S, Keim DA, Kriegel HP (1996) The X-Tree: An index structure for high-dimensional data. In: Proc. VLDB"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-Tree: an efficient access method for similarity search in metric spaces. In: Proc. VLDB","DOI":"10.1145\/275487.275495"},{"key":"27_CR7","unstructured":"Peng CDH (2003) Minimum redundancy feature selection from microarray gene expression data. In: CSB03"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-Trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD, pp. 47\u201357","DOI":"10.1145\/971697.602266"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Korn F, Muthukrishnan S (2000) In: Fluenced sets based on reverse nearest neighbor queries. In: Proc. SIGMOD","DOI":"10.1145\/342009.335415"},{"key":"27_CR10","volume-title":"Fractals, Chaos, Power Laws: Minutes from an infinite paradise. W.H","author":"M Schroeder","year":"1991","unstructured":"Schroeder M (1991) Fractals, Chaos, Power Laws: Minutes from an infinite paradise. W.H. Freeman and company, New York"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Singh A (2003) Ferhatosmanoglu H, Tosun AS, High dimensional reverse nearest neighbor queries. In: Proc. CIKM","DOI":"10.1145\/956880.956882"},{"key":"27_CR12","unstructured":"Stanoi I, Agrawal D, El Abbadi A (2000) Reverse nearest neighbor queries for dynamic databases. In: Proc. DMKD"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Lian X (2004) Reverse kNN search in arbitrary dimensionality. In: Proc. VLDB","DOI":"10.1016\/B978-012088469-8.50066-8"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Xia C, Lu H, Ooi BC, Hu J (2005) Erknn: Efficient reverse k-nearest neighbors retrieval with local knn-distance estimation. In: Proc. CIKM","DOI":"10.1145\/1099554.1099697"},{"key":"27_CR15","unstructured":"Yang C, Lin KI (2001) An index structure for efficient reverse nearest neighbor queries. In: Proc. ICDE"}],"container-title":["Informatik - Forschung und Entwicklung"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-007-0027-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00450-007-0027-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-007-0027-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:32:44Z","timestamp":1559136764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-007-0027-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,31]]},"references-count":15,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2007,6,6]]}},"alternative-id":["27"],"URL":"https:\/\/doi.org\/10.1007\/s00450-007-0027-z","relation":{},"ISSN":["0178-3564","0949-2925"],"issn-type":[{"value":"0178-3564","type":"print"},{"value":"0949-2925","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,31]]}}}