Article Source

• Title:

Proceedings of the VLDB Endowment, Volume 10, 2016-2017

• Editors-in-Chief: Peter Boncz and Ken Salem
• Founding Editor-in-Chief: H. V. Jagadish
• Managing Editor: Divesh Srivastava
• Information Director: Gerald Weber
• Advisory Committee: H. V. Jagadish, Kian-Lee Tan, Renée J. Miller, S. Sudarshan, Juliana Freire, M. Tamer Özsu, Chen Li, Wolfgang Lehner
• Associate Editors: Ashraf Aboulnaga, Shimin Chen, Gautam Das, Amol Deshpande, Zack Ives, Qiong Luo, Stefan Manegold, Ioana Manolescu, Sharad Mehrotra, Fatma Ozcan, Themis Palpanas, Rachel Pottinger, Ken Ross, Gerhard Weikum
• Review Board: see full list

Volume 10, No. 1, October 2016

• Peter Boncz and Ken Salem: Front Matter. i - vi.
• Dawei Jiang, Qingchao Cai, Gang Chen, H.V. Jagadish, Beng Chin Ooi, Kian-Lee Tan, Anthony Tung: Cohort Query Processing. 1 - 12.
• Yubao Wu, Yuchen Bian, Xiang Zhang: Remember Where You Came From: On The Second-Order Random Walk Based Proximity Measures. 13 - 24.
• Lars George, Bruno Cadonna, Matthias Weidlich: IL-Miner: Instance-Level Discovery of Complex Event Patterns. 25 - 36.

Volume 10, No. 2, October 2016

• Front Matter. i - v.
• Iraklis Psaroudakis, Tobias Scheuer, Norman May, Abdelkader Sellami, Anastasia Ailamaki: Adaptive NUMA-aware data placement and task scheduling for analytical workloads in main-memory column-stores. 37 - 48.
• Tianzheng Wang, Hideaki Kimura: Mostly-Optimistic Concurrency Control for Highly Contended Dynamic Workloads on a Thousand Cores. 49 - 60.
• Sibo Wang, Xiaokui Xiao, Yin Yang, Wenqing Lin: Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks. 61 - 72.

Volume 10, No. 3, November 2016

• Front Matter. i - vi.
• Qun Huang, Patrick P. C. Lee: Toward High-Performance Distributed Stream Processing via Approximate Fault Tolerance. 73 - 84.
• Jian Dai, Bin Yang, Chenjuan Guo, Christian Jensen, Jilin Hu: Path Cost Distribution Estimation Using Trajectory Data. 85 - 96.
• Ahmet Erdem Sarıyüce, Ali Pinar: Fast Hierarchy Construction for Dense Subgraphs. 97 - 108.
• Xuhong Zhang, Jun Wang, Jiangling Yin, Shouling Ji: Sapprox: Enabling Efficient and Accurate Approximations on Sub-datasets with Distribution-aware Online Sampling. 109 - 120.
• Xuguang Ren, Junhu Wang: Multi-Query Optimization for Subgraph Isomorphism Search. 121 - 132.
• Michael Simpson, Venkatesh Srinivasan, Alex Thomo: Efficient Computation of Feedback Arc Set at Web-Scale. 133 - 144.
• Dolan Antenucci, Michael Anderson, Michael Cafarella: A Declarative Query Processing System for Nowcasting. 145 - 156.
• Alessandro Lulli, Matteo Dell’Amico, Pietro Michiardi, Laura Ricci: NG-DBSCAN: Scalable Density-Based Clustering for Arbitrary Data. 157 - 168.
• Rodica Neamtu, Ramoza Ahsan, Elke Rundensteiner, Gabor Sarkozy: Interactive Time Series Exploration Powered by the Marriage of Similarity Distances. 169 - 180.
• Youhuan Li, Lei Zou, Huaming Zhang, Dongyan Zhao: Computing Longest Increasing Subsequences over Sequential Data Streams. 181 - 192.
• Fernando Chirigati, Jialu Liu, Flip Korn, You Wu, Cong Yu, Hao Zhang: Knowledge Exploration using Tables on the Web. 193 - 204.
• Sibo Wang, Youze Tang, Xiaokui Xiao, Yin Yang, Zengxiang Li: HubPPR: Effective Indexing for Approximate Personalized PageRank. 205 - 216.
• Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang: Scalable Distributed Subgraph Enumeration. 217 - 228.
• Yasuhiro Fujiwara, Yasutoshi Ida, Junya Arai, Mai Nishimura, Sotetsu Iwamura: Fast Algorithm for the Lasso based L1-Graph Construction. 229 - 240.
• Ennan Zhai, Zhenhua Li, Zhenyu Li, Fan Wu, Guihai Chen: Resisting Tag Spam by Leveraging Implicit User Behaviors. 241 - 252.
• Xiaowei Chen, Yongkun Li, Pinghui Wang, John C.S. Lui: A General Framework for Estimating Graphlet Statistics via Random Walk. 253 - 264.
• Chunbin Lin, Benjamin Mandel, Yannis Papakonstantinou, Matthias Springer: Fast In-Memory SQL Analytics on Typed Graphs. 265 - 276.
• Zheng Li, Tingjian Ge: Stochastic Data Acquisition for Answering Queries as Time Goes by. 277 - 288.

Volume 10, No. 4, December 2016

