Range Queries in Non-blocking k-ary Search Trees-Reference-Cited by-同舟云学术

Range Queries in Non-blocking k-ary Search Trees

Published:2012 Issue: Volume: Page:31-45
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Brown Trevor,Avni Hillel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-35476-2_3.pdf

Reference13 articles.

1. Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873–890 (1993)

2. Lecture Notes in Computer Science;Y. Afek,2011

3. Attiya, H., Guerraoui, R., Ruppert, E.: Partial snapshot objects. In: Proc. 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, pp. 336–343. ACM, New York (2008)

4. Barnes, G.: A method for implementing lock-free data structures. In: Proc. 5th ACM Symposium on Parallel Algorithms and Architectures, pp. 261–270 (1993)

5. Braginsky, A., Petrank, E.: A lock-free b+tree. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 58–67. ACM, New York (2012)

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Lock-free Binary Trie;2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS);2024-07-23

2. Jiffy: A Lock-free Skip List with Batch Updates and Snapshots (Abstract);Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing;2024-06-17

3. VERLIB: Concurrent Versioned Pointers;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

4. BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-Trees;Proceedings of the VLDB Endowment;2023-07

5. Wait-Free Updates and Range Search Using Uruv;Lecture Notes in Computer Science;2023