VLDB是面向数据管理和数据库研究人员、供应商、从业人员、应用程序开发人员等用户的重要国际年度论坛。VLDB 2019会议将以研究报告，教程，演示和研讨会为特色。由于它们是21世纪新兴应用程序的技术基石，因此它将涵盖数据管理，数据库和信息系统研究中的问题。 官网地址：http://dblp.uni-trier.de/db/conf/vldb/

### 最新论文

This note extends the analysis of incremental PageRank in [B. Bahmani, A. Chowdhury, and A. Goel. Fast Incremental and Personalized PageRank. VLDB 2011]. In that work, the authors prove a running time of $O(\frac{nR}{\epsilon^2} \ln(m))$ to keep PageRank updated over $m$ edge arrivals in a graph with $n$ nodes when the algorithm stores $R$ random walks per node and the PageRank teleport probability is $\epsilon$. To prove this running time, they assume that edges arrive in a random order, and leave it to future work to extend their running time guarantees to adversarial edge arrival. In this note, we show that the random edge order assumption is necessary by exhibiting a graph and adversarial edge arrival order in which the running time is $\Omega \left(R n m^{\lg{\frac{3}{2}(1-\epsilon)}}\right)$. More generally, for any integer $d \geq 2$, we construct a graph and adversarial edge order in which the running time is $\Omega \left(R n m^{\log_d(H_d (1-\epsilon))}\right)$, where $H_d$ is the $d$th harmonic number.

Top