{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:09:17Z","timestamp":1742915357877,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850814"},{"type":"electronic","value":"9783030850821"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85082-1_26","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T16:16:47Z","timestamp":1628612207000},"page":"297-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Semantically Diverse Constrained Queries"],"prefix":"10.1007","author":[{"given":"Xu","family":"Teng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goce","family":"Trajcevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,17]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Abbar, S., et al.: Diverse near neighbor problem. In: SOCG, pp. 207\u2013214 (2013)","DOI":"10.1145\/2462356.2462401"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Al-Mamun, A., Wu, H., Aref, W.G.: A tutorial on learned multi-dimensional indexes. In: ACM SIGSPATIAL (2020)","DOI":"10.1145\/3397536.3426358"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Alvares, L.O., Bogorny, V., Kuijpers, B., de Macedo, J.A.F., Moelans, B., Vaisman, A.: A model for enriching trajectories with semantic geographical information. In: ACM GIS, p. 22. ACM (2007)","DOI":"10.1145\/1341012.1341041"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Amagata, D., Hara, T.: Diversified set monitoring over distributed data streams. In: DEBS, pp. 1\u201312. ACM (2016)","DOI":"10.1145\/2933267.2933298"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Bao, J., Chow, C.Y., Mokbel, M.F., Ku, W.S.: Efficient evaluation of k-range nearest neighbor queries in road networks. In: MDM, pp. 115\u2013124. IEEE (2010)","DOI":"10.1109\/MDM.2010.40"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00778-005-0166-4","volume":"15","author":"R Benetis","year":"2006","unstructured":"Benetis, R., Jensen, C.S., Kar\u0109iauskas, G., \u015caltenis, S.: Nearest and reverse nearest neighbor queries for moving objects. VLDB J. 15(3), 229\u2013249 (2006)","journal-title":"VLDB J."},{"issue":"4","key":"26_CR7","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10707-018-0332-7","volume":"22","author":"CF Costa","year":"2018","unstructured":"Costa, C.F., Nascimento, M.A., Schubert, M.: Diverse nearest neighbors queries using linear skylines. GeoInformatica 22(4), 815\u2013844 (2018)","journal-title":"GeoInformatica"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD (1984)","DOI":"10.1145\/602259.602266"},{"key":"26_CR9","unstructured":"Hu, H., Lee, D.L., Lee, V.: Distance indexing on road networks. In: VLDB, pp. 894\u2013905. VLDB Endowment (2006)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Issa, H., Damiani, M.L.: Efficient access to temporally overlaying spatial and textual trajectories. In: MDM, pp. 262\u2013271 (2016)","DOI":"10.1109\/MDM.2016.47"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Jain, A., Sarda, P., Haritsa, J.R.: Providing diversity in k-nearest neighbor query results. In: PAKDD, pp. 404\u2013413 (2004)","DOI":"10.1007\/978-3-540-24775-3_49"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data, pp. 489\u2013504 (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Kucuktunc, O., Ferhatosmanoglu, H.: $$\\lambda $$-diverse nearest neighbors browsing for multidimensional data. TKDE 25, 481\u2013493 (2013)","DOI":"10.1109\/TKDE.2011.251"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Lee, K.C.K., Lee, W.C., Leong, H.V.: Nearest surrounder queries. In: ICDE, p. 85 (2006)","DOI":"10.1109\/ICDE.2006.104"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Neto, F.R.A., Santos, C.A.: Understanding crowdsourcing projects: a systematic review of tendencies, workflow, and quality management. Inf. Proc. Manag. 54, 490\u2013506 (2018)","DOI":"10.1016\/j.ipm.2018.03.006"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Parent, C., et al.: Semantic trajectories modeling and analysis. ACM Comput. Surv. (CSUR) 45, 42 (2013)","DOI":"10.1145\/2501654.2501656"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Teng, X., Trajcevski, G., Kim, J., Z\u00fcfle, A.: Semantically diverse path search. In: IEEE MDM (2020)","DOI":"10.1109\/MDM48529.2020.00028"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Teng, X., Yang, J., Kim, J.S., Trajcevski, G., Z\u00fcfle, A., Nascimento, M.A.: Fine-grained diversification of proximity constrained queries on road networks. In: SSTD, pp. 51\u201360 (2019)","DOI":"10.1145\/3340964.3340970"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Vieira, M.R., et al.: On query result diversification. In: ICDE, pp. 1163\u20131174. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Wang, H., Fu, X., Xu, J., Lu, H.: Learned index for spatial queries. In: IEEE MDM (2019)","DOI":"10.1109\/MDM.2019.00121"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Yang, S., Cheema, M.A., Lin, X., Wang, W.: Reverse k nearest neighbors query processing: experiments and analysis. In: Proceedings of the VLDB Endow, pp. 605\u2013616 (2015)","DOI":"10.14778\/2735479.2735492"},{"key":"26_CR22","unstructured":"Zhang, C., et al.: Diversified spatial keyword search on road networks. In: EDBT, pp. 367\u2013378 (2014)"},{"key":"26_CR23","unstructured":"Zheng, K., Shang, S., Yuan, N.J., Yang, Y.: Towards efficient search for activity trajectories. In: ICDE, pp. 230\u2013241. IEEE (2013)"}],"container-title":["Communications in Computer and Information Science","New Trends in Database and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85082-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:47:51Z","timestamp":1710348471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85082-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850814","9783030850821"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85082-1_26","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tartu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2021","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":"adbis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2021.cs.ut.ee\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"70","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":"18","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":"0","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":"26% - 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":"Workshops: submissions: 17,  papers accepted: DOING 2021: 3, SIMPDA 2021: 1, MADEISD 2021: 4, MegaData 2021: 1, CAoNS 2021: 2","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)"}}]}}