ICDE 2022

250 papers
The 2022 edition of the International Conference on Data Engineering (ICDE) featured 392 papers, with a focus on the intersection of data management and machine learning. Key research themes included algorithmic fairness, particularly regarding intersectional groups and matroid constrained optimization, as well as scalable model explanation through approximated Shapley values. Federated learning incentives and data valuation for machine learning were also prominent topics. In the domain of graph data, researchers explored automated data augmentation for contrastive learning and adversarial attacks on black-box models. Additional contributions addressed practical data engineering challenges such as cost-effective collaborative annotation systems, language-aware indexing for path queries, and multivariate anomaly detection using self-learning graph convolutional networks. Prolific authors contributing to the program included Xuemin Lin, Wenjie Zhang, and Lei Chen. The research presented reflected a trend toward making machine learning models more interpretable, fair, and efficient within large-scale data systems.

Top Research Directions

Research directions most represented by ICDE 2022 papers.

Generalizing Graph Algorithms to Directed and Weighted Networks 2
Balancing Power Law Workloads in Parallel Graph Processing 2
Overcoming the All Pairs Shortest Path Bottleneck 2
Incremental Maintenance of Dynamic Graph Indices 2
Scaling Graph Processing Beyond Main Memory 2
Generalizing Influence Maximization Across Diffusion Models 1
Socially Aware Team Formation Algorithms 1
Diversity Aware Trajectory Sampling 1
Decomposing the Total Error of Generative Models 1
Representative Benchmarking for Diverse Data Systems 1
Scaling Shapley Values via Stochastic Sampling and Surrogates 1
Scaling Data Systems via Probabilistic Membership Testing 1
Multi-Task Learning for Recommendation Systems 1
Shared Query Execution for Concurrent Workloads 1
Overcoming Augmentation Dependency in Graph Contrastive Learning 1

Top Authors

AuthorPapers
Xuemin Lin17
Wenjie Zhang15
Lei Chen11
Ying Zhang10
Guoren Wang8
Ye Yuan8
Yunjun Gao7
Bin CUI6
Christian S. Jensen6
Lu Qin6
Bin Yang5
Cheng Long5
Jeffrey Xu Yu5
Jianliang Xu5
Xiaoyang Wang5
Chen Chen4
Chenjuan Guo4
Dong Wen4
Hongzhi Yin4
Kai Wang4

Impactful Papers

Papers from ICDE 2022 that shaped research clusters.

Influential

Papers

Title
Linking Entities across Relations and Graphs
Local Clustering over Labeled Graphs: An Index-Free Approach
Machine Learning for Data Management: A System View
MAD-SGCN: Multivariate Anomaly Detection with Self-learning Graph Convolutional Networks
Manipulating Structural Graph Clustering
MANI-Rank: Multiple Attribute and Intersectional Group Fairness for Consensus Ranking
Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs
Maximal Directed Quasi -Clique Mining
Maximizing Range Sum in Trajectory Data
Maximizing Time-aware Welfare for Mixed Items
Maximum Biplex Search over Bipartite Graphs
Maximum Signed $\theta$-Clique Identification in Large Signed Graphs (Extended abstract)
Memorize, Factorize, or be Naive: Learning Optimal Feature Interaction Methods for CTR Prediction
Micro-Behavior Encoding for Session-based Recommendation
minIL: A Simple and Small Index for String Similarity Search with Edit Distance
MISS: Multi-Interest Self-Supervised Learning Framework for Click-Through Rate Prediction
Mixing Transactions with Arbitrary Values on Blockchains
MOSE: A Monotonic Selectivity Estimator Using Learned CDF (Extended abstract)
Most Probable Densest Subgraphs
MPC: Minimum Property-Cut RDF Graph Partitioning
Multiset Membership Lookup in Large Datasets (Extended abstract)
Multi-Task Learning with Calibrated Mixture of Insightful Experts
Neighbor-Anchoring Adversarial Graph Neural Networks (Extended Abstract)
Network Alignment with Holistic Embeddings (Extended Abstract)
Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms
ODNET: A Novel Personalized Origin-Destination Ranking Network for Flight Recommendation
OLxPBench: Real-time, Semantically Consistent, and Domain-specific are Essential in Benchmarking, Designing, and Implementing HTAP Systems
On Efficient Large Maximal Biplex Discovery (Extended abstract)
Online Cardinality Estimation by Self-morphing Bitmaps
On the Fairness of Time-Critical Influence Maximization in Social Networks (Extended Abstract)
On Time-optimal (k, p)-core Community Search in Dynamic Graphs
Out-of-Core Edge Partitioning at Linear Run-Time
PeriodicSketch: Finding Periodic Items in Data Streams
Personalized Graph Summarization: Formulation, Scalable Algorithms, and Applications
PICASSO: Unleashing the Potential of GPU-centric Training for Wide-and-deep Recommender Systems
PinSQL: Pinpoint Root Cause SQLs to Resolve Performance Issues in Cloud Databases
Platform-Oriented Event Time Allocation(Extended Abstract)
PolarDB-X: An Elastic Distributed Relational Database for Cloud-Native Applications
Privacy-Preserving Collaborative Filtering Using Fully Homomorphic Encryption
Provenance-aware Discovery of Functional Dependencies on Integrated Views
PSP: Progressive Space Pruning for Efficient Graph Neural Architecture Search
Querying Maximum Quasi-independent Set by Pay-and-Recycle
Reachability-Driven Influence Maximization in Time-dependent Road-social Networks
Reachability Labeling for Distributed Graphs
Recurrent Learning on $\text{PM}_{2.5}$ Prediction Based on Clustered Airbox Dataset: Extended Abstract
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching
Reliable Community Search on Uncertain Graphs
Robust and Explainable Autoencoders for Unsupervised Time Series Outlier Detection
RobustScaler: QoS-Aware Autoscaling for Complex Workloads
RW-Tree: A Learned Workload-aware Framework for R-tree Construction

« prev Page 4/5 next »