CrushSCI.com
提供学术论文选刊润色服务
VLDB JOURNAL 期刊封面 计算机科学
返回期刊列表

Review Cycle Records

VLDB JOURNAL

Springer SCIE 非OA
2026新锐 3区2025中科院 2区2025 JCR Q2
317.9平均天数
309中位天数
181最短天数
516最长天数
652025发文量

Paper Review Records

全部论文审稿周期

20 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接

209 天

Efficient discovery of arbitrary cycles in large-scale networks

作者Siyi Teng; Jeffrey Xu Yu; Jiadong Xie

作者单位1. The Chinese University of Hong Kong, Hong Kong SAR, China; 2. The Hong Kong University of Science and Technology (Guangzhou), Guangdong Province, China

PDF源文件 DOI 网页
291 天

Multi-modal knowledge graph entity alignment: a comprehensive survey

作者Zhihuan Yan; Yi Wang; Chongchong Zhang; Hengyang Wu; Liping Li; QingE Wu

作者单位1. 2360 Jinhai Road, Pudong New Area, Shanghai, China

PDF源文件 DOI 网页
254 天

Distilled documentation for dialect-specific SQL generation

作者Till Döhmen; Adithya Krishnan; Hamilton Ulmer; Peter Boncz; Sebastian Schelter

作者单位1. MotherDuck, Seattle, USA; 2. MotherDuck & CWI, Amsterdam, The Netherlands; 3. BIFOLD & TU Berlin, Berlin, Germany

PDF源文件 DOI 网页
407 天

On querying minimum spanning tree in temporal graphs

作者Yuanhang Yu; Dong Wen; Lu Qin; Dawei Cheng; Ying Zhang; Wenjie Zhang; Xuemin Lin

作者单位1. Department of Computer Science and Technology, Tongji University, Shanghai, China; 2. AAII, University of Technology Sydney, Sydney, Australia; 3. The University of New South Wales, Sydney, Australia; 4. School of Statistics & Mathematics and School of Computer Science & Information Technology, Zhejiang Gongshang University, Hangzhou, China; 5. Shanghai Jiao Tong University, Shanghai, China

PDF源文件 DOI 网页
479 天

\(\textsf{IACS}^{+}\) : Inductive Attributed Community Search via Learning across Graphs

作者Ao Liu; Shuheng Fang; Kangfei Zhao; Zhixun Li; Jeffrey Xu Yu; Zhiwei Zhang; Guoli Yang; Kaiyu Feng; Ye Yuan; Guoren Wang

作者单位1. Beijing Institute of Technology, Beijing, China; 2. Zhongguancun Academy, Beijing, China; 3. Chinese University of Hong Kong, ShaTin, Hong Kong; 4. National Key Laboratory of Data Space Technology and System, Beijing, China

PDF源文件 DOI 网页
323 天

Hypergraph decomposition with intersection bounds

作者Qi Luo; Zhengyi Yang; Wenjie Zhang; Alexander Zhou; Dongxiao Yu; Xiuzhen Cheng; Xuemin Lin; Song Guo

作者单位1. Shandong University, Qingdao, China; 2. University of New South Wales, Sydney, Australia; 3. The University of Sydney, Sydney, Australia; 4. Hong Kong Polytechnic University, Hong Kong, China; 5. Shanghai Jiao Tong University, Shanghai, China; 6. Hong Kong University of Science and Technology, Hong Kong, China

PDF源文件 DOI 网页
483 天

On Efficient Top- k Empirical Variance Computation: A Once-For-All Progressive Sampling Approach

作者Victor Junqiu Wei; Di Jiang; Chen Jason Zhang

作者单位1. Macau University of Science and Technology, Macau, China; 2. The Hong Kong Polytechnic University, Hong Kong, China

PDF源文件 DOI 网页
233 天

State Migration in Styx: Towards Serverless Transactional Functions

作者Kyriakos Psarakis; George Christodoulou; George Siachamis; Marios Fragkoulis; Asterios Katsifodimos

作者单位1. Delft University of Technology, Delft, Netherlands; 2. Inria & Institut Polytechnique de Paris, Paris, France

PDF源文件 DOI 网页
516 天

Balancing Relevance and Diversity in k-Maximum Inner Product Search

作者Qiang Huang; Yanhao Wang; Yiqun Sun; Anthony K. H. Tung; Jun Yu

作者单位1. School of Intelligence Science and Engineering, Harbin Institute of Technology (Shenzhen), Shenzhen, China; 2. School of Data Science and Engineering, East China Normal University, Shanghai, China; 3. School of Computing, National University of Singapore, Singapore, Singapore

PDF源文件 DOI 网页
199 天

Towards A Generalizable and Expressive Graph Neural Network for Graph-Level Tasks with Theoretical Guarantees

作者Luyu Qiu; Yuming Xu; Haoyang Li; Chen Jason Zhang; Alexander Zhou; Peng Cheng; Lei Chen; Qing Li

作者单位1. Hong Kong University of Science and Technology, Hong Kong SAR, Hong Kong, China; 2. Hong Kong Polytechnic University, Hong Kong SAR, Hong Kong, China; 3. Tongji University, Shanghai, China

PDF源文件 DOI 网页

Expert Matching · Case Demo

把投稿要求,转成可验证的期刊方案

说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。

CrushSCI 在线

客户询问

我是环境工程专业,需要一篇 SCI,希望 3 个月内见刊。没有基金,也没有大牛挂名,可以投哪些期刊?

CrushSCI回复

可以。先按 90 天时限做可行性筛选,同步查找无基金、无知名作者挂靠的典型论文案例,作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

样本口径2026 年最近 5 篇有效论文样本

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

扫码添加微信,或留下手机号/微信号,我们将与你确认稿件阶段、编辑需求和投稿计划。

当前选择:论文编辑服务

也可以预留联系方式

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。