Article Source

• Title: Proceedings of the VLDB Endowment, Volume 10, 2016-2017

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 [Experiments and Analysis]. 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.