{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:03Z","timestamp":1742913003002,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594183"},{"type":"electronic","value":"9783030594190"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59419-0_13","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:57:43Z","timestamp":1600707463000},"page":"204-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["DARS: Diversity and Distribution-Aware Region Search"],"prefix":"10.1007","author":[{"given":"Siyu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Qizhi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.infsof.2006.05.005","volume":"49","author":"H Cho","year":"2007","unstructured":"Cho, H., Chung, C.: Indexing range sum queries in spatio-temporal databases. Inf. Softw. Technol. 49(4), 324\u2013331 (2007)","journal-title":"Inf. Softw. Technol."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Choi, D., Chung, C.: Nearest neighborhood search in spatial databases. In: ICDE, pp. 699\u2013710. IEEE Computer Society (2015)","DOI":"10.1109\/ICDE.2015.7113326"},{"issue":"11","key":"13_CR3","first-page":"1088","volume":"5","author":"D Choi","year":"2012","unstructured":"Choi, D., Chung, C., Tao, Y.: A scalable algorithm for maximizing range sum in spatial databases. PVLDB 5(11), 1088\u20131099 (2012)","journal-title":"PVLDB"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s00778-018-0504-y","volume":"27","author":"FM Choudhury","year":"2018","unstructured":"Choudhury, F.M., Culpepper, J.S., Bao, Z., Sellis, T.: Finding the optimal location and keywords in obstructed and unobstructed space. VLDB J. 27(4), 445\u2013470 (2018). https:\/\/doi.org\/10.1007\/s00778-018-0504-y","journal-title":"VLDB J."},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility Location - Applications and Theory","author":"Z Drezner","year":"2002","unstructured":"Drezner, Z., Hamacher, H.W.: Facility Location - Applications and Theory. Springer, Heidelberg (2002)"},{"key":"13_CR6","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: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 163\u2013180. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535331_10"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Feng, K., Cong, G., Bhowmick, S.S., Peng, W., Miao, C.: Towards best region search for data exploration. In: SIGMOD Conference, pp. 1055\u20131070. ACM (2016)","DOI":"10.1145\/2882903.2882960"},{"issue":"11","key":"13_CR8","first-page":"1414","volume":"12","author":"K Feng","year":"2019","unstructured":"Feng, K., Cong, G., Jensen, C.S., Guo, T.: Finding attribute-aware similar region for data analysis. PVLDB 12(11), 1414\u20131426 (2019)","journal-title":"PVLDB"},{"key":"13_CR9","unstructured":"Goodrich, M.T., Tsay, J., Vengroff, D.E., Vitter, J.S.: External-memory computational geometry (preliminary version). In: FOCS, pp. 714\u2013723. IEEE Computer Society (1993)"},{"issue":"4","key":"13_CR10","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.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4), 310\u2013323 (1983)","journal-title":"J. Algorithms"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with a multi-resolution tree structure. In: SIGMOD Conference, pp. 401\u2013412. ACM (2001)","DOI":"10.1145\/376284.375718"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Liu, J., Yu, G., Sun, H.: Subject-oriented top-k hot region queries in spatial dataset. In: CIKM, pp. 2409\u20132412. ACM (2011)","DOI":"10.1145\/2063576.2063979"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhao, K., Cong, G.: Efficient similar region search with deep metric learning. In: KDD, pp. 1850\u20131859. ACM (2018)","DOI":"10.1145\/3219819.3220031"},{"issue":"8","key":"13_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(95)00029-X","volume":"29","author":"S Nandy","year":"1995","unstructured":"Nandy, S., Bhattacharya, B.: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Comput. Math. Appl. 29(8), 45\u201361 (1995)","journal-title":"Comput. Math. Appl."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-47724-1_23","volume-title":"Advances in Spatial and Temporal Databases","author":"D Papadias","year":"2001","unstructured":"Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 443\u2013459. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47724-1_23"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Sheng, C., Tao, Y.: New results on two-dimensional orthogonal range aggregation in external memory. In: PODS, pp. 129\u2013139. ACM (2011)","DOI":"10.1145\/1989284.1989297"},{"issue":"12","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1109\/TKDE.2004.93","volume":"16","author":"Y Tao","year":"2004","unstructured":"Tao, Y., Papadias, D.: Range aggregate processing in spatial databases. IEEE Trans. Knowl. Data Eng. 16(12), 1555\u20131570 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"13_CR18","first-page":"1126","volume":"2","author":"RC Wong","year":"2009","unstructured":"Wong, R.C., \u00d6zsu, M.T., Yu, P.S., Fu, A.W., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1), 1126\u20131137 (2009)","journal-title":"PVLDB"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Xiao, X., Yao, B., Li, F.: Optimal location queries in road network databases. In: ICDE, pp. 804\u2013815. IEEE Computer Society (2011)","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"13_CR20","unstructured":"Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: VLDB, pp. 643\u2013654. ACM (2006)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, P., Bao, Z., Li, Y., Li, G., Zhang, Y., Peng, Z.: Trajectory-driven influential billboard placement. In: KDD, pp. 2748\u20132757. ACM (2018)","DOI":"10.1145\/3219819.3219946"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Li, Y., Bao, Z., Mo, S., Zhang, P.: Optimizing impression counts for outdoor advertising. In: KDD, pp. 1205\u20131215. ACM (2019)","DOI":"10.1145\/3292500.3330829"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59419-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:51:43Z","timestamp":1710265903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59419-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594183","9783030594190"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59419-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.81","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}