{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T03:46:30Z","timestamp":1777866390128,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031982071","type":"print"},{"value":"9783031982088","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-98208-8_14","type":"book-chapter","created":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T17:57:08Z","timestamp":1752429428000},"page":"233-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Coherent Index for\u00a0Dichotomy in\u00a0Version-Controlled Repositories"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Yves","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Horn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Euxane","family":"Tran-Girard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/66926.66950","volume":"18","author":"R Agrawal","year":"1989","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. ACM SIGMOD Rec. 18(2), 253\u2013262 (1989)","journal-title":"ACM SIGMOD Rec."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bend\u00edk, J., Benes, N., Cerna, I.: Finding regressions in projects under version control systems. arXiv preprint arXiv:1708.06623 (2017)","DOI":"10.5220\/0006864401860197"},{"key":"14_CR3","unstructured":"Bitbucket. Bitbucket public Mercurial archive (2020). https:\/\/bitbucket-archive.softwareheritage.org\/"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.procs.2023.08.231","volume":"223","author":"L Bulteau","year":"2023","unstructured":"Bulteau, L., David, P.-Y., Horn, F.: The problem of discovery in version control systems. Procedia Comput. Sci. 223, 209\u2013216 (2023)","journal-title":"Procedia Comput. Sci."},{"key":"14_CR5","unstructured":"Bulteau, L., David, P.Y., Horn, F., Tran-Girard, E.: Incremental reachability. In: Proceedings of the 23rd Symposium on Experimental Algorithms (2025)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In: 2008 IEEE 24th International Conference on Data Engineering, pp. 893\u2013902. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"issue":"5","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Courtiel, J., Dorbec, P., Lecoq, R.: Theoretical analysis of git bisect. Algorithmica 1\u201335 (2023)","DOI":"10.21203\/rs.3.rs-2621606\/v1"},{"key":"14_CR9","unstructured":"David, P.-Y.: Hg evolve: obsolescence marker discovery implementation (2017). https:\/\/repo.mercurial-scm.org\/evolve\/file\/11.1.1\/hgext3rd\/evolve\/obsdiscovery.py"},{"key":"14_CR10","first-page":"385","volume":"1","author":"JC Hamano","year":"2006","unstructured":"Hamano, J.C.: GIT-a stupid content tracker. Proc. Ottawa Linux Sympo. 1, 385\u2013394 (2006)","journal-title":"Proc. Ottawa Linux Sympo."},{"key":"14_CR11","first-page":"1","volume":"27","author":"K Hanauer","year":"2022","unstructured":"Hanauer, K., Henzinger, M., Schulz, C.: Recent advances in fully dynamic graph algorithms-a quick reference guide. ACM J. Exp. Algorithmics 27, 1\u201345 (2022)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/99935.99944","volume":"15","author":"HV Jagadish","year":"1990","unstructured":"Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. (TODS) 15(4), 558\u2013598 (1990)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/978-3-030-73197-7_52","volume-title":"Database Systems for Advanced Applications","author":"Q Lyu","year":"2021","unstructured":"Lyu, Q., Li, Y., He, B., Gong, B.: DBL: efficient reachability queries on dynamic graphs. In: Jensen, C.S., et al. (eds.) DASFAA 2021. LNCS, vol. 12682, pp. 761\u2013777. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73197-7_52"},{"key":"14_CR14","first-page":"83","volume":"2","author":"O Mackall","year":"2006","unstructured":"Mackall, O.: Towards a better SCM: Revlog and mercurial. Proc. Ottawa Linux Symp. 2, 83\u201390 (2006)","journal-title":"Proc. Ottawa Linux Symp."},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/32.221137","volume":"19","author":"J Plaice","year":"1993","unstructured":"Plaice, J., Wadge, W.W.: A new approach to version control. IEEE Trans. Softw. Eng. 19(3), 268\u2013276 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"14_CR16","unstructured":"Racinet, G.: Mercurial lazy ancestor iterator Rust implementation (2018). https:\/\/repo.mercurial-scm.org\/hg\/file\/6.6.3\/rust\/hg-core\/src\/ancestors.rs#l123"},{"key":"14_CR17","unstructured":"Stolee, D.: GIT mailing list: [RFC] generation number v2 (2018). https:\/\/lore.kernel.org\/git\/6367e30a-1b3a-4fe9-611b-d931f51effef@gmail.com\/"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/TKDE.2016.2631160","volume":"29","author":"J Su","year":"2016","unstructured":"Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29(3), 683\u2013697 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR19","unstructured":"Synapse. Synapse internal docummentation: State resolution: the auth chain difference algorithm (2021). https:\/\/matrix-org.github.io\/synapse\/v1.98\/auth_chain_difference_algorithm.html#chain-cover-index"},{"key":"14_CR20","unstructured":"Tridgell, A., Mackerras, P., et al.: The rsync algorithm (1996)"},{"issue":"12","key":"14_CR21","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.14778\/2732977.2732992","volume":"7","author":"H Wei","year":"2014","unstructured":"Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. Proc. VLDB Endow. 7(12), 1191\u20131202 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"14_CR22","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Dagger: a scalable index for reachability queries in large dynamic graphs. arXiv preprint arXiv:1301.0977 (2013)"},{"key":"14_CR23","unstructured":"Zhang, C., Bonifati, A., \u00d6zsu, M.T.: Indexing techniques for graph reachability queries. arXiv preprint arXiv:2311.03542 (2023)"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1323\u20131334 (2014)","DOI":"10.1145\/2588555.2612181"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98208-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:36:41Z","timestamp":1777538201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98208-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"ISBN":["9783031982071","9783031982088"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98208-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,9]]},"assertion":[{"value":"9 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cyprusconferences.org\/tase2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}