Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design-Reference-Cited by-同舟云学术

Small Refinements to the DAM Can Have Big Consequences for Data-Structure Design

Published:2019-06-17 Issue: Volume: Page:
ISSN:
Container-title:The 31st ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Bender Michael A.¹,Conway Alex²,Farach-Colton Martín³,Jannen William⁴,Jiao Yizheng⁵,Johnson Rob⁶,Knorr Eric³,McAllister Sara⁷,Mukherjee Nirjhar⁵,Pandey Prashant⁸,Porter Donald E.⁵,Yuan Jun⁹,Zhan Yang⁵

Affiliation:

1. Stony Brook University, Stony Brook, NY, USA

2. Rutgers University & VMware Research, New Brunswick, NJ, USA

3. Rutgers University, New Brunswick, NJ, USA

4. Williams College, Williamstown, MA, USA

5. The University of North Carolina at Chapel Hill, Chapel Hill, NC, USA

6. VMware Research, Palo Alto, CA, USA

7. Harvey Mudd College, Claremont, CA, USA

8. Carnegie Mellon University, Pittsburgh, PA, USA

9. Pace University, New York, NY, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3323165.3323210

Reference68 articles.

1. The input/output complexity of sorting and related problems

2. New Algorithms for Disk Scheduling

3. Lars Arge. 2002. External Memory Geometric Data Structures. Lecture notes of EEF Summer School on Massive Data Sets Aarhus (2002). Lars Arge. 2002. External Memory Geometric Data Structures. Lecture notes of EEF Summer School on Massive Data Sets Aarhus (2002).

4. Microsoft Azure. 2016. How to use batching to improve SQL Database application performance. https://docs.microsoft.com/en-us/azure/sql-database/sql-database-use-batching-to-improve-performance . Microsoft Azure. 2016. How to use batching to improve SQL Database application performance. https://docs.microsoft.com/en-us/azure/sql-database/sql-database-use-batching-to-improve-performance .

5. Organization and maintenance of large ordered indexes

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

1. Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

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

4. Kangaroo: Theory and Practice of Caching Billions of Tiny Objects on Flash;ACM Transactions on Storage;2022-08-24

5. Automatic HBM Management;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11