{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:52:06Z","timestamp":1743094326257,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030551896"},{"type":"electronic","value":"9783030551902"}],"license":[{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-55190-2_63","type":"book-chapter","created":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T21:03:05Z","timestamp":1596747785000},"page":"748-757","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["RADAR: Fast Approximate Reverse Rank Queries"],"prefix":"10.1007","author":[{"given":"Sourav","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,25]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"Chang, Y., Bergman, L.D., Castelli, V., Li, C., Lo, M., Smith, J.R.: The onion technique: indexing for linear optimization queries. In: SIGMOD, pp. 391\u2013402 (2000)","DOI":"10.1145\/335191.335433"},{"key":"63_CR2","doi-asserted-by":"crossref","unstructured":"Chester, S., Thomo, A., Venkatesh, S., Whitesides, S.: Indexing reverse top-k queries in two dimensions. In: DASFAA, pp. 201\u2013208 (2013)","DOI":"10.1007\/978-3-642-37487-6_17"},{"key":"63_CR3","doi-asserted-by":"crossref","unstructured":"Dong, Y., Chen, H., Furuse, K., Kitagawa, H.: Aggregate reverse rank queries. In: DEXA, pp. 87\u2013101 (2016)","DOI":"10.1007\/978-3-319-44406-2_8"},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"Dong, Y., Chen, H., Furuse, K., Kitagawa, H.: Efficient processing of aggregate reverse rank queries. In: DEXA, pp. 159\u2013166 (2017)","DOI":"10.1007\/978-3-319-64468-4_12"},{"key":"63_CR5","unstructured":"Dong, Y., Chen, H., Yu, J.X., Furuse, K., Kitagawa, H.: Grid-index algorithm for reverse rank queries. In: EDBT, pp. 306\u2013317 (2017)"},{"issue":"4","key":"63_CR6","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s00778-017-0460-y","volume":"26","author":"Y Gao","year":"2017","unstructured":"Gao, Y., Miao, X., Chen, G., Zheng, B., Cai, D., Cui, H.: On efficiently finding reverse k-nearest neighbors over uncertain graphs. VLDB J. 26, 467\u2013492 (2017)","journal-title":"VLDB J."},{"key":"63_CR8","unstructured":"Ge, S., U, L.H., Mamoulis, N., Cheung, D.: Efficient all top-k computation - a unified solution for all top-k, reverse top-k and top-m influential queries. TKDE 25(5), 1015\u20131027 (2012)"},{"issue":"2","key":"63_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. TODS 24(2), 265\u2013318 (1999)","journal-title":"TODS"},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: a system for the efficient execution of multi-parametric ranked queries. In: SIGMOD, pp. 259\u2013270 (2001)","DOI":"10.1145\/376284.375690"},{"key":"63_CR11","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. (CSUR) 40(4), 11:1\u201311:58 (2008)","DOI":"10.1145\/1391729.1391730"},{"key":"63_CR12","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201\u2013212 (2000)","DOI":"10.1145\/335191.335415"},{"issue":"3","key":"63_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1272743.1272749","volume":"32","author":"N Mamoulis","year":"2007","unstructured":"Mamoulis, N., Yiu, M.L., Cheng, K.H., Cheung, D.W.: Efficient top-k aggregation of ranked inputs. TODS 32(3), 19 (2007)","journal-title":"TODS"},{"key":"63_CR14","unstructured":"Qian, Y., Li, H., Mamoulis, N., Liu, Y., Cheung, D.W.: Reverse k-ranks queries on large graphs. In: EDBT, pp. 37\u201348 (2017)"},{"key":"63_CR15","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y., N\u00f8rv\u00e5g, K.: Reverse top-k queries. In: ICDE, pp. 365\u2013376 (2010)","DOI":"10.1109\/ICDE.2010.5447890"},{"issue":"8","key":"63_CR16","first-page":"1215","volume":"23","author":"A Vlachou","year":"2011","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y., N\u00f8rv\u00e5g, K.: Monochromatic and bichromatic reverse top-k queries. TKDE 23(8), 1215\u20131229 (2011)","journal-title":"TKDE"},{"key":"63_CR17","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., N\u00f8rv\u00e5g, K., Kotidis, Y.: Branch-and-bound algorithm for reverse top-k queries. In: SIGMOD, pp. 481\u2013492 (2013)","DOI":"10.1145\/2463676.2465278"},{"key":"63_CR18","unstructured":"Xin, D., Chen, C., Han, J.: Towards robust indexing for ranked queries. In: VLDB, pp. 235\u2013246 (2006)"},{"key":"63_CR19","doi-asserted-by":"crossref","unstructured":"Yang, S., Cheema, M.A., Lin, X., Zhang, Y.: SLICE: reviving regions-based pruning for reverse-k nearest neighbors queries. In: ICDE, pp. 760\u2013771 (2014)","DOI":"10.1109\/ICDE.2014.6816698"},{"issue":"5","key":"63_CR20","first-page":"401","volume":"7","author":"AW Yu","year":"2014","unstructured":"Yu, A.W., Mamoulis, N., Su, H.: Reverse top-k search using random walk with restart. PVLDB 7(5), 401\u2013412 (2014)","journal-title":"PVLDB"},{"issue":"10","key":"63_CR21","first-page":"785","volume":"7","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z., Jin, C., Kang, Q.: Reverse k-rank query. PVLDB 7(10), 785\u2013796 (2014)","journal-title":"PVLDB"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55190-2_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T13:05:24Z","timestamp":1598879124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-55190-2_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,25]]},"ISBN":["9783030551896","9783030551902"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55190-2_63","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020,8,25]]},"assertion":[{"value":"25 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IntelliSys","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Proceedings of SAI Intelligent Systems Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"3 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"intellisys2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/saiconference.com\/IntelliSys","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}