Intro
Preface
Organization
Contents
The 6th International Workshop on Big Data Quality Management
ASQT: An Efficient Index for Queries on Compressed Trajectories
1 Introduction
2 Related Work
2.1 Trajectory Compression Algorithm
2.2 Existing Similarity Measures
3 The ASQT Index
3.1 Index Construction
3.2 The Properties of ASQT
4 Queries on ASQT
4.1 Trajectory Range Query Processing on ASQT
4.2 Trajectory Similarity Query on ASQT
5 Experiments
5.1 Experiment Settings
5.2 Experiment Results
6 Conclusion
References

ROPW: An Online Trajectory Compression Algorithm
1 Introduction
2 Related Work
3 Preliminaries
3.1 Basic Notations
3.2 Line Simplification Algorithms
4 Algorithm ROPW
4.1 Motivation
4.2 Error-Based Metrics
4.3 ROPW
5 Experiments
5.1 Experimental Data Set
5.2 Experiment Settings
5.3 Experiment Results
6 Conclusion
References
HTF: An Effective Algorithm for Time Series to Recover Missing Blocks
1 Introduction
2 Related Work
3 Backgroud
3.1 Definition
3.2 Patterns of Missing Blocks
4 Hankelized Tensor Factorization
4.1 Methodology

4.2 Relation to Singular Spectrum Analysis
5 Experiments
5.1 Experiment Setting
5.2 Recovery Effect
5.3 Result Conclusion
6 Conclusion
References
LAA: Inductive Community Detection Algorithm Based on Label Aggregation
1 Introduction
2 Related Work
3 Problem Definition
4 LAA Framework
4.1 AGM
4.2 Label Aggregation
4.3 Parameter Training
5 Experiments
5.1 Datasets
5.2 Evaluation
5.3 Baseline Methods
5.4 Setup
5.5 Experiment Results
6 Conclusions
References
Modeling and Querying Similar Trajectory in Inconsistent Spatial Data

1 Introduction
1.1 Modeling Inconsistent Spatial Data
1.2 Nearest Entities in Inconsistent Spatial Data
1.3 Contributions
2 Problem Definition
3 Frequent Probabilistic Nearest Neighbor Query Processing
3.1 The Computation of the Nearest Neighbor Probability
3.2 Frequent Probability Nearest Neighbor Lookup Basic Query Algorithm
3.3 Probability Nearest Neighbor Advanced Query Algorithm
3.4 The Calculation of the Probability Upper Bounds
4 Experiments
4.1 Experimental Configuration
4.2 Analysis of Experimental Results
5 Conclusion
References

The 5th International Workshop on Graph Data Management and Analysis
ESTI: Efficient k-Hop Reachability Querying over Large General Directed Graphs
1 Introduction
2 Problem Definition and Overview
2.1 Problem Definition
2.2 Overview
3 Offline Indexing
3.1 FELINE+ Index
3.2 Extended Spanning Tree Index for General Directed Graph
3.3 Summary of Offline Indexing
4 Online Querying
4.1 Basic Query Process
4.2 Pruning Strategies
4.3 Summary of Online Querying
5 Experiments
5.1 Datasets
5.2 Performance of FELINE+
5.3 Queries with Different k