{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:46Z","timestamp":1740123826068,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:00:00Z","timestamp":1722556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:00:00Z","timestamp":1722556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NO. 61832003"],"award-info":[{"award-number":["NO. 61832003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11280-024-01293-0","type":"journal-article","created":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T12:58:54Z","timestamp":1722603534000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Durable reverse top-k queries on time-varying preference"],"prefix":"10.1007","volume":"27","author":[{"given":"Chuhan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouxu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,2]]},"reference":[{"issue":"4","key":"1293_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF 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 Comput. Surv. (CSUR) 40(4), 1\u201358 (2008)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"1293_CR2","unstructured":"Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 451\u2013462 (2006)"},{"issue":"6","key":"1293_CR3","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/j.is.2011.03.010","volume":"36","author":"R Akbarinia","year":"2011","unstructured":"Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for efficient top-k query processing. Inf. Syst. 36(6), 973\u2013989 (2011)","journal-title":"Inf. Syst."},{"key":"1293_CR4","doi-asserted-by":"crossref","unstructured":"Shanbhag, A., Pirk, H., Madden, S.: Efficient top-k query processing on massively parallel hardware. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1557\u20131570 (2018)","DOI":"10.1145\/3183713.3183735"},{"key":"1293_CR5","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., Kotidis, Y., N\u00f8rv\u00e5g, K.: Reverse top-k queries. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 365\u2013376 (2010). IEEE","DOI":"10.1109\/ICDE.2010.5447890"},{"issue":"8","key":"1293_CR6","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. Knowl. Data Eng. 23(8), 1215\u20131229 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1293_CR7","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: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 481\u2013492 (2013)","DOI":"10.1145\/2463676.2465278"},{"issue":"1\u20132","key":"1293_CR8","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1920841.1920890","volume":"3","author":"A Vlachou","year":"2010","unstructured":"Vlachou, A., Doulkeridis, C., N\u00f8rv\u00e5g, K., Kotidis, Y.: Identifying the most influential data objects with reverse top-k queries. Proc. VLDB Endow. 3(1\u20132), 364\u2013372 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"1293_CR9","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., N\u00f8rv\u00e5g, K.: Monitoring reverse top-k queries over mobile devices. In: Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 17\u201324 (2011)","DOI":"10.1145\/1999309.1999313"},{"key":"1293_CR10","doi-asserted-by":"crossref","unstructured":"Nikitopoulos, P., Sfyris, G.A., Vlachou, A., Doulkeridis, C., Telelis, O.: Parallel and distributed processing of reverse top-k queries. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1586\u20131589 (2019). IEEE","DOI":"10.1109\/ICDE.2019.00148"},{"key":"1293_CR11","doi-asserted-by":"crossref","unstructured":"Yu, A., Agarwal, P.K., Yang, J.: Processing a large number of continuous preference top-k queries. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 397\u2013408 (2012)","DOI":"10.1145\/2213836.2213882"},{"key":"1293_CR12","volume-title":"Top-k and Reverse Top-k Queries Over Spatio-Temporal Ranges","author":"P Ahmed","year":"2020","unstructured":"Ahmed, P.: Top-k and Reverse Top-k Queries Over Spatio-Temporal Ranges. University of California, Riverside, Riverside (2020)"},{"key":"1293_CR13","doi-asserted-by":"crossref","unstructured":"Ahmed, P., Eldawy, A., Hristidis, V., Tsotras, V.J.: Reverse spatial top-k keyword queries. VLDB J. 1\u201324 (2022)","DOI":"10.1007\/s00778-022-00759-9"},{"key":"1293_CR14","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 Syst. Appl. 116, 186\u2013208 (2019)","journal-title":"Expert Syst. Appl."},{"key":"1293_CR15","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1007\/s10994-018-5740-2","volume":"107","author":"FS Pereira","year":"2018","unstructured":"Pereira, F.S., Gama, J., Amo, S., Oliveira, G.M.: On analyzing user preference dynamics with temporal social networks. Mach. Learn. 107, 1745\u20131773 (2018)","journal-title":"Mach. Learn."},{"key":"1293_CR16","doi-asserted-by":"crossref","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: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 723\u2013732 (2010)","DOI":"10.1145\/1835804.1835896"},{"key":"1293_CR17","doi-asserted-by":"crossref","unstructured":"Li, R., Li, B., Jin, C., Xue, X., Zhu, X.: Tracking user-preference varying speed in collaborative filtering. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 25, pp. 133\u2013138 (2011)","DOI":"10.1609\/aaai.v25i1.7836"},{"issue":"13","key":"1293_CR18","first-page":"2223","volume":"11","author":"J Gao","year":"2018","unstructured":"Gao, J., Agarwal, P.K., Yang, J.: Durable top-k queries on temporal data. Proc. VLDB Endow. 11(13), 2223\u20132235 (2018)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"1293_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/2380776.2380786","volume":"41","author":"K Kulkarni","year":"2012","unstructured":"Kulkarni, K., Michels, J.-E.: Temporal features in sql: 2011. ACM Sigmod Rec. 41(3), 34\u201343 (2012)","journal-title":"ACM Sigmod Rec."},{"key":"1293_CR20","doi-asserted-by":"crossref","unstructured":"Lee, M.L., Hsu, W., Li, L., Tok, W.H.: Consistent top-k queries over time. In: Database Systems for Advanced Applications: 14th International Conference, DASFAA 2009, Brisbane, Australia, April 21-23, 2009. Proceedings 14, pp. 51\u201365 (2009). Springer","DOI":"10.1007\/978-3-642-00887-0_5"},{"key":"1293_CR21","unstructured":"Leong\u00a0Hou, U., Mamoulis, N., Berberich, K., Bedathur, S.: Durable top-k search in document archives. In: Proceedings of the 2010 International Conference on Management of Data, SIGMOD, vol. 10, pp. 555\u2013566 (2010)"},{"issue":"3","key":"1293_CR22","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TKDE.2013.10","volume":"26","author":"H Wang","year":"2013","unstructured":"Wang, H., Cai, Y., Yang, Y., Zhang, S., Mamoulis, N.: Durable queries over historical time series. IEEE Trans. Knowl. Data Eng. 26(3), 595\u2013607 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1293_CR23","doi-asserted-by":"crossref","unstructured":"Xie, Y., Weng, W., Li, J.: Durable queries over non-synchronized temporal data. World Wide Web 1\u201315 (2022)","DOI":"10.21203\/rs.3.rs-2120736\/v1"},{"key":"1293_CR24","doi-asserted-by":"crossref","unstructured":"Gao, J., Sintos, S., Agarwal, P.K., Yang, J.: Durable top-k instant-stamped temporal records with user-specified scoring functions. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 720\u2013731 (2021). IEEE","DOI":"10.1109\/ICDE51399.2021.00068"},{"key":"1293_CR25","doi-asserted-by":"crossref","unstructured":"Semertzidis, K., Pitoura, E.: Durable graph pattern queries on historical graphs. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 541\u2013552 (2016). IEEE","DOI":"10.1109\/ICDE.2016.7498269"},{"issue":"1","key":"1293_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TKDE.2018.2823754","volume":"31","author":"K Semertzidis","year":"2018","unstructured":"Semertzidis, K., Pitoura, E.: Top-$$ k $$ durable graph pattern queries on temporal graphs. IEEE Trans. Knowl. Data Eng. 31(1), 181\u2013194 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1293_CR27","doi-asserted-by":"crossref","unstructured":"Li, F., Zou, Z., Li, J.: Durable subgraph matching on temporal graphs. IEEE Trans. Knowl. Data Eng. (2022)","DOI":"10.1109\/TKDE.2022.3148995"},{"key":"1293_CR28","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. Knowl.-Based Syst. 271, 110561 (2023)","journal-title":"Knowl.-Based Syst."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01293-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-024-01293-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01293-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T14:13:18Z","timestamp":1726841598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-024-01293-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,2]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1293"],"URL":"https:\/\/doi.org\/10.1007\/s11280-024-01293-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2024,8,2]]},"assertion":[{"value":"1 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2024","order":4,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"54"}}