On efficiently finding reverse k-nearest neighbors over uncertain graphs Yunjun GaoXiaoye MiaoHuiyong Cui Regular Paper 17 March 2017 Pages: 467 - 492
Stream sampling over windows with worst-case optimality and \(\ell \)-overlap independence Yufei TaoXiaocheng HuMiao Qiao Regular Paper 03 April 2017 Pages: 493 - 510
Argument discovery via crowdsourcing Quoc Viet Hung NguyenChi Thang DuongXiaofang Zhou Regular Paper 07 April 2017 Pages: 511 - 535
Efficiently making (almost) any concurrency control mechanism serializable Tianzheng WangRyan JohnsonIppokratis Pandis Regular Paper 19 May 2017 Pages: 537 - 562
I/O-efficient algorithms for top-k nearest keyword search in massive graphs Qiankun ZhuHong ChengXin Huang Regular Paper 29 May 2017 Pages: 563 - 583
Indexing metric uncertain data for range queries and range joins Lu ChenYunjun GaoBaihua Zheng Regular Paper 24 May 2017 Pages: 585 - 610