{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:02Z","timestamp":1742913182988,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185787"},{"type":"electronic","value":"9783030185794"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-18579-4_42","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T15:05:36Z","timestamp":1556031936000},"page":"713-729","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for Solving Aggregate Keyword Routing Problems"],"prefix":"10.1007","author":[{"given":"Qize","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Weiwei","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Kunjie","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Chen, K., Sun, W., Tu, C., Chen, C., Huang, Y.: Aggregate keyword routing in spatial database. In: SIGSPATIAL, pp. 430\u2013433. ACM (2012)","key":"42_CR1","DOI":"10.1145\/2424321.2424382"},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.14778\/1687627.1687666","volume":"2","author":"G Cong","year":"2009","unstructured":"Cong, G., Jensen, C.S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. Proc. VLDB Endowment 2(1), 337\u2013348 (2009)","journal-title":"Proc. VLDB Endowment"},{"doi-asserted-by":"crossref","unstructured":"De Felipe, I., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In: ICDE, pp. 656\u2013665. IEEE (2008)","key":"42_CR3","DOI":"10.1109\/ICDE.2008.4497474"},{"issue":"2","key":"42_CR4","first-page":"295","volume":"24","author":"K Deng","year":"2012","unstructured":"Deng, K., Sadiq, S., Zhou, X., Xu, H., Fung, G.P.C., Lu, Y.: On group nearest group query processing. TKDE 24(2), 295\u2013308 (2012)","journal-title":"TKDE"},{"issue":"10","key":"42_CR5","first-page":"1526","volume":"23","author":"F Li","year":"2011","unstructured":"Li, F., Yao, B., Kumar, P.: Group enclosing queries. TKDE 23(10), 1526\u20131540 (2011)","journal-title":"TKDE"},{"doi-asserted-by":"crossref","unstructured":"Li, G., Feng, J., Xu, J.: Desks: direction-aware spatial keyword search. In: ICDE, pp. 474\u2013485. IEEE (2012)","key":"42_CR6","DOI":"10.1109\/ICDE.2012.93"},{"doi-asserted-by":"crossref","unstructured":"Li, Z., Xu, H., Lu, Y., Qian, A.: Aggregate nearest keyword search in spatial databases. In: APWEB, pp. 15\u201321. IEEE (2010)","key":"42_CR7","DOI":"10.1109\/APWeb.2010.25"},{"issue":"4","key":"42_CR8","first-page":"585","volume":"23","author":"Z Li","year":"2011","unstructured":"Li, Z., Lee, K.C., Zheng, B., Lee, W.C., Lee, D., Wang, X.: Ir-tree: an efficient index for geographic document search. TKDE 23(4), 585\u2013599 (2011)","journal-title":"TKDE"},{"issue":"6","key":"42_CR9","first-page":"809","volume":"20","author":"X Lian","year":"2008","unstructured":"Lian, X., Chen, L.: Probabilistic group nearest neighbor queries in uncertain databases. TKDE 20(6), 809\u2013824 (2008)","journal-title":"TKDE"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/978-3-540-74484-9_70","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"Y Luo","year":"2007","unstructured":"Luo, Y., Chen, H., Furuse, K., Ohbo, N.: Efficient methods in finding aggregate nearest neighbor by projection-based filtering. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007. LNCS, vol. 4707, pp. 821\u2013833. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74484-9_70"},{"doi-asserted-by":"crossref","unstructured":"Luo, Y., Furuse, K., Chen, H., Ohbo, N.: Finding aggregate nearest neighbor efficiently without indexing. In: Proceedings of the 2nd international conference on Scalable information systems. p. 48. Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (2007)","key":"42_CR11","DOI":"10.4108\/infoscale.2007.900"},{"unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, pp. 301\u2013312. IEEE (2004)","key":"42_CR12"},{"issue":"2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. TODS 30(2), 529\u2013576 (2005)","journal-title":"TODS"},{"issue":"1\u20132","key":"42_CR14","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.14778\/1920841.1920994","volume":"3","author":"M Sharifzadeh","year":"2010","unstructured":"Sharifzadeh, M., Shahabi, C.: Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. Proc. VLDB Endowment 3(1\u20132), 1231\u20131242 (2010)","journal-title":"Proc. VLDB Endowment"},{"issue":"4","key":"42_CR15","first-page":"781","volume":"30","author":"WW Sun","year":"2015","unstructured":"Sun, W.W., Chen, C.N., Zhu, L., Gao, Y.J., Jing, Y.N., Li, Q.: On efficient aggregate nearest neighbor query processing in road networks. JCST 30(4), 781\u2013798 (2015)","journal-title":"JCST"},{"doi-asserted-by":"crossref","unstructured":"Sun, W., et al.: Merged aggregate nearest neighbor query processing in road networks. In: CIKM, pp. 2243\u20132248. ACM (2013)","key":"42_CR16","DOI":"10.1145\/2505515.2505738"},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ins.2015.03.028","volume":"310","author":"W Sun","year":"2015","unstructured":"Sun, W., Chen, C., Zheng, B., Chen, C., Zhu, L., Liu, W., Huang, Y.: Fast optimal aggregate point search for a merged set on road networks. Inform. Sci. 310, 52\u201368 (2015)","journal-title":"Inform. Sci."},{"doi-asserted-by":"crossref","unstructured":"Yao, B., Tang, M., Li, F.: Multi-approximate-keyword routing in GIS data. In: SIGSPATIAL, pp. 201\u2013210. ACM (2011)","key":"42_CR18","DOI":"10.1145\/2093973.2094001"},{"issue":"6","key":"42_CR19","first-page":"820","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. TKDE 17(6), 820\u2013833 (2005)","journal-title":"TKDE"},{"issue":"7","key":"42_CR20","first-page":"1706","volume":"28","author":"C Zhang","year":"2016","unstructured":"Zhang, C., Zhang, Y., Zhang, W., Lin, X.: Inverted linear quadtree: efficient top K spatial keyword search. TKDE 28(7), 1706\u20131721 (2016)","journal-title":"TKDE"},{"doi-asserted-by":"crossref","unstructured":"Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: ICDE, pp. 688\u2013699. IEEE (2009)","key":"42_CR21","DOI":"10.1109\/ICDE.2009.77"},{"issue":"2","key":"42_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10707-017-0315-0","volume":"22","author":"P Zhang","year":"2018","unstructured":"Zhang, P., Lin, H., Gao, Y., Lu, D.: Aggregate keyword nearest neighbor queries on road networks. GeoInformatica 22(2), 237\u2013268 (2018)","journal-title":"GeoInformatica"},{"doi-asserted-by":"crossref","unstructured":"Zhu, L., Jing, Y., Sun, W., Mao, D., Liu, P.: Voronoi-based aggregate nearest neighbor query processing in road networks. In: SIGSPATIAL, pp. 518\u2013521. ACM (2010)","key":"42_CR23","DOI":"10.1145\/1869790.1869876"}],"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-18579-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:55:02Z","timestamp":1710233702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18579-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185787","9783030185794"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18579-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","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":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","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":"92","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":"64","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":"18% - 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","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":"3","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":"13 demo papers, 6 tutorial 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)"}}]}}