{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T15:14:21Z","timestamp":1783523661236,"version":"3.55.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"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":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s11390-025-4764-x","type":"journal-article","created":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T06:51:02Z","timestamp":1780901462000},"page":"809-824","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Durable Impact Period Queries on Time-Varying Preference"],"prefix":"10.1007","volume":"41","author":[{"given":"Chu-Han","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian-Zhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shou-Xu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,8]]},"reference":[{"key":"4764_CR1","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1145\/3448016.3452832","volume-title":"Proc. the 2021 International Conference on Management of Data","author":"B Tang","year":"2021","unstructured":"Tang B, Mouratidis K, Han M. On m-impact regions and standing top-k influence problems. In Proc. the 2021 International Conference on Management of Data, Jun. 2021, pp.1784\u20131796. DOI: https:\/\/doi.org\/10.1145\/3448016.3452832."},{"issue":"4","key":"4764_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"I F Ilyas","year":"2008","unstructured":"Ilyas I F, Beskales G, Soliman M A. A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys, 2008, 40(4): 1\u201358. DOI: https:\/\/doi.org\/10.1145\/1391729.1391730.","journal-title":"ACM Computing Surveys"},{"key":"4764_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/ICDE.2010.5447890","volume-title":"Proc. the 26th International Conference on Data Engineering (ICDE 2010)","author":"A Vlachou","year":"2010","unstructured":"Vlachou A, Doulkeridis C, Kotidis Y, N\u00f8rv\u00e5g K. Reverse top-k queries. In Proc. the 26th International Conference on Data Engineering (ICDE 2010), Mar. 2010, pp.365\u2013376. DOI: https:\/\/doi.org\/10.1109\/ICDE.2010.5447890."},{"issue":"8","key":"4764_CR4","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TKDE.2011.50","volume":"23","author":"A Vlachou","year":"2011","unstructured":"Vlachou A, Doulkeridis C, Kotidis Y, Norvag K. Monochromatic and bichromatic reverse top-k queries. IEEE Trans. on Knowledge and Data Engineering, 2011, 23(8): 1215\u20131229. DOI: https:\/\/doi.org\/10.1109\/TKDE.2011.50.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"4764_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.eswa.2018.09.010","volume":"116","author":"F Zafari","year":"2019","unstructured":"Zafari F, Moser I, Baarslag T. Modelling and analysis of temporal preference drifts using a component-based factorised latent approach. Expert Systems with Applications, 2019, 116: 186\u2013208. DOI: https:\/\/doi.org\/10.1016\/j.eswa.2018.09.010.","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"4764_CR6","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1007\/s10994-018-5740-2","volume":"107","author":"F S F Pereira","year":"2018","unstructured":"Pereira F S F, Gama J, de Amo S, Oliveira G M B. On analyzing user preference dynamics with temporal social networks. Machine Learning, 2018, 107(11): 1745\u20131773. DOI: https:\/\/doi.org\/10.1007\/S10994-018-5740-2.","journal-title":"Machine Learning"},{"key":"4764_CR7","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/1835804.1835896","volume-title":"Proc. the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"L Xiang","year":"2010","unstructured":"Xiang L, Yuan Q, Zhao S, Chen L, Zhang X, Yang Q, Sun J. Temporal recommendation on graphs via long and short-term preference fusion. In Proc. the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Jul. 2010, pp.723\u2013732. DOI: https:\/\/doi.org\/10.1145\/1835804.1835896."},{"key":"4764_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1609\/aaai.v25i1.7836","volume-title":"Proc. the 25th AAAI Conference on Artificial Intelligence","author":"R Li","year":"2011","unstructured":"Li R, Li B, Jin C, Xue X, Zhu X. Tracking user-preference varying speed in collaborative filtering. In Proc. the 25th AAAI Conference on Artificial Intelligence, Aug. 2011, pp.133\u2013138. DOI: https:\/\/doi.org\/10.1609\/aaai.v25i1.7836."},{"key":"4764_CR9","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1145\/3583780.3614921","volume-title":"Proc. the 32nd ACM International Conference on Information and Knowledge Management","author":"C Shen","year":"2023","unstructured":"Shen C, Zhang X, Wei W, Xu J. HyperBandit: Contextual bandit with hypernewtork for time-varying user preferences in streaming recommendation. In Proc. the 32nd ACM International Conference on Information and Knowledge Management, Oct. 2023, pp.2239\u20132248. DOI: https:\/\/doi.org\/10.1145\/3583780.3614921."},{"issue":"11","key":"4764_CR10","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.14778\/2809974.2809992","volume":"8","author":"L Qian","year":"2015","unstructured":"Qian L, Gao J, Jagadish H V. Learning user preferences by adaptive pairwise comparison. Proceedings of the VLDB Endowment, 2015, 8(11): 1322\u20131333. DOI: https:\/\/doi.org\/10.14778\/2809974.2809992.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"4764_CR11","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.5555\/2832415.2832497","volume-title":"Proc. the 24th International Conference on Artificial Intelligence","author":"X Liu","year":"2015","unstructured":"Liu X. Modeling users\u2019 dynamic preference for personalized recommendation. In Proc. the 24th International Conference on Artificial Intelligence, Jul. 2015, pp.1785\u20131791. DOI: https:\/\/doi.org\/10.5555\/2832415.2832497."},{"key":"4764_CR12","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/2463676.2465278","volume-title":"Proc. the 2013 ACM SIGMOD International Conference on Management of Data","author":"A Vlachou","year":"2013","unstructured":"Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K, Kotidis Y. Branch-and-bound algorithm for reverse top-k queries. In Proc. the 2013 ACM SIGMOD International Conference on Management of Data, Jun. 2013, pp.481\u2013492. DOI: https:\/\/doi.org\/10.1145\/2463676.2465278."},{"key":"4764_CR13","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1145\/3035918.3064044","volume-title":"Proc. the 2017 ACM International Conference on Management of Data","author":"B Tang","year":"2017","unstructured":"Tang B, Mouratidis K, Yiu M L. Determining the impact regions of competing options in preference space. In Proc. the 2017 ACM International Conference on Management of Data, May 2017, pp.805\u2013820. DOI: https:\/\/doi.org\/10.1145\/3035918.3064044."},{"key":"4764_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/2213836.2213882","volume-title":"Proc. the 2012 ACM SIGMOD International Conference on Management of Data","author":"A Yu","year":"2012","unstructured":"Yu A, Agarwal P K, Yang J. Processing a large number of continuous preference top-k queries. In Proc. the 2012 ACM SIGMOD International Conference on Management of Data, May 2012, pp.397\u2013408. DOI: https:\/\/doi.org\/10.1145\/2213836.2213882."},{"key":"4764_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-00887-0_5","volume-title":"Lecture Notes in Computer Science 5463","author":"M L Lee","year":"2009","unstructured":"Lee M L, Hsu W, Li L, Tok W H. Consistent top-k queries over time. In Lecture Notes in Computer Science 5463, Zhou X, Yokota H, Deng K, Liu Q (eds.), Springer, 2009, pp.51\u201365. DOI: https:\/\/doi.org\/10.1007\/978-3-642-00887-0_5."},{"issue":"3","key":"4764_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TKDE.2013.10","volume":"26","author":"H Wang","year":"2014","unstructured":"Wang H, Cai Y, Yang Y, Zhang S, Mamoulis N. Durable queries over historical time series. IEEE Trans. on Knowledge and Data Engineering, 2014, 26(3): 595\u2013607. DOI: https:\/\/doi.org\/10.1109\/TKDE.2013.10.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"issue":"13","key":"4764_CR17","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.14778\/3275366.3284967","volume":"11","author":"J Gao","year":"2018","unstructured":"Gao J, Agarwal P K, Yang J. Durable top-k queries on temporal data. Proceedings of the VLDB Endowment, 2018, 11(13): 2223\u20132235. DOI: https:\/\/doi.org\/10.14778\/3275366.3284967.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"4764_CR18","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/1807167.1807228","volume-title":"Proc. the 2010 ACM SIGMOD International Conference on Management of Data","author":"U Leong Hou","year":"2010","unstructured":"Leong Hou U, Mamoulis N, Berberich K, Bedathur S. Durable top-k search in document archives. In Proc. the 2010 ACM SIGMOD International Conference on Management of Data, Jun. 2010, pp.555\u2013566. DOI: https:\/\/doi.org\/10.1145\/1807167.1807228."},{"key":"4764_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/ICDE.2016.7498269","volume-title":"Proc. the 32nd International Conference on Data Engineering (ICDE)","author":"K Semertzidis","year":"2016","unstructured":"Semertzidis K, Pitoura E. Durable graph pattern queries on historical graphs. In Proc. the 32nd International Conference on Data Engineering (ICDE), May 2016, pp.541\u2013552. DOI: https:\/\/doi.org\/10.1109\/ICDE.2016.7498269."},{"issue":"1","key":"4764_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TKDE.2018.2823754","volume":"31","author":"K Semertzidis","year":"2019","unstructured":"Semertzidis K, Pitoura E. Top-k durable graph pattern queries on temporal graphs. IEEE Trans. on Knowledge and Data Engineering, 2019, 31(1): 181\u2013194. DOI: https:\/\/doi.org\/10.1109\/TKDE.2018.2823754.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"issue":"5","key":"4764_CR21","doi-asserted-by":"publisher","first-page":"4713","DOI":"10.1109\/TKDE.2022.3148995","volume":"35","author":"F Li","year":"2023","unstructured":"Li F, Zou Z, Li J. Durable subgraph matching on temporal graphs. IEEE Trans. on Knowledge and Data Engineering, 2023, 35(5): 4713\u20134726. DOI: https:\/\/doi.org\/10.1109\/TKDE.2022.3148995.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"4764_CR22","doi-asserted-by":"publisher","first-page":"110561","DOI":"10.1016\/j.knosys.2023.110561","volume":"271","author":"F Li","year":"2023","unstructured":"Li F, Zou Z, Liu X, Li J, Yang X, Wang B. Detecting maximum k-durable structures on temporal graphs. Knowledge-Based Systems, 2023, 271: 110561. DOI: https:\/\/doi.org\/10.1016\/J.KNOSYS.2023.110561.","journal-title":"Knowledge-Based Systems"},{"key":"4764_CR23","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1145\/142675.142732","volume-title":"Proc. the 8th Annual Symposium on Computational Geometry","author":"J Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek J. Range searching with efficient hierarchical cuttings. In Proc. the 8th Annual Symposium on Computational Geometry, Jun. 1992, pp.276\u2013285. DOI: https:\/\/doi.org\/10.1145\/142675.142732."},{"key":"4764_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1810959.1810961","volume-title":"Proc. the 26th Annual Symposium on Computational Geometry","author":"T M Chan","year":"2010","unstructured":"Chan T M. Optimal partition trees. In Proc. the 26th Annual Symposium on Computational Geometry, Jun. 2010, pp.1\u201310. DOI: https:\/\/doi.org\/10.1145\/1810959.1810961."},{"key":"4764_CR25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1810959.1810964","volume-title":"Proc. the 26th Annual Symposium on Computational Geometry","author":"S Arya","year":"2010","unstructured":"Arya S, Mount D M, Xia J. Tight lower bounds for halfspace range searching. In Proc. the 26th Annual Symposium on Computational Geometry, Jun. 2010, pp.29\u201337. DOI: https:\/\/doi.org\/10.1145\/1810959.1810964."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-4764-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-025-4764-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-4764-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T14:22:04Z","timestamp":1783520524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-025-4764-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["4764"],"URL":"https:\/\/doi.org\/10.1007\/s11390-025-4764-x","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"25 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Conflict of Interest\n                      The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}