{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:58:35Z","timestamp":1743119915075,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442735"},{"type":"electronic","value":"9783031442742"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-44274-2_33","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"435-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Wait-Free Updates and\u00a0Range Search Using Uruv"],"prefix":"10.1007","author":[{"given":"Gaurav","family":"Bhardwaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bapi","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhay","family":"Jain","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":[[2023,9,30]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/3200691.3178489","volume":"53","author":"M Arbel-Raviv","year":"2018","unstructured":"Arbel-Raviv, M., Brown, T.: Harnessing epoch-based reclamation for efficient range queries. ACM SIGPLAN Not. 53(1), 14\u201327 (2018)","journal-title":"ACM SIGPLAN Not."},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2018.06.004","volume":"121","author":"H Attiya","year":"2018","unstructured":"Attiya, H., Casta\u00f1eda, A., Hendler, D.: Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distrib. Comput. 121, 1\u201314 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Basin, D., et al.: KiWi: a key-value map for scalable real-time analytics. In: PPOPP, pp. 357\u2013369 (2017)","DOI":"10.1145\/3155284.3018761"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Bhardwaj, G., Jain, A., Chatterjee, B., Peri, S.: Wait-free updates and range search using Uruv (2023). arXiv:2307.14744","DOI":"10.1007\/978-3-031-44274-2_33"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Braginsky, A., Petrank, E.: A lock-free B+ tree. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 58\u201367 (2012)","DOI":"10.1145\/2312005.2312016"},{"key":"33_CR6","unstructured":"Brown, T.: Techniques for constructing efficient lock-free data structures. CoRR, abs\/1712.05406 (2017). arXiv:1712.05406"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-35476-2_3","volume-title":"Principles of Distributed Systems","author":"T Brown","year":"2012","unstructured":"Brown, T., Avni, H.: Range queries in non-blocking k-ary search trees. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 31\u201345. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35476-2_3"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Brown, T., Prokopec, A., Alistarh, D.: Non-blocking interpolation search trees with doubly-logarithmic running time. In: PPOPP, pp. 276\u2013291 (2020)","DOI":"10.1145\/3332466.3374542"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, B.: Lock-free linearizable 1-dimensional range queries. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, pp. 1\u201310 (2017)","DOI":"10.1145\/3007748.3007771"},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: Ubiquitous B-tree. ACM Comput. Surv. (CSUR) 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: A highly-efficient wait-free universal construction. In: Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 325\u2013334 (2011)","DOI":"10.1145\/1989493.1989549"},{"key":"33_CR12","unstructured":"Flurry. Flurry Analytics (2022). https:\/\/www.flurry.com\/. Accessed May 2022"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45414-4_21"},{"key":"33_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":"33_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)"},{"issue":"8","key":"33_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/2370036.2145835","volume":"47","author":"A Kogan","year":"2012","unstructured":"Kogan, A., Petrank, E.: A methodology for creating fast wait-free data structures. ACM SIGPLAN Not. 47(8), 141\u2013150 (2012)","journal-title":"ACM SIGPLAN Not."},{"key":"33_CR17","unstructured":"Kowalski, T., Kounelis, F., Pirk, H.: High-performance tree indices: locality matters more than one would think. In: 11th International Workshop on Accelerating Analytics and Data Management Systems (2020)"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-03089-0_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Natarajan","year":"2013","unstructured":"Natarajan, A., Savoie, L.H., Mittal, N.: Concurrent wait-free red black trees. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 45\u201360. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03089-0_4"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Nelson, J., Hassan, A., Palmieri, R.: Bundled references: an abstraction for highly-concurrent linearizable range queries. In: PPOPP, pp. 448\u2013450 (2021)","DOI":"10.1145\/3437801.3441614"},{"key":"33_CR20","unstructured":"Petrank, E., Timnat, S.: A practical wait-free simulation for lock-free data structures (2017)"},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.jfds.2015.07.002","volume":"1","author":"X Tian","year":"2015","unstructured":"Tian, X., Han, R., Wang, L., Gang, L., Zhan, J.: Latency critical big data computing in finance. J. Finance Data Sci. 1(1), 33\u201341 (2015)","journal-title":"J. Finance Data Sci."},{"key":"33_CR22","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":"33_CR23","doi-asserted-by":"crossref","unstructured":"Wang, Z., et al.: Building a bw-tree takes more than just buzz words. In: Proceedings of the 2018 International Conference on Management of Data, pp. 473\u2013488 (2018)","DOI":"10.1145\/3183713.3196895"},{"key":"33_CR24","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: PPOPP, pp. 31\u201346 (2021)","DOI":"10.1145\/3437801.3441602"},{"issue":"7","key":"33_CR25","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1109\/TKDE.2015.2427795","volume":"27","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Chen, G., Ooi, B.C., Tan, K.-L., Zhang, M.: In-memory big data management and processing: a survey. IEEE Trans. Knowl. Data Eng. 27(7), 1920\u20131948 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:05:16Z","timestamp":1709859916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}