{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:36:46Z","timestamp":1742963806484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031673207"},{"type":"electronic","value":"9783031673214"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-67321-4_2","type":"book-chapter","created":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:02:07Z","timestamp":1724515327000},"page":"32-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Concurrent Wait-Free Graph Snapshots Using Multi-versioning"],"prefix":"10.1007","author":[{"given":"Gaurav","family":"Bhardwaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayaz","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,25]]},"reference":[{"key":"2_CR1","unstructured":"SNAP Stanford network analysis project: wiki-vote dataset. https:\/\/snap.stanford.edu\/data\/wiki-Vote.html. Accessed Mar 2024"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Bhardwaj, G., Peri, S., Shetty, P.: Brief announcement: non-blocking dynamic unbounded graphs with wait-free snapshot. In: Dolev, S., Schieber, B. (eds.) International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pp. 106\u2013110. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44274-2_9","DOI":"10.1007\/978-3-031-44274-2_9"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Brown, T.A.: Reclaiming memory for lock-free data structures: there has to be a better way. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 261\u2013270 (2015)","DOI":"10.1145\/2767386.2767436"},{"key":"2_CR4","unstructured":"Chatterjee, B., Peri, S., Sa, M., Manogna, K.: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: International Conference on Principles of Distributed Systems (2021)"},{"key":"2_CR5","unstructured":"Chatterjee, B., Peri, S., Sa, M., Singhal, N.: A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ICDCN 2019, Bangalore, India, January 04-07, 2019, pp. 168\u2013177 (2019)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, B., Walulya, I., Tsigas, P.: Help-optimal and language-portable lock-free concurrent data structures. In: ICPP, pp. 360\u2013369 (2016)","DOI":"10.1109\/ICPP.2016.48"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-030-31277-0_20","volume-title":"Networked Systems","author":"VP Chaudhary","year":"2019","unstructured":"Chaudhary, V.P., Juyal, C., Kulkarni, S., Kumari, S., Peri, S.: Achieving starvation-freedom in multi-version transactional memory systems. In: Atig, M.F., Schwarzmann, A.A. (eds.) NETYS 2019. LNCS, vol. 11704, pp. 291\u2013310. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31277-0_20"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Feng, G., et al: Risgraph: a real-time streaming system for evolving graphs to support sub-millisecond per-update analysis at millions ops\/s. In: Proceedings of the 2021 International Conference on Management of Data, pp. 513\u2013527 (2021)","DOI":"10.1145\/3448016.3457263"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: DISC, pp. 300\u2013314 (2001)","DOI":"10.1007\/3-540-45414-4_21"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N., Shavit, N.: A lazy concurrent list-based set algorithm. Parallel Process. Lett. 17(4), 411\u2013424 (2007)","DOI":"10.1142\/S0129626407003125"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2009.08.011","volume":"70","author":"D Hendler","year":"2010","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. J. Parallel Distrib. Comput. 70(1), 1\u201312 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR13","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: ICDCS, pp. 522\u2013529 (2003)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: On the nature of progress. In: OPODIS, pp. 313\u2013328 (2011)","DOI":"10.1007\/978-3-642-25873-2_22"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. (TOPLAS) 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"2_CR16","unstructured":"Kallimanis, N.D., Kanellou, E.: Wait-free concurrent graph objects with dynamic traversals. In: OPODIS, pp. 1\u201327 (2015)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Kogan, A., Petrank, E.: Wait-free queues with multiple enqueuers and dequeuers. In: PPOPP, pp. 223\u2013234 (2011)","DOI":"10.1145\/2038037.1941585"},{"issue":"4","key":"2_CR18","first-page":"1","volume":"15","author":"P Kumar","year":"2020","unstructured":"Kumar, P., Huang, H.H.: Graphone: a data store for real-time analytics on evolving graphs. ACM Trans. Storage (TOS) 15(4), 1\u201340 (2020)","journal-title":"ACM Trans. Storage (TOS)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kumar, P., Peri, S., Vidyasankar, K.: A timestamp based multi-version STM algorithm. In: ICDCN, pp. 212\u2013226 (2014)","DOI":"10.1007\/978-3-642-45249-9_14"},{"issue":"5","key":"2_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00446-007-0050-0","volume":"20","author":"E Ladan-Mozes","year":"2008","unstructured":"Ladan-Mozes, E., Shavit, N.: An optimistic approach to lock-free FIFO queues. Distrib. Comput. 20(5), 323\u2013341 (2008)","journal-title":"Distrib. Comput."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhang, K., Spear, M.: Dynamic-sized nonblocking hash tables. In: PODC, pp. 242\u2013251 (2014)","DOI":"10.1145\/2611462.2611495"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA, pp. 73\u201382 (2002)","DOI":"10.1145\/564870.564881"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Nelson, J., Hassan, A., Palmieri, R.: Bundled references: an abstraction for highly-concurrent linearizable range queries. In: Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 448\u2013450 (2021)","DOI":"10.1145\/3437801.3441614"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Petrank, E., Timnat, S.: Lock-free data-structure iterators. In: International Symposium on Distributed Computing (2013)","DOI":"10.1007\/978-3-642-41527-2_16"},{"issue":"8","key":"2_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/2517327.2442530","volume":"48","author":"J Shun","year":"2013","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. SIGPLAN Not. 48(8), 135\u2013146 (2013). https:\/\/doi.org\/10.1145\/2517327.2442530","journal-title":"SIGPLAN Not."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Timnat, S., Braginsky, A., Kogan, A., Petrank, E.: Wait-free linked-lists. In: OPODIS, pp. 330\u2013344 (2012)","DOI":"10.1007\/978-3-642-35476-2_23"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Wei, Y., Ben-David, N., Blelloch, G.E., Fatourou, P., Ruppert, E., Sun, Y.: Constant-time snapshots with applications to concurrent data structures. In: Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 31\u201346 (2021)","DOI":"10.1145\/3437801.3441602"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Weikum, G., Vossen, G.: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann (2002)","DOI":"10.1016\/B978-155860508-4\/50005-3"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, K., Zhao, Y., Yang, Y., Liu, Y., Spear, M.F.: Practical non-blocking unordered lists. In: DISC, pp. 239\u2013253 (2013)","DOI":"10.1007\/978-3-642-41527-2_17"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-67321-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:02:21Z","timestamp":1724515341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-67321-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031673207","9783031673214"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-67321-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/netys.net\/committees\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}