ICDE 2019

184 papers
The 35th IEEE International Conference on Data Engineering (ICDE 2019) featured 295 research papers addressing core challenges in data management. Primary research directions included indexing and pruning for high-dimensional similarity search, strategies to overcome the cubic bottleneck in kernel methods, and tightening bounds for efficient combinatorial search. Prolific contributors to the program included researchers such as Lei Chen, Lu Qin, Xiaofang Zhou, and Ying Zhang. A significant volume of work focused on spatial and temporal data analysis, particularly within the context of road networks. Research topics included time-dependent hop labeling, why-not range-based skyline queries, and correctness-aware kNN queries. Other notable areas of investigation involved privacy-preserving spatial keyword queries, moving object linking through historical traces, and focused graph query autocompletion. The proceedings also explored iterative schemes for leverage-based approximate aggregation and security considerations for geo-textual data. These contributions reflect a sustained interest in optimizing query efficiency and data privacy across complex network structures.

Top Research Directions

Research directions most represented by ICDE 2019 papers.

Overlapping Community Detection in Complex Networks 2
Population Independent Sample Complexity 1
Inductive Synthesis via Structural Periodicity Detection 1
The Computational Cost of Hybrid Optimization Frameworks 1
Behavioral Sequence Embeddings 1
Parallel Batch Processing for Dynamic Graphs 1
Probabilistic Pruning for Combinatorial Search Spaces 1
Learning and Decision Making with Interval Valued Data 1
Adaptive Neighborhood Selection for Non-Uniform Data 1
Global Sequence Segmentation via Dynamic Programming 1
Modeling Non-Stationary Human Performance in Data Annotation 1
Simplification Bias in Continuous Sensitive Attribute Discretization 1
The Computational Cost of High Precision 1
Recursive Graph Partitioning 1
Bound Based Pruning in Discrete Search Spaces 1

Top Authors

AuthorPapers
Lei Chen13
Lu Qin8
Xiaofang Zhou7
Ying Zhang7
Jianliang Xu5
Peng Cheng5
Wenjie Zhang5
Christian S. Jensen4
Guoren Wang4
Hongzhi Wang4
H. V. Jagadish4
Jeffrey Xu Yu4
Kai Zheng4
Tong Yang4
Yongxin Tong4
Yunjun Gao4
Bin CUI3
Byron Choi3
Cheng Long3
Gang Chen3

Impactful Papers

Papers from ICDE 2019 that shaped research clusters.

Foundational

Influential

Papers

Title
Rima: An RDMA-Accelerated Model-Parallelized Solution to Large-Scale Matrix Factorization
Robust High Dimensional Stream Classification with Novel Class Detection
Route Recommendations on Road Networks for Arbitrary User Preference Functions
Rule-Based Entity Resolution on Database with Hidden Temporal Information (Extended Abstract)
RUM: Network Representation Learning Using Motifs
SAC: A System for Big Data Lineage Tracking
Scalable Metric Similarity Join Using MapReduce
Scaling Up Subgraph Query Processing with Efficient Subgraph Matching
SEBDB: Semantics Empowered BlockChain DataBase
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database
SLADE: A Smart Large-Scale Task Decomposer in Crowdsourcing
Slice Finder: Automated Data Slicing for Model Validation
Social Influence-Based Group Representation Learning for Group Recommendation
Stochastic Weight Completion for Road Networks Using Graph Convolutional Networks
TARDIS: Distributed Indexing Framework for Big Time Series Data
Time Constrained Continuous Subgraph Search Over Streaming Graphs
Time-Dependent Hop Labeling on Road Network
To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
Top-K Frequent Term Queries on Streaming Data
Towards Longitudinal Analytics on Social Media Data
Towards the Completion of a Domain-Specific Knowledge Base with Emerging Query Terms
Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks
TuFast: A Lightweight Parallelization Library for Graph Analytics
Uncertain Graph Sparsification (Extended Abstract)
Unsupervised String Transformation Learning for Entity Consolidation
Utilizing Dynamic Properties of Sharing Bits and Registers to Estimate User Cardinalities Over Time
vABS: Towards Verifiable Attribute-Based Search Over Shared Cloud Data
Vaite: A Visualization-Assisted Interactive Big Urban Trajectory Data Exploration System
Walking with Perception: Efficient Random Walk Sampling via Common Neighbor Awareness
WebPut: A Web-Aided Data Imputation System for the General Type of Missing String Attribute Values
Weight-Constrained Route Planning Over Time-Dependent Graphs
When Geo-Text Meets Security: Privacy-Preserving Boolean Spatial Keyword Queries
Workload-Driven Fragment Allocation for Partially Replicated Databases Using Linear Programming
XINA: Explainable Instance Alignment using Dominance Relationship (Extended Abstract)

« prev Page 4/4