{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:05:29Z","timestamp":1758269129216},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,20]],"date-time":"2005-12-20T00:00:00Z","timestamp":1135036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2007,5,16]]},"DOI":"10.1007\/s00778-005-0168-2","type":"journal-article","created":{"date-parts":[[2005,12,21]],"date-time":"2005-12-21T09:37:52Z","timestamp":1135157872000},"page":"293-316","source":"Crossref","is-referenced-by-count":62,"title":["Multidimensional reverse kNN search"],"prefix":"10.1007","volume":"16","author":[{"given":"Yufei","family":"Tao","sequence":"first","affiliation":[]},{"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Lian","sequence":"additional","affiliation":[]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,12,20]]},"reference":[{"key":"168_CR1","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: SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"168_CR2","doi-asserted-by":"crossref","unstructured":"Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: IDEAS, pp. 44\u201353 (2002)","DOI":"10.1109\/IDEAS.2002.1029655"},{"key":"168_CR3","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for high-dimensional data. In: VLDB, pp. 28\u201339 (1996)"},{"key":"168_CR4","doi-asserted-by":"crossref","unstructured":"Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer (2000)","DOI":"10.1007\/978-3-662-04245-8"},{"issue":"3","key":"168_CR5","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K.L. Cheung","year":"1998","unstructured":"Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. SIGMOD Record 27(3), 16\u201321 (1998)","journal-title":"SIGMOD Record"},{"key":"168_CR6","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.E.: Constrained nearest neighbor queries. In: SSTD, pp. 257\u2013278 (2001)","DOI":"10.1007\/3-540-47724-1_14"},{"key":"168_CR7","doi-asserted-by":"crossref","unstructured":"Goldstein, J., Ramakrishnan, R., Shaft, U., Yu, J.-B.: Processing queries by linear constraints. In: PODS, pp. 257\u2013267 (1997)","DOI":"10.1145\/263661.263689"},{"key":"168_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"168_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Goldstein, H.: Distance browsing in spatial databases. TODS 24(2), 265\u2013318 (1999)","journal-title":"TODS"},{"key":"168_CR10","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201\u2013212 (2000)","DOI":"10.1145\/342009.335415"},{"key":"168_CR11","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: VLDB, pp. 814\u2013825 (2002)","DOI":"10.1016\/B978-155860869-6\/50077-9"},{"key":"168_CR12","unstructured":"Lin, K.-I., Nolen, M., Yang, C.: Applying bulk insertion techniques for dynamic reverse nearest neighbor prob lems. In: IDEAS, pp. 290\u2013297 (2003)"},{"key":"168_CR13","unstructured":"Maheshwari, A., Vahrenhold, J., Zeh, N.: On reverse nearest neighbor queries. In: CCCG, pp. 128\u2013132 (2002)"},{"key":"168_CR14","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"168_CR15","doi-asserted-by":"crossref","unstructured":"Singh, A., Ferhatosmanoglu, H., Tosun, A.S.: High dimensional reverse nearest neighbor queries. In: CIKM, pp. 91\u201398 (2003)","DOI":"10.1145\/956863.956882"},{"key":"168_CR16","unstructured":"Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD workshop, pp. 744\u2013755 (2000)"},{"key":"168_CR17","unstructured":"Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: VLDB, pp. 99\u2013108 (2001)"},{"key":"168_CR18","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Lian, X.: Reverse knn search in arbitrary dimensionality. In: VLDB, pp. 744\u2013755 (2004)","DOI":"10.1016\/B978-012088469-8.50066-8"},{"key":"168_CR19","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y. Sellis, T.K.: A model for the prediction of R-tree performance. In: PODS, pp. 161\u2013171 (1996)","DOI":"10.1145\/237661.237705"},{"key":"168_CR20","unstructured":"Yang, C., Lin, K.-I.: An index structure for efficient reverse nearest neighbor queries. In: ICDE, pp. 485\u2013492 (2001)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0168-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-005-0168-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0168-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T18:09:03Z","timestamp":1586628543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-005-0168-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,20]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5,16]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s00778-005-0168-2","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,20]]}}}