• Front Matter. i - vi.
• Haipeng Dai, Muhammad Shahzad, Alex X. Liu, Yuankun Zhong: Finding Persistent Items in Data Streams. 289 - 300.
• Shuotao Xu, Sungjin Lee, Sang-Woo Jun, Ming Liu, Jamey Hicks, Arvind: BlueCache: A Scalable Distributed Flash-based Key-value Store. 301 - 312.
• Qi Fan, Dongxiang Zhang, Huayu Wu, Kian-Lee Tan: A General and Parallel Platform for Mining Co-Movement Patterns over Large-scale Trajectories. 313 - 324.
• Zhou Shao, Muhammad Cheema, David Taniar, Hua Lu: VIP-Tree: An Effective Index for Indoor Spatial Queries. 325 - 336.
• Joy Arulraj, Matthew Perron, Andrew Pavlo: Write-Behind Logging. 337 - 348.
• Stavros Papadopoulos, Kushal Datta, Samuel Madden, Timothy Mattson: The TileDB Array Data Storage Manager. 349 - 360.
• Yudian Zheng, Guoliang Li, Reynold Cheng: DOCS: Domain-Aware Crowdsourcing System. 361 - 372.
• Yue Wang, Alexandra Meliou, Gerome Miklau: Lifting the Haze off the Cloud: A Consumer-Centric Market for Database Computation in the Cloud. 373 - 384.
• Jia Yu, Mohamed Sarwat: Two Birds, One Stone: A Fast, yet Lightweight, Indexing Scheme for Modern Database Systems. 385 - 396.
• Zheng Li, Tingjian Ge: History is a mirror to the future: Best-effort approximate complex event matching with insufficient resources. 397 - 408.
• Hillel Avni, Trevor Brown: PHyTM: Persistent Hybrid Transactional Memory. 409 - 420.
• Liwen Sun, Michael Franklin, Jiannan Wang, Eugene Wu: Skipping-oriented Partitioning for Columnar Layouts. 421 - 432.
• Sneha Singh, Divesh Srivastava, Srikanta Tirthapura: Estimating Quantiles from the Union of Historical and Streaming Data. 433 - 444.
• Marco Serafini, Rebecca Taft, Aaron J. Elmore, Andrew Pavlo, Ashraf Aboulnaga, Michael Stonebraker: Clay: Fine-Grained Adaptive Partitioning for General Database Schemas. 445 - 456.
• Tarique Ashraf Siddiqui, Albert Kim, John Lee, Karrie Karahalios, Aditya Parameswaran: Effortless Data Exploration with zenvisage: An Expressive and Interactive Visual Analytics System. 457 - 468.

Volume 10, No. 5, January 2017

• Front Matter. i - v.
• Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. 469 - 480.
• Vincent Bindschaedler, Reza Shokri, Carl Gunter: Plausible Deniability for Privacy-Preserving Data Synthesis. 481 - 492.
• Shiv Verma, Luke Leslie, Yosub Shin, Indranil Gupta: An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing. 493 - 504.
• Badrish Chandramouli, Jonathan Goldstein: Shrink - Prescribing Resiliency Solutions for Streaming. 505 - 516.
• Claude Barthels, Gustavo Alonso, Torsten Hoefler, Timo Schneider, Ingo Müller: Distributed Join Algorithms on Thousands of Cores. 517 - 528.
• Junling Liu, Ke Deng, Huanliang Sun, Yu Ge, Xiaofang Zhou, Christian Jensen: Clue-based Spatio-textual Query. 529 - 540.
• Yudian Zheng, Guoliang Li, Yuanbing Li, Caihua Shan, Reynold Cheng: Truth Inference in Crowdsourcing: Is the Problem Solved?. 541 - 552.
• Rachael Harding, Dana Van Aken, Andrew Pavlo, Michael Stonebraker: An Evaluation of Distributed Concurrency Control. 553 - 564.
• Wanyun Cui, Yanghua Xiao, Haixun Wang, Yangqiu Song, Seung-won Hwang, Wei Wang: KBQA: Learning Question Answering over QA Corpora and Knowledge Bases. 565 - 576.
• Daniel Deutch, Nave Frost, Amir Gilad: Provenance for Natural Language Queries. 577 - 588.
• Yi Lu, Anil Shanbhag, Alekh Jindal, Samuel Madden: AdaptDB: Adaptive Partitioning for Distributed Joins. 589 - 600.
• Zhipeng Zhang, Yingxia Shao, Bin Cui, Ce Zhang: An Experimental Evaluation of SimRank-based Similarity Search Algorithms. 601 - 612.
• Jose Faleiro, Daniel Abadi, Joseph Hellerstein: High Performance Transactions via Early Write Visibility. 613 - 624.
• Dhivya Eswaran, Stephan Guennemann, Christos Faloutsos, Disha Makhija, Mohit Kumar: ZooBP: Belief Propagation for Heterogeneous Networks. 625 - 636.

Volume 10, No. 6, February 2017

• Front Matter. i - v.
• Min Lyu, Dong Su, Ninghui Li: Understanding the Sparse Vector Technique for Differential Privacy. 637 - 648.
• Fan Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, Xuemin Lin: OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks. 649 - 660.
• Meraj Ahmed Khan, Larry Xu, Arnab Nandi, Joseph Hellerstein: Data Tweening: Incremental Visualization of Data Transforms. 661 - 672.
• Johes Bater, Greg Elliott, Craig Eggen, Satyender Goel, Abel Kho, Jennie Rogers: SMCQL: Secure Query Processing for Private Data Networks. 673 - 684.
• Erfan Zamanian, Carsten Binnig, Tim Kraska, Tim Harris: The End of a Myth: Distributed Transaction Can Scale. 685 - 696.
• Haohan Zhu, Xianrui Meng, George Kollios: NED: An Inter-Graph Node Metric Based On Edit Distance. 697 - 708.
• Yixiang Fang, Reynold Cheng, Xiaodong Li, Siqiang Luo, Jiafeng Hu: Effective Community Search over Large Spatial Graphs. 709 - 720.