Paper Review Records
All Paper Review Records
17 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
96
days
Horizontally Scaling Heterogeneous Storage for Combined Capabilities with PolyStore
Authors
Yujie Ren; David Domingo; Jian Zhang; Paul John; Rekha Pitchumani; Sanidhya Kashyap; Sudarsun KannanShow moreShow less
Affiliations
1. EPFL; 2. Rutgers University; 3. Microsoft; 4. Samsung Semiconductor Inc USAShow moreShow less
157
days
Deduplication can Make File Systems Faster
Authors
Yanqi Pan; Wen Xia; Erci Xu; Hao Huang; Xiangyu Zou; Shiyi LiShow moreShow less
Affiliations
1. Harbin Institute of Technology, Shenzhen; 2. Pengcheng Laboratory; 3. Shanghai Jiao Tong University; 4. Alibaba Group; 5. School of Computer Science, Harbin Institute of Technology, ShenzhenShow moreShow less
211
days
A Passive and Hybrid Data Persistence Scheme for LSM-tree based Relational Databases
Authors
Kecheng Huang; Canran Liu; Zhaoyan Shen; Zili Shao; Feng ChenShow moreShow less
Affiliations
1. The Chinese University of Hong Kong; 2. Shandong University; 3. Chinese University of Hong Kong; 4. Indiana University BloomingtonShow moreShow less
87
days
Mooncake: A KVCache-centric Disaggregated Architecture for LLM Serving
Authors
Ruoyu Qin; Zheming Li; Weiran He; Jialei Cui; Heyi Tang; Feng Ren; Teng Ma; Shangming Cai; Yineng Zhang; Mingxing Zhang; Yongwei Wu; Weimin Zheng; Xinran XuShow moreShow less
Affiliations
1. Computer Science and Technology, Tsinghua University; 2. Moonshot AI; 3. Alibaba Cloud Computing; 4. Independent Researcher; 5. Tsinghua University; 6. department of computer science and technology, Tsinghua UniversityShow moreShow less
238
days
Enabling Cost-effective and Efficient All-Distance Sketching in Out-of-core Approximate Graph System
Authors
Tsun-Yu Yang; Yizou Chen; Yi Li; Bingzhe Li; Ming-Chang YangShow moreShow less
Affiliations
1. The Chinese University of Hong Kong; 2. The University of Texas at Dallas; 3. Computer Science, The University of Texas at DallasShow moreShow less
308
days
Shuffler: A Novel Read Reclaim Scheme for Superblock Management in NAND Flash
Authors
Jianwei Liao; Zhibing Sha; Yuanbo Li; Jun Li; Zhigang Cai; Francois TrahayShow moreShow less
Affiliations
1. Southwest University; 2. Nanjing University of Posts and Telecommunications; 3. Télécom SudParisShow moreShow less
FAQ
How long does ACM Transactions on Storage take to review a manuscript?
As of 2026-11-16, CrushSCI has 17 complete review records for ACM Transactions on Storage. The fastest paper went from submission to acceptance in 87 days (Mooncake: A KVCache-centric Disaggregated Architecture for LLM Serving, received 2025-07-28, accepted 2025-10-23); the slowest took 685 days. The average is 287.8 days and the median is 238 days.
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
