More Like this

1. Designing Self-Tuning Split-Map-Merge Applications for High Cost-Efficiency in the Cloud

   https://doi.org/10.1109/TCC.2015.2415780  

   Rajan, Dinesh ; Thain, Douglas ( April 2017 , IEEE Transactions on Cloud Computing)
2. Distributed merge forest: a new fast and scalable approach for topological analysis at scale

   https://doi.org/10.1145/3447818.3460358  

   Huang, Xuan ; Klacansky, Pavol ; Petruzza, Steve ; Gyulassy, Attila ; Bremer, Peer-Timo ; Pascucci, Valerio ( June 2021 , ICS '21: Proceedings of the ACM International Conference on Supercomputing)
3. Harnessing connected and automated vehicle technologies to control lane changes at freeway merge bottlenecks in mixed traffic

   https://doi.org/10.1016/j.trc.2020.102950  

   Chen, Danjue ; Srivastava, Anupam ; Ahn, Soyoung ( February 2021 , Transportation Research Part C: Emerging Technologies)

   null (Ed.)
4. Parallel Clustering of Single Cell Transcriptomic Data with Split-Merge Sampling on Dirichlet Process Mixtures

   https://doi.org/10.1093/bioinformatics/bty702  

   Duan, Tiehang ; Pinto, José P ; Xie, Xiaohui ; Birol, Inanc ( August 2018 , Bioinformatics)
5. The LSM RUM-Tree: A Log Structured Merge R-Tree for Update-intensive Spatial Workloads

   https://doi.org/10.1109/ICDE51399.2021.00238  

   Shin, Jaewoo ; Wang, Jianguo ; Aref, Walid G. ( April 2021 , 2021 IEEE 37th International Conference on Data Engineering (ICDE))

   null (Ed.)

   Many applications require update-intensive work-loads on spatial objects, e.g., social-network services and shared-riding services that track moving objects (devices). By buffering insert and delete operations in memory, the Log Structured Merge Tree (LSM) has been used widely in various systems because of its ability to handle insert-intensive workloads. While the focus on LSM has been on key-value stores and their optimizations, there is a need to study how to efficiently support LSM-based secondary indexes. We investigate the augmentation of a main-memory-based memo structure into an LSM secondary index structure to handle update-intensive workloads efficiently. We conduct this study in the context of an R-tree-based secondary index. In particular, we introduce the LSM RUM-tree that demonstrates the use of an Update Memo in an LSM-based R-tree to enhance the performance of the R-tree's insert, delete, update, and search operations. The LSM RUM-tree introduces novel strategies to reduce the size of the Update Memo to be a light-weight in-memory structure that is suitable for handling update-intensive workloads without introducing significant over-head. Experimental results using real spatial data demonstrate that the LSM RUM-tree achieves up to 9.6x speedup on update operations and up to 2400x speedup on query processing over the existing LSM R-tree implementations. 

   more » « less