{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:50:38Z","timestamp":1767707438601},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,8,23]],"date-time":"2012-08-23T00:00:00Z","timestamp":1345680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10115-012-0527-4","type":"journal-article","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T06:07:21Z","timestamp":1345615641000},"page":"23-58","source":"Crossref","is-referenced-by-count":31,"title":["A new approach for maximizing bichromatic reverse nearest neighbor search"],"prefix":"10.1007","volume":"36","author":[{"given":"Yubao","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond Chi-Wing","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhitong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,23]]},"reference":[{"key":"527_CR1","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Garcia-Molina H, Jagadish HV (eds) Proceedings of the ACM SIGMOD international conference on management of data. Atlantic City, NJ, May 1990, pp 322\u2013331"},{"key":"527_CR2","volume-title":"Computational geometry: algorithms and applications","year":"2000","unstructured":"Berg M, Kreveld M, Overmars M, Schwarzkopf O (eds) (2000) Computational geometry: algorithms and applications. Springer, Berlin"},{"issue":"1","key":"527_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ejor.2009.04.021","volume":"202","author":"S Cabello","year":"2010","unstructured":"Cabello S, Diaz-Banex JM, Langerman S, Seara C (2010) Facility location problems in the plane based on reverse nearest neighbor queries. Eur J Oper Res 202(1):99\u2013106","journal-title":"Eur J Oper Res"},{"key":"527_CR4","unstructured":"Cabello S, Diaz-Banez JM, Langerman S, Seara C, Ventura I (2005) Reverse facility location problems. In: Proceedings of the 17th Canadian conference on computational geometry, Ontario, Canada, Aug 2005, pp 68\u201371"},{"key":"527_CR5","unstructured":"Cardinal J, Langerman S (2006) Min-max-min geometric facility location problems. In: Proceedings of the 22nd European workshop on computational geometry, Delphi, Greece, March 2006"},{"issue":"1\u20133","key":"527_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(86)80030-4","volume":"68","author":"B Chazelle","year":"1986","unstructured":"Chazelle B (1986) New upper bounds for neighbor searching. Inf Control 68(1\u20133):105\u2013124","journal-title":"Inf Control"},{"key":"527_CR7","unstructured":"Cheema MA, Lin X, Zhang W, Zhang Y (2011) Influence zone: efficiently processing reverse k nearest neighbors queries. In: Abiteboul S, Bohm K, Koch C (eds) Proceedings of the 27th international conference on data engineering. Hannover, Germany, April 2011, pp 577\u2013588"},{"issue":"1","key":"527_CR8","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.14778\/1687627.1687755","volume":"2","author":"MA Cheema","year":"2009","unstructured":"Cheema MA, Lin X, Zhang W, Zhang Y, Wang W, Zhang W (2009) Lazy updates: an efficient technique to continuously monitoring reverse kNN. Proc VLDB Endow 2(1):1138\u20131149","journal-title":"Proc VLDB Endow"},{"key":"527_CR9","doi-asserted-by":"crossref","unstructured":"Du Y, Zhang D, Xia T (2005) The optimal-location query. In: Medeiros CB, Egenhofer MJ, Bertino E (eds) Proceedings of the 9th international symposium on advances in spatial and temporal databases. Angra dos Reis, Brazil, Aug 2005, pp 163\u2013180","DOI":"10.1007\/11535331_10"},{"key":"527_CR10","unstructured":"Emrich T, Kriegel HP, Kr\u00f6ger P, Renz M, Xu N, Z\u00fcfle A (2010) Reverse k-Nearest neighbor monitoring on mobile objects. In: Agrawal D, Abbadi AE, Mokbel MF (eds) Proceedings of the 18th ACM SIGSPATIAL international symposium on advances in geographic information systems. San Jose, CA, USA, Nov 2010, pp 494\u2013497"},{"key":"527_CR11","unstructured":"Kang JM, Mokbel MF, Shekhar S, Xia T, Zhang D (2007) Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: Chirkova R, Dogac A, \u00d6zsu MT, Sellis TK (eds) Proceedings of the 23rd international conference on data engineering. The Marmara Hotel, Istanbul, Turkey, April 2007, pp 806\u2013815"},{"issue":"3","key":"527_CR12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10115-010-0286-z","volume":"26","author":"A Khoshgozaran","year":"2011","unstructured":"Khoshgozaran A, Shahabi C, Shirani-Mehr H (2011) Location privacy: going beyond K-anonymity, cloaking and anonymizers. Knowl Inf Syst 26(3):435\u2013465","journal-title":"Knowl Inf Syst"},{"key":"527_CR13","unstructured":"Korn F, Muthukrishnan S (2000) Influence sets based on reverse nearest neighbor queries. In: Chen W, Naughton JF, Bernstein PA (eds) Proceedings of the ACM SIGMOD international conference on management of data. Dallas, Texas, USA, May 2000, pp 201\u2013212"},{"key":"527_CR14","doi-asserted-by":"crossref","unstructured":"Korn F, Muthukrishnan S, Srivastava D (2002) Reverse nearest aggregates over data stream. In: Proceedings of the 28th international conference on very large data bases, Hong Kong, China, August 2002, pp 814\u2013825","DOI":"10.1016\/B978-155860869-6\/50077-9"},{"issue":"1","key":"527_CR15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J Krarup","year":"1983","unstructured":"Krarup J, Pruzan PM (1983) The simple plant location problem: Survey and synthesis. Eur J Oper Res 12(1):36\u201357","journal-title":"Eur J Oper Res"},{"issue":"3","key":"527_CR16","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s00778-008-0123-0","volume":"18","author":"X Lian","year":"2009","unstructured":"Lian X, Chen L (2009) Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB J 18(3):787\u2013808","journal-title":"VLDB J"},{"issue":"1","key":"527_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-010-0333-9","volume":"29","author":"EHC Lu","year":"2011","unstructured":"Lu EHC, Lee WC, Tseng VS (2011) Mining fastest path from trajectories with multiple destinations in road networks. Knowl Inf Syst 29(1):25\u201353","journal-title":"Knowl Inf Syst"},{"key":"527_CR18","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Carey MJ, Schneider DA (eds) Proceedings of the ACM SIGMOD international conference on management of data. San Jose, California, May 1995, pp 71\u201379"},{"key":"527_CR19","unstructured":"Stanoi I, Agrawal D, ElAbbadi A (2000) Reverse nearest neighbor queries for dynamic databases. In: Gunopulos D, Rastogi R (eds) Proceedings of 2000 ACM SIGMOD workshop on research issues in data mining and knowledge discovery. Dallas, Texas, USA, May 2000, pp 44\u201353"},{"key":"527_CR20","unstructured":"Stanoi I, Riedewald M, Agrawal D, Abbadi AE (2001) Discovery of influence sets in frequently updated databases. In: Apers PMG, Atzeni P, Ceri S, Paraboschi S, Ramamohanarao K, Snodgrass RT (eds) Proceedings of the 27th international conference on very large data bases. Roma, Italy, Sept 2001, pp 99\u2013108"},{"key":"527_CR21","doi-asserted-by":"crossref","unstructured":"Tan JSF, Lu EHC, Tseng VS (2012) Preference-oriented mining techniques for location-based store search. Knowl Inf Syst. doi: 10.1007\/s10115-011-0475-4","DOI":"10.1007\/s10115-011-0475-4"},{"issue":"4","key":"527_CR22","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"BC Tansel","year":"1983","unstructured":"Tansel BC, Francis RL, Lowe T (1983) Location on networks: a survey. Manag Sci 29(4):482\u2013497","journal-title":"Manag Sci"},{"key":"527_CR23","unstructured":"Tao Y, Papadias D, Lian X (2004) Reverse kNN search in arbitrary dimensionality. In: Nascimento MA, \u00d6zsu MT, Kossmann D, Miller RJ, Blakeley J, Schiefer KB (eds) Proceedings of the thirtieth international conference on very large data bases. Toronto, Canada, Sept 2004, pp 744\u2013755"},{"issue":"8","key":"527_CR24","first-page":"1239","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(8):1239\u20131252","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"527_CR25","unstructured":"Vadapalli S, Valluri SR, Karlapalem P (2006) A simple yet effective data clustering algorithm. In: Clifton CW, Zhong N, Liu J, Wah BW, Wu X (eds) Proceedings of the 6th IEEE international conference on data mining. Hong Kong, China, Dec 2006, pp 1108\u20131112"},{"issue":"1","key":"527_CR26","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.14778\/1687627.1687754","volume":"2","author":"RCW Wong","year":"2009","unstructured":"Wong RCW, \u00d6zsu MT, Yu PS, Fu AWC, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. Proc VLDB Endow 2(1):1126\u20131137","journal-title":"Proc VLDB Endow"},{"issue":"6","key":"527_CR27","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1007\/s00778-011-0230-1","volume":"20","author":"RCW Wong","year":"2011","unstructured":"Wong RCW, \u00d6zsu MT, Yu PS, Fu AWC, Liu L, Liu Y (2011) Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces. VLDB J 20(6):893\u2013919","journal-title":"VLDB J"},{"key":"527_CR28","unstructured":"Wong RCW, Tao Y, Fu AWC, Xiao X (2007) On efficient spatial matching. In: Koch C, Gehrke J, Garofalakis MN, Srivastava D, Aberer K, Deshpande A, Florescu D, Chan CY, Ganti V, Kanne CC, Klas W, Neuhold EJ (eds) Proceedings of the 33rd international conference on very large data bases. University of Vienna, Austria, Sept 2007, pp 579\u2013590"},{"issue":"1","key":"527_CR29","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.14778\/1453856.1453970","volume":"1","author":"W Wu","year":"2008","unstructured":"Wu W, Yang F, Chan CY, Tan KL (2008) FINCH: evaluating reverse k-nearest-neighbor queries on location data. Proc VLDB Endow 1(1):1056\u20131067","journal-title":"Proc VLDB Endow"},{"key":"527_CR30","unstructured":"Wu W, Yang F, Chan CY, Tan KL (2008) Continuous reverse k-nearest-neighbor monitoring. In: Meng X, Lei H, Grumbach S, Leong HV (eds) Proceedings of the 9th international conference on mobile data management. Beijing, China, April 2008, pp 132\u2013139"},{"key":"527_CR31","unstructured":"Xia T, Zhang D (2006) Continuous reverse nearest neighbor monitoring. In: Liu L, Reuter A, Whang K, Zhang J (eds) Proceedings of the 22nd international conference on data engineering. Atlanta, GA, USA, April 2006, p 77"},{"key":"527_CR32","unstructured":"Xia T, Zhang D, Kanoulas E, Du Y (2005) On computing top-t most influential spatial sites. In: Bohm K, Jensen C, Haas LM, Kersten ML, Larson P, Ooi BC (eds) Proceedings of the 31st international conference on very large data bases. Trondheim, Norway, Sept 2005, pp 946\u2013957"},{"issue":"1","key":"527_CR33","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10115-010-0326-8","volume":"29","author":"Y Yang","year":"2011","unstructured":"Yang Y, Hao C (2011) Product selection for promotion planning. Knowl Inf Syst 29(1):223\u2013236","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"527_CR34","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/TKDE.2006.1599391","volume":"18","author":"ML Yiu","year":"2006","unstructured":"Yiu ML, Papadias D, Mamoulis N, Tao Y (2006) Reverse nearest neighbors in large graphs. IEEE Trans Knowl Data Eng 18(4):540\u2013553","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"527_CR35","unstructured":"Zhang D, Du Y, Xia T, Tao Y (2006) Progressive computation of the min-dist optimal-location query. In: Dayal U, Whang K, Lomet DB, Alonso G, Lohman GM, Kersten ML, Cha SK, Kim Y (eds) Proceedings of the 32nd international conference on very large data bases. Seoul, Korea, Sept 2006, pp 643\u2013654"},{"issue":"2","key":"527_CR36","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10115-011-0405-5","volume":"31","author":"M Zhang","year":"2011","unstructured":"Zhang M, Alhajj R (2011) Effectiveness of NAQ-tree in handling reverse nearest-neighbor queries in high-dimensional metric space. Knowl Inf Syst 31(2):307\u2013343","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"527_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-008-0190-y","volume":"22","author":"M Zhang","year":"2010","unstructured":"Zhang M, Alhajj R (2010) Effectiveness of NAQ-tree as index structure for similarity search in high dimensional metric space. Knowl Inf Syst 22(1):1\u201326","journal-title":"Knowl Inf Syst"},{"key":"527_CR38","doi-asserted-by":"crossref","unstructured":"Zhang S, Chen F, Wu X, Zhang C (2006) Identifying bridging rules between conceptual clusters. In: Eliassi-Rad T, Ungar LH, Craven M, Gunopulos D (eds) Proceedings of the twelfth ACM SIGKDD international conference on knowledge discovery and data mining. Philadelphia, PA, USA, Aug 2006, pp 815\u2013820","DOI":"10.1145\/1150402.1150509"},{"key":"527_CR39","unstructured":"Zhou Z, Wu W, Li X, Lee ML, Hsu W (2011) MaxFirst for MaxBRkNN. In: Abiteboul S, Bohm K, Koch C, Tan K (eds) Proceedings of the 27th international conference on data engineering. Hannover, Germany, April 2011, pp 828\u2013839"},{"issue":"1","key":"527_CR40","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10115-010-0337-5","volume":"30","author":"L Zhu","year":"2012","unstructured":"Zhu L, Li C, Tung AKH, Wang S (2012) Microeconomic analysis using dominant relationship analysis. Knowl Inf Syst 30(1):179\u2013211","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0527-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0527-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0527-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:27Z","timestamp":1559124627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0527-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,23]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["527"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0527-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,23]]}}}