{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:14:38Z","timestamp":1755839678709},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s00607-024-01260-7","type":"journal-article","created":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T20:02:38Z","timestamp":1708113758000},"page":"1359-1393","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient processing of all neighboring object group queries with budget range constraint in road networks"],"prefix":"10.1007","volume":"106","author":[{"given":"Yuan-Ko","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien-Pang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,16]]},"reference":[{"issue":"5","key":"1260_CR1","first-page":"983","volume":"32","author":"T Abeywickrama","year":"2020","unstructured":"Abeywickrama T, Cheema MA, Khan A (2020) K-spin: efficiently processing spatial keyword queries on road networks. TKDE 32(5):983\u2013997","journal-title":"TKDE"},{"issue":"3","key":"1260_CR2","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 CS, Karciauskas G, Saltenis S (2006) Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB J 15(3):229\u2013249","journal-title":"VLDB J"},{"issue":"4","key":"1260_CR3","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1145\/322092.322095","volume":"25","author":"JL Bentley","year":"1978","unstructured":"Bentley JL, Kung HT, Schkolnick M, Thompson CD (1978) On the average number of maxima in a set of vectors and applications. J ACM 25(4):536\u2013543","journal-title":"J ACM"},{"key":"1260_CR4","doi-asserted-by":"crossref","unstructured":"Borzsonyi S, Kossmann D, Stocker K (2001) The skyline operator. In: 17th international conference on data engineering, pp 421\u2013430","DOI":"10.1109\/ICDE.2001.914855"},{"issue":"2","key":"1260_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","author":"T Brinkhoff","year":"2002","unstructured":"Brinkhoff T (2002) A framework for generating network-based moving objects. GeoInformatica 6(2):153\u2013180","journal-title":"GeoInformatica"},{"key":"1260_CR6","doi-asserted-by":"crossref","unstructured":"Brinkhoff T, Kriegel H-P, Seeger B (1993) Efficient processing of spatial joins using r-trees. In: international conference on ACM SIGMOD, pp 237\u2013246","DOI":"10.1145\/170036.170075"},{"issue":"2","key":"1260_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2772600","volume":"40","author":"X Cao","year":"2015","unstructured":"Cao X, Cong G, Guo T, Jensen CS, Ooi BC (2015) Efficient processing of spatial group keyword queries. ACM Trans Database Syst 40(2):1\u201348","journal-title":"ACM Trans Database Syst"},{"issue":"1","key":"1260_CR8","first-page":"373","volume":"3","author":"X Cao","year":"2010","unstructured":"Cao X, Cong G, Jensen CS (2010) Retrieving top-k prestige-based relevant spatial web objects. PVLDB 3(1):373\u2013384","journal-title":"PVLDB"},{"key":"1260_CR9","doi-asserted-by":"crossref","unstructured":"Cao X, Cong G, Jensen CS, Ooi BC (2011) Collective spatial keyword querying. In: ACM SIGMOD, pp 373\u2013384","DOI":"10.1145\/1989323.1989363"},{"issue":"2","key":"1260_CR10","first-page":"1324","volume":"35","author":"HK Chan","year":"2023","unstructured":"Chan HK, Liu S, Long C, Wong RC (2023) Cost-aware and distance-constrained collective spatial keyword query. TKDE 35(2):1324\u20131336","journal-title":"TKDE"},{"key":"1260_CR11","doi-asserted-by":"crossref","unstructured":"Chen J, Cheng R (2007) Efficient evaluation of imprecise location-dependent queries. In: ICDE, pp 586\u2013595","DOI":"10.1109\/ICDE.2007.367904"},{"key":"1260_CR12","doi-asserted-by":"crossref","unstructured":"Chen Y, Patel JM (2007) Efficient evaluation of all-nearest-neighbor queries. In: ICDE, pp 1056\u20131065","DOI":"10.1109\/ICDE.2007.368964"},{"key":"1260_CR13","doi-asserted-by":"crossref","unstructured":"Chung BS, Lee W-C, Chen AL (2009) Processing probabilistic spatio-temporal range queries over moving objects with uncertainty. In: EDBT, pp 60\u201371","DOI":"10.1145\/1516360.1516369"},{"key":"1260_CR14","doi-asserted-by":"crossref","unstructured":"Deng K, Zhou X, Shen HT (2007) Multi-source skyline query processing in road networks. In: international conference on data engineering, pp 796\u2013805","DOI":"10.1109\/ICDE.2007.367925"},{"key":"1260_CR15","first-page":"30","volume":"2","author":"Y Dong","year":"2021","unstructured":"Dong Y, Xiao C, Chen H, Yu JX, Takeoka K, Oyamada M, Kitagawa H (2021) Continuous top-k spatial-keyword search on dynamic objects. VLDB J 2:30\u201351","journal-title":"VLDB J"},{"key":"1260_CR16","doi-asserted-by":"crossref","unstructured":"Ekomie HB, Yao K, Li J, Li G, Li Y (2017) Group top-k spatial keyword query processing in road networks. In: DEXA, pp 395\u2013408","DOI":"10.1007\/978-3-319-64468-4_30"},{"key":"1260_CR17","doi-asserted-by":"crossref","unstructured":"Felipe D, Hristidis V, Rishe N (2008) Keyword search on spatial databases. In: international conference on data engineering, pp 656\u2013665","DOI":"10.1109\/ICDE.2008.4497474"},{"issue":"2","key":"1260_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TITS.2015.2477837","volume":"17","author":"Y Gao","year":"2016","unstructured":"Gao Y, Zhao J, Zheng B, Chen G (2016) Efficient collective spatial keyword query processing on road networks. IEEE Trans Intell Transp Syst 17(2):469\u2013480","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1260_CR19","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"key":"1260_CR20","doi-asserted-by":"crossref","unstructured":"Hjaltason GR, Samet H (1998) Incremental distance join algorithms for spatial databases. In: international conference on ACM SIGMOD, pp 237\u2013248","DOI":"10.1145\/276305.276326"},{"issue":"2","key":"1260_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst 24(2):265\u2013318","journal-title":"ACM Trans Database Syst"},{"key":"1260_CR22","doi-asserted-by":"publisher","first-page":"4887","DOI":"10.1109\/ACCESS.2017.2688472","volume":"5","author":"Y-K Huang","year":"2017","unstructured":"Huang Y-K (2017) Location-based aggregate queries for heterogeneous neighboring objects. IEEE Access 5:4887\u20134899","journal-title":"IEEE Access"},{"issue":"2","key":"1260_CR23","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00607-019-00769-6","volume":"102","author":"Y-K Huang","year":"2020","unstructured":"Huang Y-K (2020) Efficient processing of neighboring skyline queries with consideration of distance, quality, and cost. Computing 102(2):523\u2013550","journal-title":"Computing"},{"issue":"4","key":"1260_CR24","first-page":"921","volume":"36","author":"Y-K Huang","year":"2020","unstructured":"Huang Y-K (2020) Processing location-based aggregate queries in road networks. J Inf Sci Eng 36(4):921\u2013935","journal-title":"J Inf Sci Eng"},{"key":"1260_CR25","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.is.2012.02.003","volume":"37","author":"Y-K Huang","year":"2012","unstructured":"Huang Y-K, Chang C-H, Lee C (2012) Continuous distance-based skyline queries in road networks. Inf Syst 37:611\u2013633","journal-title":"Inf Syst"},{"key":"1260_CR26","doi-asserted-by":"crossref","unstructured":"Huang Y-K, Lin L-F (2011) Continuous within query in road networks. In: IWCMC, pp 1176\u20131181","DOI":"10.1109\/IWCMC.2011.5982707"},{"key":"1260_CR27","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ins.2014.03.040","volume":"278","author":"Y-K Huang","year":"2014","unstructured":"Huang Y-K, Lin L-F (2014) Efficient processing of continuous min\u2013max distance bounded query with updates in road networks. Inf Sci 278:187\u2013205","journal-title":"Inf Sci"},{"key":"1260_CR28","doi-asserted-by":"crossref","unstructured":"Huang Y-K, Lin L-F (2023) Evaluating neighboring site group queries with constraint of budget range. In: ICCCM, pp 1\u20136","DOI":"10.1145\/3617733.3617735"},{"key":"1260_CR29","doi-asserted-by":"crossref","unstructured":"Iwerks G, Samet H, Smith K (2003) Continuous k-nearest neighbor queries for continuously moving points with updates. In: proceedings of the international conference on very large data bases, pp 512\u2013523","DOI":"10.1016\/B978-012722442-8\/50052-5"},{"key":"1260_CR30","doi-asserted-by":"crossref","unstructured":"Kalashnikov DV, Prabhakar S, Hambrusch S, Aref W (2002) Efficient evaluation of continuous range queries on moving objects. In: international conference on database and expert systems applications, pp 731\u2013740","DOI":"10.1007\/3-540-46146-9_72"},{"issue":"2","key":"1260_CR31","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3233\/IDA-195071","volume":"25","author":"J Li","year":"2021","unstructured":"Li J, Xu M (2021) A parametric approximation algorithm for spatial group keyword queries. Intell Data Anal 25(2):305\u2013319","journal-title":"Intell Data Anal"},{"key":"1260_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ins.2017.11.029","volume":"430","author":"Y Li","year":"2018","unstructured":"Li Y, Li G, Li J, Yao K (2018) SKQAI: a novel air index for spatial keyword query processing in road networks. Inf Sci 430:17\u201338","journal-title":"Inf Sci"},{"key":"1260_CR33","doi-asserted-by":"crossref","unstructured":"Li Z, Chen L, Wang Y (2019) G*-tree: an efficient spatial index on road networks. In: ICDE, pp 268\u2013279","DOI":"10.1109\/ICDE.2019.00032"},{"issue":"4","key":"1260_CR34","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TKDE.2011.229","volume":"25","author":"X Lin","year":"2013","unstructured":"Lin X, Xu J, Hu H (2013) Range-based skyline queries in mobile environments. IEEE Trans Knowl Data Eng 25(4):835\u2013849","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1260_CR35","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1145\/503099.503101","volume":"26","author":"N Mamoulis","year":"2001","unstructured":"Mamoulis N, Papadias D (2001) Multiway spatial joins. ACM Trans Database Syst 26(4):424\u2013475","journal-title":"ACM Trans Database Syst"},{"key":"1260_CR36","doi-asserted-by":"crossref","unstructured":"Mokbel MF, Xiong X, Aref WG (2004) SINA: scalable incremental processing of continuous queries in spatio-temporal databases. In: proceedings of the ACM SIGMOD, pp 623\u2013634","DOI":"10.1145\/1007568.1007638"},{"key":"1260_CR37","unstructured":"Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: ICDE, pp 301\u2013312"},{"key":"1260_CR38","doi-asserted-by":"crossref","unstructured":"Papadopoulos A, Manolopoulos Y (1998) Multiple range query optimization in spatial databases. In: ADBIS, pp 71\u201382","DOI":"10.1007\/BFb0057718"},{"key":"1260_CR39","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: proceedings of ACM SIGMOD, pp 71\u201379","DOI":"10.1145\/568271.223794"},{"key":"1260_CR40","unstructured":"Sharifzadeh M, Shahabi C (2006) The spatial skyline queries. In: international conference on very large data bases, pp 751\u2013762"},{"key":"1260_CR41","unstructured":"Sistla AP, Wolfson O, Chamberlain S, Dao S (1997) Modeling and querying moving objects. In: ICDE, pp 422\u2013432"},{"key":"1260_CR42","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ipl.2016.10.008","volume":"118","author":"S Su","year":"2017","unstructured":"Su S, Zhao S, Cheng X, Rong B, Wang J (2017) Group-based collective keyword querying in road networks. Inf Process Lett 118:83\u201390","journal-title":"Inf Process Lett"},{"key":"1260_CR43","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D (2002) Time-parameterized queries in spatio-temporal databases. In: ACM SIGMOD, pp 334\u2013345","DOI":"10.1145\/564691.564730"},{"issue":"6","key":"1260_CR44","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. IEEE Trans Knowl Data Eng 17(6):820\u2013833","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1260_CR45","doi-asserted-by":"crossref","unstructured":"Zhang C, Li F, Jestes J (2012) Efficient parallel KNN joins for large data in MapReduce. In: EDBT","DOI":"10.1145\/2247596.2247602"},{"key":"1260_CR46","doi-asserted-by":"crossref","unstructured":"Zhang D, Chan C-Y, Tan K-L (2013) Nearest group queries. In: international conference on SSDBM","DOI":"10.1145\/2484838.2484866"},{"key":"1260_CR47","doi-asserted-by":"crossref","unstructured":"Zhang D, Chee YM, Mondal A, Tung AKH, Kitsuregawa M (2009) Keyword search in spatial databases: towards searching by document. In: IEEE international conference on data engineering, pp 688\u2013699","DOI":"10.1109\/ICDE.2009.77"},{"key":"1260_CR48","doi-asserted-by":"crossref","unstructured":"Zhang Z, Jin P, Tian Y, Wan S, Yue L (2019) Efficient processing of spatial group preference queries. In: DASFAA, pp 642\u2013659","DOI":"10.1007\/978-3-030-18579-4_38"},{"issue":"3","key":"1260_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10707-017-0299-9","volume":"21","author":"S Zhao","year":"2017","unstructured":"Zhao S, Cheng X, Su S, Shuang K (2017) Popularity-aware collective keyword queries in road networks. GeoInformatica 21(3):1\u201334","journal-title":"GeoInformatica"},{"key":"1260_CR50","doi-asserted-by":"crossref","unstructured":"Zhu L, Jing Y, Sun W, Mao D, Liu P (2010) Voronoi-based aggregate nearest neighbor query processing in road networks. In: SIGSPATIAL, pp 518\u2013521","DOI":"10.1145\/1869790.1869876"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01260-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-024-01260-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01260-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T18:05:02Z","timestamp":1716228302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-024-01260-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,16]]},"references-count":50,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1260"],"URL":"https:\/\/doi.org\/10.1007\/s00607-024-01260-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,16]]},"assertion":[{"value":"26 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}