{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:31:03Z","timestamp":1742916663061,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201516"},{"type":"electronic","value":"9783642201523"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20152-3_5","type":"book-chapter","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T18:42:08Z","timestamp":1302288128000},"page":"58-72","source":"Crossref","is-referenced-by-count":5,"title":["Finding the Sites with Best Accessibilities to Amenities"],"prefix":"10.1007","author":[{"given":"Qianlu","family":"Lin","sequence":"first","affiliation":[]},{"given":"Chuan","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_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 Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C. B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Krebs, F.: The -nearest neighbour join: Turbo charging the kdd process. Knowl. Inf. Syst.\u00a06(6), 728\u2013749 (2004)","journal-title":"Knowl. Inf. Syst."},{"key":"5_CR3","unstructured":"Cabello, S., D\u00edaz-B\u00e1\u00f1ez, J.M., Langerman, S., Seara, C., Ventura, I.: Reverse facility location problems. In: CCCG, pp. 68\u201371 (2005)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ejor.2009.04.021","volume":"202","author":"S. Cabello","year":"2010","unstructured":"Cabello, S., D\u00edaz-B\u00e1\u00f1ez, J.M., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research\u00a0202(1), 99\u2013106 (2010)","journal-title":"European Journal of Operational Research"},{"key":"5_CR5","unstructured":"Chaudhuri, S., Gravano, L.: Evaluating top- selection queries. In: VLDB, pp. 397\u2013410 (1999)"},{"key":"5_CR6","unstructured":"Cheema, M.: Circulartrip and arctrip: Effective grid access methods for continuous spatial queries"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Patel, J.M.: Efficient evaluation of all-nearest-neighbor queries. In: ICDE, pp. 1056\u20131065 (2007)","DOI":"10.1109\/ICDE.2007.368964"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A. Corral","year":"2004","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for processing k-closest-pair queries in spatial databases. Data Knowl. Eng.\u00a049(1), 67\u2013104 (2004)","journal-title":"Data Knowl. Eng."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11535331_10","volume-title":"Advances in Spatial and Temporal Databases","author":"Y. Du","year":"2005","unstructured":"Du, Y., Zhang, D., Xia, T.: The optimal-location query. In: Anshelevich, E., Egenhofer, M.J., Hwang, J. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 163\u2013180. Springer, Heidelberg (2005)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-13818-8_35","volume-title":"Scientific and Statistical Database Management","author":"T. Emrich","year":"2010","unstructured":"Emrich, T., Graf, F., Kriegel, H.-P., Schubert, M., Thoma, M.: Optimizing all-nearest-neighbor queries with trigonometric pruning. In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol.\u00a06187, pp. 501\u2013518. Springer, Heidelberg (2010)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: SIGMOD Conference, pp. 237\u2013248 (1998)","DOI":"10.1145\/276305.276326"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst.\u00a024(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Li, H., Lu, H., Huang, B., Huang, Z.: Two ellipse-based pruning methods for group nearest neighbor queries. In: GIS, pp. 192\u2013199 (2005)","DOI":"10.1145\/1097064.1097092"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: SIGMOD Conference, pp. 634\u2013645 (2005)","DOI":"10.1145\/1066157.1066230"},{"key":"5_CR16","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, pp. 301\u2013312 (2004)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In: SIGMOD Conference, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Seidl, T., Kriegel, H.-P.: Optimal multi-step k-nearest neighbor search. In: SIGMOD Conference, pp. 154\u2013165 (1998)","DOI":"10.1145\/276305.276319"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Shin, H., Moon, B., Lee, S.: Adaptive multi-stage distance join processing. In: SIGMOD Conference, pp. 343\u2013354 (2000)","DOI":"10.1145\/335191.335428"},{"issue":"1","key":"5_CR20","first-page":"1126","volume":"2","author":"R.C.-W. Wong","year":"2009","unstructured":"Wong, R.C.-W., \u00d6zsu, M.T., Yu, P.S., Fu, A.W.-C., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB\u00a02(1), 1126\u20131137 (2009)","journal-title":"PVLDB"},{"key":"5_CR21","unstructured":"Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: VLDB, pp. 643\u2013654 (2006)"},{"key":"5_CR22","unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: SSDBM, pp. 297\u2013306 (2004)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20152-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T17:07:35Z","timestamp":1558544855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20152-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201516","9783642201523"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20152-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}