Default Cover Image

2019 IEEE 35th International Conference on Data Engineering (ICDE)

April 8 2019 to April 11 2019

Macao, Macao

ISBN: 978-1-5386-7474-1

Table of Contents

[Title page i]Freely available from IEEE.pp. 1-1
[Title page iii]Freely available from IEEE.pp. 3-3
[Copyright notice]Freely available from IEEE.pp. 4-4
Table of contentsFreely available from IEEE.pp. 5-33
Message from the ICDE 2019 ChairsFreely available from IEEE.pp. 34-35
Organizing CommitteeFreely available from IEEE.pp. 36-37
Program CommitteeFreely available from IEEE.pp. 38-47
AsterixDB Mid-Flight: A Case Study in Building Systems in AcademiaFull-text access may be available. Sign in or learn about subscription options.pp. 1-12
Building a Broad Knowledge Graph for ProductsFull-text access may be available. Sign in or learn about subscription options.pp. 25-25
Knowledge Graphs and Enterprise AI: The Promise of an Enabling TechnologyFull-text access may be available. Sign in or learn about subscription options.pp. 26-37
Is There a Data Science and Engineering Brain Drain? If So, How Can We Rebalance Them?Full-text access may be available. Sign in or learn about subscription options.pp. 38-39
Answering Why-Questions for Subgraph Queries in Multi-attributed GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 40-51
Enumerating k-Vertex Connected Components in Large GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 52-63
Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 64-75
Computing a Near-Maximum Independent Set in Dynamic GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 76-87
Contextual Community Search Over Large Social NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 88-99
Rima: An RDMA-Accelerated Model-Parallelized Solution to Large-Scale Matrix FactorizationFull-text access may be available. Sign in or learn about subscription options.pp. 100-111
Accelerating Partial Evaluation in Distributed SPARQL Query EvaluationFull-text access may be available. Sign in or learn about subscription options.pp. 112-123
Blockplane: A Global-Scale Byzantizing MiddlewareFull-text access may be available. Sign in or learn about subscription options.pp. 124-135
BENU: Distributed Subgraph Enumeration with Backtracking-Based FrameworkFull-text access may be available. Sign in or learn about subscription options.pp. 136-147
Efficient Synchronization of State-Based CRDTsFull-text access may be available. Sign in or learn about subscription options.pp. 148-159
Learning Individual Models for ImputationFull-text access may be available. Sign in or learn about subscription options.pp. 160-171
CurrentClean: Spatio-Temporal Cleaning of Stale DataFull-text access may be available. Sign in or learn about subscription options.pp. 172-183
Fine-Grained Provenance for Matching & ETLFull-text access may be available. Sign in or learn about subscription options.pp. 184-195
A Semi-Supervised Framework of Clustering Selection for De-DuplicationFull-text access may be available. Sign in or learn about subscription options.pp. 208-219
Scaling Up Subgraph Query Processing with Efficient Subgraph MatchingFull-text access may be available. Sign in or learn about subscription options.pp. 220-231
Efficient Parallel Subgraph Enumeration on a Single MachineFull-text access may be available. Sign in or learn about subscription options.pp. 232-243
Fast Dual Simulation Processing of Graph Database QueriesFull-text access may be available. Sign in or learn about subscription options.pp. 244-255
Efficient and Incremental Clustering Algorithms on Star-Schema Heterogeneous GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 256-267
G*-Tree: An Efficient Spatial Index on Road NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 268-279
DBSVEC: Density-Based Clustering Using Support Vector ExpansionFull-text access may be available. Sign in or learn about subscription options.pp. 280-291
A Joint Context-Aware Embedding for Trip RecommendationsFull-text access may be available. Sign in or learn about subscription options.pp. 292-303
AIR: Attentional Intention-Aware Recommender SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 304-315
No, That's Not My Feedback: TV Show Recommendation Using Watchable IntervalFull-text access may be available. Sign in or learn about subscription options.pp. 316-327
Adaptive Wavelet Clustering for Highly Noisy DataFull-text access may be available. Sign in or learn about subscription options.pp. 328-337
An Efficient Parallel Keyword Search Engine on Knowledge GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 338-349
Towards Longitudinal Analytics on Social Media DataFull-text access may be available. Sign in or learn about subscription options.pp. 350-361
LCJoin: Set Containment Join via List CrosscuttingFull-text access may be available. Sign in or learn about subscription options.pp. 362-373
Bridging the Semantic Gap with SQL Query Logs in Natural Language Interfaces to DatabasesFull-text access may be available. Sign in or learn about subscription options.pp. 374-385
MF-Join: Efficient Fuzzy String Similarity Join with Multi-level FilteringFull-text access may be available. Sign in or learn about subscription options.pp. 386-397
Finding Temporal Influential Users Over Evolving Social NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 398-409
Seed Selection and Social Coupon Allocation for Redemption Maximization in Online Social NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 410-421
Keyword-Centric Community SearchFull-text access may be available. Sign in or learn about subscription options.pp. 422-433
Cohesive Group Nearest Neighbor Queries Over Road-Social NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 434-445
Maximizing Multifaceted Network InfluenceFull-text access may be available. Sign in or learn about subscription options.pp. 446-457
GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity SearchFull-text access may be available. Sign in or learn about subscription options.pp. 458-469
ARROW: Approximating Reachability Using Random Walks Over Web-Scale GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 470-481
Taster: Self-Tuning, Elastic and Online Approximate Query ProcessingFull-text access may be available. Sign in or learn about subscription options.pp. 482-493
An Iterative Scheme for Leverage-Based Approximate AggregationFull-text access may be available. Sign in or learn about subscription options.pp. 494-505
Deletion Propagation for Multiple Key Preserving Conjunctive Queries: Approximations and ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 506-517
Enumerating Minimal Weight Set CoversFull-text access may be available. Sign in or learn about subscription options.pp. 518-529
Constraints-Based Explanations of ClassificationsFull-text access may be available. Sign in or learn about subscription options.pp. 530-541
Assessing and Remedying Coverage for a Given DatasetFull-text access may be available. Sign in or learn about subscription options.pp. 554-565
Social Influence-Based Group Representation Learning for Group RecommendationFull-text access may be available. Sign in or learn about subscription options.pp. 566-577
MIDAS: Finding the Right Web Sources to Fill Knowledge GapsFull-text access may be available. Sign in or learn about subscription options.pp. 578-589
Route Recommendations on Road Networks for Arbitrary User Preference FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 602-613
NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph EmbeddingFull-text access may be available. Sign in or learn about subscription options.pp. 614-625
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced DatabaseFull-text access may be available. Sign in or learn about subscription options.pp. 626-637
Collecting and Analyzing Multidimensional Data with Local Differential PrivacyFull-text access may be available. Sign in or learn about subscription options.pp. 638-649
Partitioned Data Security on Outsourced Sensitive and Non-Sensitive DataFull-text access may be available. Sign in or learn about subscription options.pp. 650-661
SecEQP: A Secure and Efficient Scheme for SkNN Query Problem Over Encrypted Geodata on CloudFull-text access may be available. Sign in or learn about subscription options.pp. 662-673
Joins Over Encrypted Data with Fine Granular SecurityFull-text access may be available. Sign in or learn about subscription options.pp. 674-685
Column-Oriented Database Acceleration Using FPGAsFull-text access may be available. Sign in or learn about subscription options.pp. 686-697
Hardware-Conscious Hash-Joins on GPUsFull-text access may be available. Sign in or learn about subscription options.pp. 698-709
TuFast: A Lightweight Parallelization Library for Graph AnalyticsFull-text access may be available. Sign in or learn about subscription options.pp. 710-721
LDC: A Lower-Level Driven Compaction Method to Optimize SSD-Oriented Key-Value StoresFull-text access may be available. Sign in or learn about subscription options.pp. 722-733
No False Negatives: Accepting All Useful Schedules in a Fast Serializable Many-Core SystemFull-text access may be available. Sign in or learn about subscription options.pp. 734-745
REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in ParallelFull-text access may be available. Sign in or learn about subscription options.pp. 758-769
Information Diffusion Prediction via Recurrent Cascades ConvolutionFull-text access may be available. Sign in or learn about subscription options.pp. 770-781
Finding Densest Lasting Subgraphs in Dynamic Graphs: A Stochastic ApproachFull-text access may be available. Sign in or learn about subscription options.pp. 782-793
Multicapacity Facility Selection in NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 794-805
An MBR-Oriented Approach for Efficient Skyline Query ProcessingFull-text access may be available. Sign in or learn about subscription options.pp. 806-817
Dynamic Set kNN Self-JoinFull-text access may be available. Sign in or learn about subscription options.pp. 818-829
Packed Memory Arrays - RewiredFull-text access may be available. Sign in or learn about subscription options.pp. 830-841
GEM^2-Tree: A Gas-Efficient Structure for Authenticated Range Queries in BlockchainFull-text access may be available. Sign in or learn about subscription options.pp. 842-853
Effective Filters and Linear Time Verification for Tree Similarity JoinsFull-text access may be available. Sign in or learn about subscription options.pp. 854-865
KV-Match: A Subsequence Matching Approach Supporting Normalization and Time WarpingFull-text access may be available. Sign in or learn about subscription options.pp. 866-877
Efficient Maximal Spatial Clique EnumerationFull-text access may be available. Sign in or learn about subscription options.pp. 878-889
Cluster-Based Subscription Matching for Geo-Textual Data StreamsFull-text access may be available. Sign in or learn about subscription options.pp. 890-901
Time-Dependent Hop Labeling on Road NetworkFull-text access may be available. Sign in or learn about subscription options.pp. 902-913
Weight-Constrained Route Planning Over Time-Dependent GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 914-925
Skyline Queries Constrained by Multi-cost Transportation NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 926-937
Online Social Media Recommendation Over StreamsFull-text access may be available. Sign in or learn about subscription options.pp. 938-949
Canonicalization of Open Knowledge Bases with Side Information from the Source TextFull-text access may be available. Sign in or learn about subscription options.pp. 950-961
Walking with Perception: Efficient Random Walk Sampling via Common Neighbor AwarenessFull-text access may be available. Sign in or learn about subscription options.pp. 962-973
SimMeme: A Search Engine for Internet MemesFull-text access may be available. Sign in or learn about subscription options.pp. 974-985
A Hierarchical Framework for Top-k Location-Aware Error-Tolerant Keyword SearchFull-text access may be available. Sign in or learn about subscription options.pp. 986-997
2ED: An Efficient Entity Extraction Algorithm Using Two-Level Edit-DistanceFull-text access may be available. Sign in or learn about subscription options.pp. 998-1009
Bridging Quantities in Tables and TextFull-text access may be available. Sign in or learn about subscription options.pp. 1010-1021
An Efficient Insertion Operator in Dynamic Ridesharing ServicesFull-text access may be available. Sign in or learn about subscription options.pp. 1022-1033
Auction-Based Order Dispatch and Pricing in RidesharingFull-text access may be available. Sign in or learn about subscription options.pp. 1034-1045
When Geo-Text Meets Security: Privacy-Preserving Boolean Spatial Keyword QueriesFull-text access may be available. Sign in or learn about subscription options.pp. 1046-1057
Moving Object Linking Based on Historical TraceFull-text access may be available. Sign in or learn about subscription options.pp. 1058-1069
ImageProof: Enabling Authentication for Large-Scale Image RetrievalFull-text access may be available. Sign in or learn about subscription options.pp. 1070-1081
Time Constrained Continuous Subgraph Search Over Streaming GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 1082-1093
Showing 100 out of 277