{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:48:50Z","timestamp":1743079730934,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319178844"},{"type":"electronic","value":"9783319178851"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-17885-1_1514","type":"book-chapter","created":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T14:37:38Z","timestamp":1505486258000},"page":"1198-1204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing Range Sum in Spatial Databases"],"prefix":"10.1007","author":[{"given":"Dong-Wan","family":"Choi","sequence":"first","affiliation":[]},{"given":"Chin-Wang","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Yufei","family":"Tao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"100713_CR1459","first-page":"83","volume-title":"A general lower bound on the I\/O-complexity of comparison-based algorithms","author":"L Arge","year":"1993","unstructured":"Arge L, Knudsen M, Larsen K (1993) A general lower bound on the I\/O-complexity of comparison-based algorithms. In: Proceedings of algorithms and data structures (WADS), Montr\u00e9al, Canada, pp\u00a083\u201394"},{"issue":"4","key":"100713_CR1460","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0925-7721(96)00011-9","volume":"8","author":"G Barequet","year":"1997","unstructured":"Barequet G, Dickerson M, Pau P (1997) Translating a convex polygon to contain a maximum number of points. Comput Geom 8(4):167\u2013179","journal-title":"Comput Geom"},{"issue":"9","key":"100713_CR1461","first-page":"733","volume":"7","author":"X Cao","year":"2014","unstructured":"Cao X, Cong G, Jensen CS, Yiu ML (2014) Retrieving regions of interest for user exploration. PVLDB 7(9):733\u2013744","journal-title":"PVLDB"},{"issue":"1","key":"100713_CR1462","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"BM Chazelle","year":"1986","unstructured":"Chazelle BM, Lee DT (1986) On a circle placement problem. Computing 36(1):1\u201316","journal-title":"Computing"},{"issue":"11","key":"100713_CR1463","first-page":"1088","volume":"5","author":"D-W Choi","year":"2012","unstructured":"Choi D-W, Chung C-W, Tao Y (2012) A scalable algorithm for maximizing range sum in spatial databases. PVLDB 5(11):1088\u20131099","journal-title":"PVLDB"},{"issue":"3","key":"100713_CR1464","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2629477","volume":"39","author":"D-W Choi","year":"2014","unstructured":"Choi D-W, Chung C-W, Tao Y (2014) Maximizing range sum in external memory. ACM Trans Database Syst (TODS) 39(3):21","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"1","key":"100713_CR1465","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(98)00015-7","volume":"11","author":"M Dickerson","year":"1998","unstructured":"Dickerson M, Scharstein D (1998) Optimal placement of convex polygons to maximize point containment. Comput Geom 11(1):1\u201316","journal-title":"Comput Geom"},{"key":"100713_CR1466","doi-asserted-by":"crossref","unstructured":"Du Y, Zhang D, Xia T (2005) The optimal-location query. In: International symposium of advances in spatial and temporal databases (SSTD), pp\u00a0163\u2013180","DOI":"10.1007\/11535331_10"},{"key":"100713_CR1467","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D Eppstein","year":"1994","unstructured":"Eppstein D, Erickson J (1994) Iterated nearest neighbors and finding minimal polytopes. Discret Comput Geom 11:321\u2013350","journal-title":"Discret Comput Geom"},{"issue":"4","key":"100713_CR1468","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H Imai","year":"1983","unstructured":"Imai H, Asano T (1983) Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J Algorithms 4(4):310\u2013323","journal-title":"J Algorithms"},{"issue":"8","key":"100713_CR1469","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(95)00029-X","volume":"29","author":"SC Nandy","year":"1995","unstructured":"Nandy SC, Bhattacharya BB (1995) A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Comput Math Appl 29(8):45\u201361","journal-title":"Comput Math Appl"},{"issue":"2","key":"100713_CR1470","first-page":"93","volume":"4","author":"JB Rocha-Junior","year":"2010","unstructured":"Rocha-Junior JB, Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K (2010) Efficient processing of top-k spatial preference queries. PVLDB 4(2):93\u2013104","journal-title":"PVLDB"},{"issue":"13","key":"100713_CR1471","first-page":"1546","volume":"6","author":"Y Tao","year":"2013","unstructured":"Tao Y, Hu X, Choi D-W, Chung C-W (2013) Approximate maxrs in spatial databases. PVLDB 6(13):1546\u20131557","journal-title":"PVLDB"},{"issue":"1","key":"100713_CR1472","first-page":"1126","volume":"2","author":"RC-W Wong","year":"2009","unstructured":"Wong RC-W, Tamer \u00d6zsu M, Yu PS, Fu AW-C, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1):1126\u20131137","journal-title":"PVLDB"},{"key":"100713_CR1473","unstructured":"Xia T, Zhang D, Kanoulas E, Du Y (2005) On computing top-t most influential spatial sites. In: Proceedings of international conference on very large data bases (VLDB), pp\u00a0946\u2013957"},{"key":"100713_CR1474","doi-asserted-by":"crossref","unstructured":"Xiao X, Yao B, Li F (2011) Optimal location queries in road network databases. In: Proceedings of international conference on data engineering (ICDE), pp\u00a0804\u2013815","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"100713_CR1475","doi-asserted-by":"crossref","unstructured":"Yiu ML, Dai X, Mamoulis N, Vaitis M (2007) Top-k spatial preference queries. In: Proceedings of international conference on data engineering (ICDE), pp\u00a01076\u20131085","DOI":"10.1109\/ICDE.2007.368966"},{"key":"100713_CR1476","unstructured":"Zhang D, Du Y, Xia T, Tao Y (2006) Progressive computation of the min-dist optimal-location query. In: Proceedings of international conference on very large data bases (VLDB), pp\u00a0643\u2013654"},{"key":"100713_CR1477","doi-asserted-by":"crossref","unstructured":"Zhou Z, Wu W, Li X, Lee M-L, Hsu W (2011) Maxfirst for MaxBRkNN. In: Proceedings of international conference on data engineering (ICDE), pp\u00a0828\u2013839","DOI":"10.1109\/ICDE.2011.5767892"}],"container-title":["Encyclopedia of GIS"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17885-1_1514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T08:14:32Z","timestamp":1555488872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-17885-1_1514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319178844","9783319178851"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17885-1_1514","relation":{},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}