Linked e-resources
Details
Table of Contents
Intro
General Chairs' Preface
Program Chairs' Preface
Organization
Contents - Part I
Contents - Part II
Contents - Part III
Database Queries
Approximate Continuous Top-K Queries over Memory Limitation-Based Streaming Data
1 Introduction
2 Preliminary
2.1 Related Works
2.2 Problem Definition
2.3 The Algorithm S-Merge
3 The Framework -TOPK
3.1 The -MSET
3.2 The Incremental Maintenance Algorithms
3.3 The Optimization Incremental Maintenance Algorithms
4 The Experiment
4.1 Experiment Settings
4.2 The Performance Evaluation
5 Conclusion
References
Cross-Model Conjunctive Queries over Relation and Tree-Structured Data
1 Introduction
2 Preliminary
3 Approach
3.1 Tree and Relational Data Representation
3.2 Challenges
3.3 Cross-Model Join (CMJoin) Algorithm
4 Evaluation
4.1 Evaluation Setup
5 Related Work
6 Conclusion and Future Work
References
Leveraging Search History for Improving Person-Job Fit
1 Introduction
2 Related Work
3 Problem Definition
4 The Proposed Approach
4.1 Text Matching Component
4.2 Intention Modeling Component
4.3 Prediction and Optimization
5 Experiments
5.1 Experimental Setup
5.2 The Overall Comparison
5.3 Evaluation in Different Skill Groups
5.4 Ablation Study
5.5 Performance Tuning
5.6 Qualitative Analysis
6 Conclusion
References
Efficient In-Memory Evaluation of Reachability Graph Pattern Queries on Data Graphs
1 Introduction
2 Preliminaries and Problem Definition
3 Query Reachability Graph
4 A Graph Traversal Filtering Algorithm
5 A Join-Based Query Occurrence Enumeration Algorithm
6 Experimental Evaluation
6.1 Setup
6.2 Performance Results
6.3 Comparison with Graph DB Systems
7 Related Work
8 Conclusion
References
Revisiting Approximate Query Processing and Bootstrap Error Estimation on GPU
1 Introduction
2 Preliminary
2.1 AQP and Bootstrap
2.2 Two Approximate Query Processing Models with GPU
3 AQP and Bootstrap-Based Error Estimation on GPU
3.1 Coprocessor Model
3.2 Main Processor Model
4 Advanced Optimization
4.1 One-Step Calculation
4.2 Count Sampling
4.3 One-Time Hashtable Building
5 Experiments
5.1 Experiment Setup
5.2 Performance Comparison
5.3 Factor Analysis
6 Related Work
7 Conclusion
References
join: Efficient Join with Versioned Dimension Tables
1 Introduction
2 Join with Multiple Versions of Dimension Tables
3 The -join Operator
4 Evaluation
5 Related Work
6 Conclusion
References
Learning-Based Optimization for Online Approximate Query Processing
1 Introduction
2 Approximate Query Optimization
3 Deep Learning-Based Error Prediction Model
4 Experiment
5 Related Work
6 Conclusion
References
Knowledge Bases
Triple-as-Node Knowledge Graph and Its Embeddings
1 Introduction
General Chairs' Preface
Program Chairs' Preface
Organization
Contents - Part I
Contents - Part II
Contents - Part III
Database Queries
Approximate Continuous Top-K Queries over Memory Limitation-Based Streaming Data
1 Introduction
2 Preliminary
2.1 Related Works
2.2 Problem Definition
2.3 The Algorithm S-Merge
3 The Framework -TOPK
3.1 The -MSET
3.2 The Incremental Maintenance Algorithms
3.3 The Optimization Incremental Maintenance Algorithms
4 The Experiment
4.1 Experiment Settings
4.2 The Performance Evaluation
5 Conclusion
References
Cross-Model Conjunctive Queries over Relation and Tree-Structured Data
1 Introduction
2 Preliminary
3 Approach
3.1 Tree and Relational Data Representation
3.2 Challenges
3.3 Cross-Model Join (CMJoin) Algorithm
4 Evaluation
4.1 Evaluation Setup
5 Related Work
6 Conclusion and Future Work
References
Leveraging Search History for Improving Person-Job Fit
1 Introduction
2 Related Work
3 Problem Definition
4 The Proposed Approach
4.1 Text Matching Component
4.2 Intention Modeling Component
4.3 Prediction and Optimization
5 Experiments
5.1 Experimental Setup
5.2 The Overall Comparison
5.3 Evaluation in Different Skill Groups
5.4 Ablation Study
5.5 Performance Tuning
5.6 Qualitative Analysis
6 Conclusion
References
Efficient In-Memory Evaluation of Reachability Graph Pattern Queries on Data Graphs
1 Introduction
2 Preliminaries and Problem Definition
3 Query Reachability Graph
4 A Graph Traversal Filtering Algorithm
5 A Join-Based Query Occurrence Enumeration Algorithm
6 Experimental Evaluation
6.1 Setup
6.2 Performance Results
6.3 Comparison with Graph DB Systems
7 Related Work
8 Conclusion
References
Revisiting Approximate Query Processing and Bootstrap Error Estimation on GPU
1 Introduction
2 Preliminary
2.1 AQP and Bootstrap
2.2 Two Approximate Query Processing Models with GPU
3 AQP and Bootstrap-Based Error Estimation on GPU
3.1 Coprocessor Model
3.2 Main Processor Model
4 Advanced Optimization
4.1 One-Step Calculation
4.2 Count Sampling
4.3 One-Time Hashtable Building
5 Experiments
5.1 Experiment Setup
5.2 Performance Comparison
5.3 Factor Analysis
6 Related Work
7 Conclusion
References
join: Efficient Join with Versioned Dimension Tables
1 Introduction
2 Join with Multiple Versions of Dimension Tables
3 The -join Operator
4 Evaluation
5 Related Work
6 Conclusion
References
Learning-Based Optimization for Online Approximate Query Processing
1 Introduction
2 Approximate Query Optimization
3 Deep Learning-Based Error Prediction Model
4 Experiment
5 Related Work
6 Conclusion
References
Knowledge Bases
Triple-as-Node Knowledge Graph and Its Embeddings
1 Introduction