{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T06:33:48Z","timestamp":1768804428659,"version":"3.49.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:00:00Z","timestamp":1620432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:00:00Z","timestamp":1620432000000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s00778-021-00674-5","type":"journal-article","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T06:05:44Z","timestamp":1620453944000},"page":"799-823","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient Hop-constrained s-t Simple Path Enumeration"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5115-0872","authenticated-orcid":false,"given":"You","family":"Peng","sequence":"first","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,8]]},"reference":[{"key":"674_CR1","first-page":"1","volume":"18","author":"I Abraham","year":"2013","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative routes in road networks. Journal of Experimental Algorithmics (JEA) 18, 1\u20131 (2013)","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"issue":"2","key":"674_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V Akg\u00fcn","year":"2000","unstructured":"Akg\u00fcn, V., Erkut, E., Batta, R.: On finding dissimilar paths. European Journal of Operational Research 121(2), 232\u2013246 (2000)","journal-title":"European Journal of Operational Research"},{"key":"674_CR3","doi-asserted-by":"crossref","unstructured":"Birmel\u00e9, E., Ferreira, R.A., Grossi, R., Marino, A., Pisanti, N., Rizzi, R., Sacomoto, G.: Optimal listing of cycles and st-paths in undirected graphs. In SODA, pages 1884\u20131896, (2013)","DOI":"10.1137\/1.9781611973105.134"},{"key":"674_CR4","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lee, H.C., Ye, H.C.: Max-sum diversification, monotone submodular functions and dynamic updates. In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, pages 155\u2013166, (2012)","DOI":"10.1145\/2213556.2213580"},{"key":"674_CR5","unstructured":"Chang, L., Lin, X., Qin, L., Yu, J.X., Pei, J.: Efficiently computing top-k shortest path join. In EDBT 2015-18th International Conference on Extending Database Technology, Proceedings, (2015)"},{"key":"674_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Lai, L., Qin, L., Lin, X., Liu, B.: A framework to quantify approximate simulation on graph data. arXiv preprint arXiv:2010.08938, (2020)","DOI":"10.1109\/ICDE51399.2021.00117"},{"key":"674_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Li, J., Sterbenz, J.P.: Path geo-diversification: Design and analysis. In 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pages 46\u201353. IEEE, (2013)","DOI":"10.1109\/ICUMT.2013.6798403"},{"key":"674_CR8","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-dissimilar paths with minimum collective length. In Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 404\u2013407, (2018)"},{"key":"674_CR9","doi-asserted-by":"crossref","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-shortest paths with limited overlap. The VLDB Journal, pages 1\u201325, (2020)","DOI":"10.1007\/s00778-020-00604-x"},{"key":"674_CR10","doi-asserted-by":"crossref","unstructured":"Clarke, C.L., Kolla, M., Cormack, G.V., Vechtomova, O., Ashkan, A., B\u00fcttcher, S., MacKinnon, I.: Novelty and diversity in information retrieval evaluation. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pages 659\u2013666, (2008)","DOI":"10.1145\/1390334.1390446"},{"key":"674_CR11","doi-asserted-by":"crossref","unstructured":"de\u00a0Queir\u00f3s Vieira\u00a0Martins, E., Pascoal, M.M.B.: A new implementation of yen\u2019s ranking loopless paths algorithm. 4OR, 1(2):121\u2013133, (2003)","DOI":"10.1007\/s10288-002-0010-2"},{"key":"674_CR12","doi-asserted-by":"crossref","unstructured":"Deng, D., Tao, Y., Li, G.: Overlap set similarity joins with theoretical guarantees. In Proceedings of the 2018 International Conference on Management of Data, pages 905\u2013920, (2018)","DOI":"10.1145\/3183713.3183748"},{"issue":"1","key":"674_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1860702.1860709","volume":"39","author":"M Drosou","year":"2010","unstructured":"Drosou, M., Pitoura, E.: Search result diversification. ACM. SIGMOD Record 39(1), 41\u201347 (2010)","journal-title":"SIGMOD Record"},{"key":"674_CR14","doi-asserted-by":"crossref","unstructured":"Drosou, M., Pitoura, E.: Disc diversity: result diversification based on dissimilarity and coverage. arXiv preprint arXiv:1208.3533, (2012)","DOI":"10.14778\/2428536.2428538"},{"issue":"6","key":"674_CR15","doi-asserted-by":"publisher","first-page":"709","DOI":"10.14778\/3055330.3055337","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. Proceedings of the VLDB Endowment 10(6), 709\u2013720 (2017)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"12","key":"674_CR16","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. Proceedings of the VLDB Endowment 9(12), 1233\u20131244 (2016)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"12","key":"674_CR17","doi-asserted-by":"publisher","first-page":"1885","DOI":"10.14778\/3137765.3137800","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J., Huang, K.: C-explorer: browsing communities in large graphs. Proceedings of the VLDB Endowment 10(12), 1885\u20131888 (2017)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"674_CR18","doi-asserted-by":"crossref","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. The VLDB Journal, (2019)","DOI":"10.1007\/s00778-019-00556-x"},{"key":"674_CR19","doi-asserted-by":"crossref","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. IEEE Transactions on Knowledge and Data Engineering (2018)","DOI":"10.1109\/ICDE.2019.00273"},{"key":"674_CR20","doi-asserted-by":"crossref","unstructured":"Freitas, A., da\u00a0Silva, J.C.P., Curry, E., Buitelaar, P.: A distributional semantics approach for selective reasoning on commonsense graph knowledge bases. In International Conference on Applications of Natural Language to Data Bases\/Information Systems, pages 21\u201332. Springer, (2014)","DOI":"10.1007\/978-3-319-07983-7_3"},{"issue":"4","key":"674_CR21","doi-asserted-by":"publisher","first-page":"358","DOI":"10.14778\/2095686.2095694","volume":"5","author":"J Gao","year":"2011","unstructured":"Gao, J., Jin, R., Zhou, J., Yu, J.X., Jiang, X., Wang, T.: Relational approach for shortest path discovery over large graphs. Proceedings of the VLDB Endowment 5(4), 358\u2013369 (2011)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"674_CR22","doi-asserted-by":"crossref","unstructured":"Gao, J., Qiu, H., Jiang, X., Wang, T., Yang, D.: Fast top-k simple shortest paths discovery in graphs. In Proceedings of the 19th ACM international conference on Information and knowledge management, pages 509\u2013518. ACM, (2010)","DOI":"10.1145\/1871437.1871504"},{"key":"674_CR23","doi-asserted-by":"crossref","unstructured":"Grossi, R., Marino, A., Versari, L.: Efficient algorithms for listing k disjoint st-paths in graphs. In Latin American Symposium on Theoretical Informatics, pages 544\u2013557. Springer, (2018)","DOI":"10.1007\/978-3-319-77404-6_40"},{"key":"674_CR24","unstructured":"Henao-Mazo, W., Bravo-Santos, A.: Finding diverse shortest paths for the routing task in wireless sensor networks. In Proc. 7th Int. Conf. Syst. Netw. Commun., pages 53\u201358, (2012)"},{"issue":"4","key":"674_CR25","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.1080.0524","volume":"56","author":"DS Hochbaum","year":"2008","unstructured":"Hochbaum, D.S.: The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research 56(4), 992\u20131009 (2008)","journal-title":"Operations Research"},{"key":"674_CR26","unstructured":"Hu, P., Lau, W.C.: A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865, (2013)"},{"issue":"1","key":"674_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12205-010-0041-8","volume":"14","author":"Y-J Jeong","year":"2010","unstructured":"Jeong, Y.-J., Kim, T.J., Park, C.-H., Kim, D.-K.: A dissimilar alternative paths-search algorithm for navigation services: A heuristic approach. KSCE Journal of Civil Engineering 14(1), 41\u201349 (2010)","journal-title":"KSCE Journal of Civil Engineering"},{"key":"674_CR28","unstructured":"Jin, R., Ruan, N.: Shortest path computation in large networks, Dec.\u00a019 (2013). US Patent App. 13\/899,124"},{"key":"674_CR29","doi-asserted-by":"crossref","unstructured":"Jin, X., Yang, Z., Lin, X., Yang, S., Qin, L., Peng, Y.: Fast: Fpga-based subgraph matching on massive graphs. arXiv preprint arXiv:2102.10768, (2021)","DOI":"10.1109\/ICDE51399.2021.00129"},{"issue":"1","key":"674_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"674_CR31","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"674_CR32","unstructured":"Khan, H.A., Drosou, M., Sharaf, M.A.: Dos: an efficient scheme for the diversification of multiple search results. In Proceedings of the 25th International Conference on Scientific and Statistical Database Management, pages 1\u20134, (2013)"},{"issue":"4","key":"674_CR33","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s00778-013-0336-8","volume":"23","author":"J-L Koh","year":"2014","unstructured":"Koh, J.-L., Lin, C.-Y., Chen, A.L.: Finding k most favorite products based on reverse top-t queries. The VLDB journal 23(4), 541\u2013564 (2014)","journal-title":"The VLDB journal"},{"key":"674_CR34","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the koblenz network collection. In Proceedings of the 22nd International Conference on World Wide Web, pages 1343\u20131350. ACM, (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"674_CR35","doi-asserted-by":"crossref","unstructured":"Lai, Z., Peng, Y., Yang, S., Lin, X., Zhang, W.: Pefp: Efficient k-hop constrained st simple path enumeration on fpga. arXiv preprint arXiv:2012.11128, (2020)","DOI":"10.1109\/ICDE51399.2021.00118"},{"issue":"1","key":"674_CR36","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao, N., Cohen, W.W.: Relational retrieval using a combination of path-constrained random walks. Machine Learning 81(1), 53\u201367 (2010)","journal-title":"Machine Learning"},{"key":"674_CR37","doi-asserted-by":"crossref","unstructured":"Leser, U.: A query language for biological networks. Bioinformatics, 21:ii33\u20139, 10 (2005)","DOI":"10.1093\/bioinformatics\/bti1105"},{"key":"674_CR38","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data, (2014)"},{"key":"674_CR39","first-page":"1426","volume":"6","author":"Y Lim","year":"2005","unstructured":"Lim, Y., Kim, H.: A shortest path algorithm for real road network based on path overlap. Journal of the Eastern Asia Society for Transportation Studies 6, 1426\u20131438 (2005)","journal-title":"Journal of the Eastern Asia Society for Transportation Studies"},{"key":"674_CR40","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (a, $$\\beta $$)-core computation: an index-based approach. In The World Wide Web Conference, pages 1130\u20131141. ACM, (2019)","DOI":"10.1145\/3308558.3313522"},{"issue":"3","key":"674_CR41","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TKDE.2017.2773492","volume":"30","author":"H Liu","year":"2017","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE Transactions on Knowledge and Data Engineering 30(3), 488\u2013502 (2017)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"674_CR42","doi-asserted-by":"crossref","unstructured":"Mazumder, S., Liu, B.: Context-aware path ranking for knowledge base completion. In IJCAI, pages 1195\u20131201, (2017)","DOI":"10.24963\/ijcai.2017\/166"},{"issue":"6","key":"674_CR43","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/3380750.3380753","volume":"13","author":"Y Peng","year":"2020","unstructured":"Peng, Y., Zhang, Y., Lin, X., Qin, L., Zhang, W.: Answering billion-scale label-constrained reachability queries within microsecond. Proceedings of the VLDB Endowment 13(6), 812\u2013825 (2020)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"674_CR44","doi-asserted-by":"publisher","first-page":"463","DOI":"10.14778\/3372716.3372720","volume":"13","author":"Y Peng","year":"2019","unstructured":"Peng, Y., Zhang, Y., Lin, X., Zhang, W., Qin, L., Zhou, J.: Towards bridging theory and practice: hop-constrained st simple path enumeration. Proceedings of the VLDB Endowment 13(4), 463\u2013476 (2019)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"674_CR45","doi-asserted-by":"crossref","unstructured":"Peng, Y., Zhang, Y., Zhang, W., Lin, X., Qin, L.: Efficient probabilistic k-core computation on uncertain graphs. In 2018 IEEE 34th International Conference on Data Engineering (ICDE), pages 1192\u20131203. IEEE, (2018)","DOI":"10.1109\/ICDE.2018.00110"},{"issue":"12","key":"674_CR46","first-page":"1876","volume":"11","author":"X Qiu","year":"2018","unstructured":"Qiu, X., Cen, W., Qian, Z., Peng, Y., Zhang, Y., Lin, X., Zhou, J.: Real-time constrained cycle detection in large dynamic graphs. PVLDB 11(12), 1876\u20131888 (2018)","journal-title":"PVLDB"},{"key":"674_CR47","doi-asserted-by":"crossref","unstructured":"Rizzi, R., Sacomoto, G., Sagot, M.: Efficiently listing bounded length st-paths. In IWOCA, pages 318\u2013329, (2014)","DOI":"10.1007\/978-3-319-19315-1_28"},{"key":"674_CR48","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: Replacement paths and k simple shortest paths in unweighted directed graphs. In International Colloquium on Automata, Languages, and Programming, pages 249\u2013260. Springer, (2005)","DOI":"10.1007\/11523468_21"},{"key":"674_CR49","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In AAAI, (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"674_CR50","doi-asserted-by":"crossref","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv., 46(4):45:1\u201345:31, (2014)","DOI":"10.1145\/2530531"},{"issue":"1","key":"674_CR51","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ejor.2015.01.019","volume":"244","author":"L Talarico","year":"2015","unstructured":"Talarico, L., S\u00f6rensen, K., Springael, J.: The k-dissimilar vehicle routing problem. European Journal of Operational Research 244(1), 129\u2013140 (2015)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"674_CR52","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3), 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"674_CR53","doi-asserted-by":"crossref","unstructured":"Voss, C., Moll, M., Kavraki, L.E.: A heuristic approach to finding diverse short paths. In 2015 IEEE International Conference on Robotics and Automation (ICRA), pages 4173\u20134179. IEEE, (2015)","DOI":"10.1109\/ICRA.2015.7139774"},{"key":"674_CR54","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In 2018 IEEE 34th International Conference on Data Engineering (ICDE), pages 233\u2013244. IEEE, (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"key":"674_CR55","doi-asserted-by":"crossref","unstructured":"Wang, S., Cheema, M.A., Zhang, Y., Lin, X.: Selecting representative objects considering coverage and diversity. In Second International ACM Workshop on Managing and Mining Enriched Geo-Spatial Data, pages 31\u201338, (2015)","DOI":"10.1145\/2786006.2786012"},{"key":"674_CR56","doi-asserted-by":"crossref","unstructured":"Yang, Z., Lai, L., Lin, X., Hao, K., Zhang, W.: Huge: An efficient and scalable subgraph enumeration system. arXiv preprint arXiv:2103.14294, (2021)","DOI":"10.1145\/3448016.3457237"},{"issue":"11","key":"674_CR57","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Management Science 17(11), 712\u2013716 (1971)","journal-title":"Management Science"},{"key":"674_CR58","doi-asserted-by":"crossref","unstructured":"Yu, C., Lakshmanan, L., Amer-Yahia, S.: It takes variety to make a world: diversification in recommender systems. In Proceedings of the 12th international conference on extending database technology: Advances in database technology, pages 368\u2013378, (2009)","DOI":"10.1145\/1516360.1516404"},{"key":"674_CR59","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Cheng, J.: Graph reachability queries: A survey. In Managing and Mining Graph Data, pages 181\u2013215. (2010)","DOI":"10.1007\/978-1-4419-6045-0_6"},{"issue":"2","key":"674_CR60","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. The VLDB Journal 25(2), 171\u2013196 (2016)","journal-title":"The VLDB Journal"},{"key":"674_CR61","doi-asserted-by":"crossref","unstructured":"Yue, D., Wu, X., Wang, Y., Li, Y., Chu, C.: A review of data mining-based financial fraud detection research. In International Conference on Wireless Communications, Networking and Mobile Computing, pages 5519 \u2013 5522, 10 (2007)","DOI":"10.1109\/WICOM.2007.1352"},{"key":"674_CR62","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Callan, J., Minka, T.: Novelty and redundancy detection in adaptive filtering. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, pages 81\u201388, (2002)","DOI":"10.1145\/564376.564393"},{"issue":"1","key":"674_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-016-0990-4","volume":"51","author":"K Zheng","year":"2017","unstructured":"Zheng, K., Wang, H., Qi, Z., Li, J., Gao, H.: A survey of query result diversification. Knowledge and Information Systems 51(1), 1\u201336 (2017)","journal-title":"Knowledge and Information Systems"},{"key":"674_CR64","doi-asserted-by":"crossref","unstructured":"Ziegler, C.-N., McNee, S.M., Konstan, J.A., Lausen, G.: Improving recommendation lists through topic diversification. In Proceedings of the 14th international conference on World Wide Web, pages 22\u201332, (2005)","DOI":"10.1145\/1060745.1060754"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00674-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00674-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00674-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T18:44:53Z","timestamp":1672080293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00674-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,8]]},"references-count":64,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["674"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00674-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,8]]},"assertion":[{"value":"11 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}