Introduction
This document serves as the official Front Matter for Volume 11, Issue 8 of the Proceedings of the VLDB Endowment (PVLDB), published in April 2018. It introduces a curated collection of research papers presented at the 44th International Conference on Very Large Data Bases (VLDB 2018), held in Rio de Janeiro, Brazil.
The PVLDB Publication Model
A central component of this issue is the "Letter from the Program Chairs," which details the innovative publication model of PVLDB. Designed to bridge the gap between traditional conference agility and the depth of journal-style peer review, the PVLDB model offers:
- Continuous Submission: Twelve monthly deadlines throughout the year.
- Rapid Feedback: A six-week initial review cycle.
- Revision Opportunities: A three-month revision window that allows authors to refine their work based on expert feedback, ensuring that published papers meet the highest standards of the database community.
This model provides researchers with visibility and agility through rapid online publication while maintaining the prestige associated with a rigorous journal review process.
Research Highlights in Issue 8
Issue 8 features seven research papers covering a diverse array of topics in modern data management. These contributions advance the state-of-the-art in several key areas:
- Graph Analytics: The development of LA3, a scalable link- and locality-aware system based on linear algebra, addresses the complexities of large-scale graph processing.
- Spatial-Temporal Optimization: Research into price-aware ridesharing and network proximity querying offers new solutions for real-time urban mobility and spatial data challenges.
- Data Quality and Dependencies: New methods for discovering functional and temporal dependencies—even in datasets with missing values—enhance the robustness of data cleaning and integration.
- High-Dimensional Search: The HD-Index pushes the boundaries of scalability and accuracy for approximate k-Nearest Neighbor (kNN) searches in high-dimensional spaces.
Editorial Scale and Collaborative Effort
The production of this volume reflects a massive collaborative effort within the research community. The review board for Volume 11 consisted of 201 expert researchers, overseen by 18 Associate Editors. This scale ensures a thorough and fair evaluation of the hundreds of submissions received annually.
Table of Contents (Issue 8)
The following papers comprise this issue (pages 840–933):
- Indexed Fast Network Proximity Querying (Coskun et al.)
- Order Dispatch in Price-aware Ridesharing (Zheng & Chen)
- Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings (Mouratidis & Tang)
- Discovery of Genuine Functional Dependencies from Relational Data with Missing Values (Berti-Equille et al.)
- Effective Temporal Dependence Discovery in Time Series Data (Cai et al.)
- HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces (Arora et al.)
- LA3: A Scalable Link- and Locality-Aware Linear Algebra-Based Graph Analytics System (Ahmad et al.)
Summary updated