yusuke1997/dblp-id-title huggingface dataset:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
GE 2 : A General and Efficient Knowledge Graph Embedding Learning System
FedKNN: Secure Federated k-Nearest Neighbor Search
No Cliques Allowed: The Next Step Towards BDD/FC Conjecture
Maximum k-Plex Computation: Theory and Practice
XInsight: eXplainable Data Analysis Through The Lens of Causality
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs
Fair and Actionable Causal Prescription Ruleset
U-DPAP: Utility-aware Efficient Range Counting on Privacy-preserving Spatial Data Federation
Revisiting B-tree Compression: An Experimental Study
SWIX: A Memory-efficient Sliding Window Learned Index
Towards a Converged Relational-Graph Optimization Framework
INEv: In-Network Evaluation for Event Stream Processing
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]
Disco: A Compact Index for LSM-trees
T-Rex: Optimizing Pattern Search on Time Series
LpBound: Pessimistic Cardinality Estimation Using ℓ p -Norms of Degree Sequences
Hydraulis: Balancing Large Transformer Model Training via Co-designing Parallel Strategies and Data Assignment
Vineyard: Optimizing Data Sharing in Data-Intensive Analytics
Low Rank Learning for Offline Query Optimization
Lightweight Materialization for Fast Dashboards Over Joins
Together is Better: Heavy Hitters Quantile Estimation
SALI: A Scalable Adaptive Learned Index Framework based on Probability Models
DP-starJ: A Differential Private Scheme towards Analytical Star-Join Queries
LightCTS: A Lightweight Framework for Correlated Time Series Forecasting
Exploratory Training: When Annotators Learn About Data
Output-Sensitive Evaluation of Regular Path Queries
Automatic Database Configuration Debugging using Retrieval-Augmented Language Models
Theoretically and Practically Efficient Maximum Biclique Search
Near-Duplicate Sequence Search at Scale for Large Language Model Memorization Evaluation
Efficient Query Re-optimization with Judicious Subquery Selections
Fast Approximate Similarity Join in Vector Databases
Theoretically and Practically Efficient Maximum Defective Clique Search
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice
Streaming Algorithms with Few State Changes
Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach
Scaling Up k-Clique Densest Subgraph Detection
Practical Dynamic Extension for Sampling Indexes
DARQ Matter Binds Everything: Performant and Composable Cloud Programming via Resilient Steps
MRVs: Enforcing Numeric Invariants in Parallel Updates to Hotspots with Randomized Splitting
FlexMoE: Scaling Large-scale Sparse Pre-trained Model Training via Dynamic Device Placement
What's the Difference? Incremental Processing with Change Queries in Snowflake
Rethinking Learned Cost Models: Why Start from Scratch?
Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
Privacy-preserving and Verifiable Causal Prescriptive Analytics
SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost
Learned Data-aware Image Representations of Line Charts for Similarity Search
k-Clustering with Comparison and Distance Oracles
JoinSketch: A Sketch Algorithm for Accurate and Unbiased Inner-Product Estimation
Discovering Top-k Relevant and Diversified Rules
Scalable Distributed Inverted List Indexes in Disaggregated Memory
Spatio-Temporal Denoising Graph Autoencoders with Data Augmentation for Photovoltaic Data Imputation
Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction
SplineSketch: Even More Accurate Quantiles with Error Guarantees
Transforming RDF Graphs to Property Graphs using Standardized Schemas
STile: Searching Hybrid Sparse Formats for Sparse Deep Learning Operators Automatically
ADGNN: Towards Scalable GNN Training with Aggregation-Difference Aware Sampling
LSM-Raft: Optimizing Raft for LSM-tree Store
PGTuner: An Efficient Framework for Automatic and Transferable Configuration Tuning of Proximity Graphs
Nezha: An Efficient Distributed Graph Processing System on Heterogeneous Hardware
An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation
B-Trees Are Back: Engineering Fast and Pageable Node Layouts
A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
LPLM: A Neural Language Model for Cardinality Estimation of LIKE-Queries
High Precision ≠ High Cost: Temporal Data Fusion for Multiple Low-Precision Sensors
Hourglass: An Adaptive Range Filter with Lightweight Hybrid Encoding
Categorical Data Clustering via Value Order Estimated Distance Metric Learning
PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification
BPF-DB: A Kernel-Embedded Transactional Database Management System For eBPF Applications
Disaggregating RocksDB: A Production Experience
Minimizing Conjunctive Regular Path Queries
A New Paradigm in Tuning Learned Indexes: A Reinforcement Learning Enhanced Approach
H-Rocks: CPU-GPU accelerated Heterogeneous RocksDB on Persistent Memory
Privacy Amplification by Sampling under User-level Differential Privacy
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
Secure Sampling for Approximate Multi-party Query Processing
Deep Overlapping Community Search via Subspace Embedding
PACMMOD Volume 2 Issue 1: Editorial
An Efficient and Exact Algorithm for Locally h -Clique Densest Subgraph Discovery
NEXT: A New Secondary Index Framework for LSM-based Data Storage
Fault Tolerance Placement in the Internet of Things
QaaD (Query-as-a-Data): Scalable Execution of Massive Number of Small Queries in Spark
Rethink Query Optimization in HTAP Databases
Dumpy: A Compact and Adaptive Index for Large Data Series Collections
Dangers of List Processing in Querying Property Graphs
Aster: Enhancing LSM-structures for Scalable Graph Database
Virtual-Memory Assisted Buffer Management
A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness
gSWORD: GPU-accelerated Sampling for Subgraph Counting
Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories
PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba
Complex Event Recognition under Time Constraints: Towards a Formal Framework for Efficient Query Evaluation
Agree to Disagree: Robust Anomaly Detection with Noisy Labels
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
Sibyl: Forecasting Time-Evolving Query Workloads
Fast Matrix Multiplication meets the Submodular Width
Online Marketplace: A Benchmark for Data Management in Microservices
MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs
Measuring Re-identification Risk
Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queries
PACMMOD, V3, N2 (PODS), May 2025 Editorial
Time Series Representation for Visualization in Apache IoTDB
Integral Densest Subgraph Search on Directed Graphs
Pasta: A Cost-Based Optimizer for Generating Pipelining Schedules for Dataflow DAGs
SBSC: A fast Self-tuned Bipartite proximity graph-based Spectral Clustering
Reliable Text-to-SQL with Adaptive Abstention
Effectiveness Perspectives and a Deep Relevance Model for Spatial Keyword Queries
Steered Training Data Generation for Learned Semantic Type Detection
SPID-Join: A Skew-resistant Processing-in-DIMM Join Algorithm Exploiting the Bank- and Rank-level Parallelisms of DIMMs
Certain and Approximately Certain Models for Statistical Learning
Unsupervised Hashing with Semantic Concept Mining
ACGraph: An Efficient Asynchronous Out-of-Core Graph Processing Framework
DAMR: Dynamic Adjacency Matrix Representation Learning for Multivariate Time Series Imputation
MOST: Model-Based Compression with Outlier Storage for Time Series Data
Rethinking The Compaction Policies in LSM-trees
Few-shot Text-to-SQL Translation using Structure and Content Prompt Learning
When Private Blockchain Meets Deterministic Database
SwiftSpatial: Spatial Joins on Modern Hardware
Privacy and Accuracy-Aware AI/ML Model Deduplication
Time Series Data Validity
Accelerating Core Decomposition in Billion-Scale Hypergraphs
DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks
MatCo: Computing Match Cover of Subgraph Query over Graph Data
Predictive and Near-Optimal Sampling for View Materialization in Video Databases
SieveSketch: A Fine-grained and Adaptive Sketch Framework for Accurate Frequency Estimation
Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs
Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks
Scalable Complex Event Processing on Video Streams
Accelerating Graph Indexing for ANNS on Modern CPUs
PACMMOD Volume 2 Issue 4: Editorial
NOC-NOC: Towards Performance-optimal Distributed Transactions
On Graph Representation for Attributed Hypergraph Clustering
PACMMOD Volume 1, Issue 3: Editorial
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings
Auto-Formula: Recommend Formulas in Spreadsheets using Contrastive Learning for Table Representations
GraphINC: Graph Pattern Mining at Network Speed
Learning-based Property Estimation with Polynomials
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction
Pluto: Sample Selection for Robust Anomaly Detection on Polluted Log Data
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks
InfiniFilter: Expanding Filters to Infinity and Beyond
GRF: A Global Range Filter for LSM-Trees with Shape Encoding
Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities
Credible Intervals for Knowledge Graph Accuracy Estimation
On Efficient Large Sparse Matrix Chain Multiplication
Live Patching for Distributed In-Memory Key-Value Stores
A Quantum-Leap into Schema Matching: Beyond 1-to-1 Matchings
LeaFi: Data Series Indexes on Steroids with Learned Filters
Below and Above Why-Provenance for Datalog Queries
AWARE: Workload-aware, Redundancy-exploiting Linear Algebra
BtrBlocks: Efficient Columnar Compression for Data Lakes
PrivRM : A Framework for Range Mean Estimation under Local Differential Privacy
Speeding Up End-to-end Query Execution via Learning-based Progressive Cardinality Estimation
Kepler: Robust Learning for Parametric Query Optimization
OTClean: Data Cleaning for Conditional Independence Violations using Optimal Transport
Evaluating Datalog over Semirings: A Grounding-based Approach
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Theories and Principles Matter: Towards Visually Appealing and Effective Abstraction of Property Graph Queries
ROME: Robust Query Optimization via Parallel Multi-Plan Execution
A New Sparse Data Clustering Method Based On Frequent Items
Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching
Bursting Flow Query on Large Temporal Flow Networks
Efficient Sampling Approaches to Shapley Value Approximation
An Elephant Under the Microscope: Analyzing the Interaction of Optimizer Components in PostgreSQL
Graph Learning for Interactive Threat Detection in Heterogeneous Smart Home Rule Data
One Seed, Two Birds: A Unified Learned Structure for Exact and Approximate Counting
AixelNet: A Pre-trained Model with Table-aware Adaptation for Structured Data Prediction
Density Decomposition of Bipartite Graphs
Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability
Shapley Revisited: Tractable Responsibility Measures for Query Answers
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs
Budgeted Strong Community Search in Heterogeneous Graphs
Practical Differentially Private and Byzantine-resilient Federated Learning
PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware
CRDV: Conflict-free Replicated Data Views
GPH: An Efficient and Effective Perfect Hashing Scheme for GPU Architectures
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data
Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value Store
Approximate Query Processing under Updates
Beyond Vector Search: Querying With and Without Predicates
Scalable and Efficient Full-Graph GNN Training for Large Graphs
Computing A Well-Representative Summary of Conjunctive Query Results
Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries
Containment of Graph Queries Modulo Schema
Finding Heavy-Hitters with Optimal State Changes
NeutronHeter: Optimizing Distributed Graph Neural Network Training for Heterogeneous Clusters
TQEx: Tensor-based Query Engine Enhanced by Bridging the Gap
Adaptive Sharding in Untrusted Environments
Qr-Hint: Actionable Hints Towards Correcting Wrong SQL Queries
High-performance Effective Scientific Error-bounded Lossy Compression with Auto-tuned Multi-component Interpolation
GTS: GPU-based Tree Index for Fast Similarity Search
Nested Parquet Is Flat, Why Not Use It? How To Scan Nested Data With On-the-Fly Key Generation and Joins
Counting Is All You Need for Instant Tuple Discovery: Enabling Real-Time HTAP in Standalone DBMSs
Table-GPT: Table Fine-tuned GPT for Diverse Table Tasks
Understanding the Performance Implications of the Design Principles in Storage-Disaggregated Databases
Determining Exact Quantiles with Randomized Summaries
High-Performance Query Processing with NVMe Arrays: Spilling without Killing Performance
LinCQA: Faster Consistent Query Answering with Linear Time Guarantees
Understanding Robustness Issues of Updatable Learned Indexes: [Experiments & Analysis]
Optimizing Dataflow Systems for Scalable Interactive Visualization
Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search
Retrieve-and-Verify: A Table Context Selection Framework for Accurate Column Annotations
Fast Optimal Group Steiner Tree Search using GPUs
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
BladeDISC: Optimizing Dynamic Shape Machine Learning Workloads via Compiler Approach
A Universal Question-Answering Platform for Knowledge Graphs
A Profit-Maximizing Data Marketplace with Differentially Private Federated Learning under Price Competition
T3: Accurate and Fast Performance Prediction for Relational Database Systems With Compiled Decision Trees
NeuroSketch: Fast and Approximate Evaluation of Range Aggregate Queries with Neural Networks
Schema-Based Query Optimisation for Graph Databases
Fast and Scalable Data Transfer Across Data Systems
Wred: Workload Reduction for Scalable Index Tuning
SchemaPile: A Large Collection of Relational Database Schemas
ClipSim: A GPU-friendly Parallel Framework for Single-Source SimRank with Accuracy Guarantee
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods
Banzhaf Values for Facts in Query Answering
Near-Duplicate Text Alignment with One Permutation Hashing
GeoKGM: A Multimodal Large Language Model for Zero-Shot Knowledge Graph Completion in Geospatial Databases
Efficient Algorithm for K-Multiple-Means
How Good are Learned Cost Models, Really? Insights from Query Optimization Tasks
WeBridge: Synthesizing Stored Procedures for Large-Scale Real-World Web Applications
Revisiting the Design of In-Memory Dynamic Graph Storage
The Best of Both Worlds: On Repairing Timestamps and Attribute Values for Multivariate Time Series
Synthesizing Third Normal Form Schemata that Minimize Integrity Maintenance and Update Overheads: Parameterizing 3NF by the Numbers of Minimal Keys and Functional Dependencies
CodeS: Towards Building Open-source Language Models for Text-to-SQL
Parallel Algorithms for Hierarchical Nucleus Decomposition
ML2DAC: Meta-Learning to Democratize AutoML for Clustering Analysis
Estimating Biclique Counts with Accuracy Guarantees
Query Optimization for Database-Returning Queries
When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories
Adda: Towards Efficient in-Database Feature Generation via LLM-based Agents
RLS Side Channels: Investigating Leakage of Row-Level Security Protected Data Through Query Execution Time
LiteHST: A Tree Embedding based Method for Similarity Search
Output-Optimal Algorithms for Join-Aggregate Queries
DTT: An Example-Driven Tabular Transformer for Joinability by Leveraging Large Language Models
FactorJoin: A New Cardinality Estimation Framework for Join Queries
Learned Offline Query Planning via Bayesian Optimization
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
PrivAGS: Differentially Private Attributed Graph Synthesis
On the Feasibility and Benefits of Extensive Evaluation
Smallest Synthetic Witnesses for Conjunctive Queries
Parallel Communication Obliviousness: One Round and Beyond
On Querying Connected Components in Large Temporal Graphs
Fast Matrix Multiplication for Query Processing
SWASH: A Flexible Communication Framework with Sliding Window-Based Cache Sharing for Scalable DGNN Training
Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs
Efficient Core Maintenance in Large Bipartite Graphs
OpenSearch-SQL: Enhancing Text-to-SQL with Dynamic Few-shot and Consistency Alignment
AutoCTS+: Joint Neural Architecture and Hyperparameter Search for Correlated Time Series Forecasting
Time2State: An Unsupervised Framework for Inferring the Latent States in Time Series Data
Effective Clustering for Large Multi-Relational Graphs
Ghost: A General Framework for High-Performance Online Similarity Queries over Distributed Trajectory Streams
Efficient Proximity Queries on Simplified Height Maps
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
GTX: A Write-Optimized Latch-free Graph Data System with Transactional Support
View-based Explanations for Graph Neural Networks
DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee
One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage
Relational Algorithms for Top-k Query Evaluation
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality
SketchQL: Video Moment Querying with a Visual Query Interface
Extending SQL to Return a Subdatabase
PQCache: Product Quantization-based KVCache for Long Context LLM Inference
R2D2: Reducing Redundancy and Duplication in Data Lakes
Grep: A Graph Learning Based Database Partitioning System
Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt?
PLATON: Top-down R-tree Packing with Learned Partition Policy
Test Data Generation for Complex SQL Queries
Capsule: An Out-of-Core Training Mechanism for Colossal GNNs
Building Stateless Serverless Vector DBs via Block-based Data Partitioning
Adaptive Quotient Filters
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment
Enriching Recommendation Models with Logic Conditions
AJOSC: Adaptive Join Order Selection for Continuous Queries
Using Cloud Functions as Accelerator for Elastic Data Analytics
Join Size Bounds using l p -Norms on Degree Sequences
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms
Anchor: A Library for Building Secure Persistent Memory Systems
A Fast, Mergeable, and LDP Compatible Sketch for Counting the Number of Distinct Values in Fully Dynamic Tables
A faster FPRAS for #NFA
Aero: Adaptive Query Processing of ML Queries
Deep Active Alignment of Knowledge Graph Entities and Schemata
SRS: Detecting Logic Bugs of Join Implementation in DBMSs via Set Relation Synthesis
Popularity Ratio Maximization: Surpassing Competitors through Influence Propagation
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
Fast Indexing for Temporal Information Retrieval
PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees
Differentially Private Explanations for Clusters
PLAQUE: Automated Predicate Learning at Query Time
Closest Pairs Search Over Data Stream
B 2 Mark: A Blind and Buyer-Traceable Watermarking Scheme for Tabular Datasets
Query Answering Under Volume-Based Diversity Functions
Clementi: Efficient Load Balancing and Communication Overlap for Multi-FPGA Graph Processing
Query-Aware Path Inference from Spatial Videos
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
AS-Parser: Log Parsing Based on Adaptive Segmentation
Free Join: Unifying Worst-Case Optimal and Traditional Joins
A Theoretical Framework for Distribution-Aware Dataset Search
NeuSO: Neural Optimizer for Subgraph Queries
PACMMOD V3, N1 (SIGMOD), February 2025: Editorial
Can Learned Indexes be Built Efficiently? A Deep Dive into Sampling Trade-offs
Clustering with Set Outliers and Applications in Relational Clustering
User-Centric Property Graph Repairs
Optimal Dynamic Parameterized Subset Sampling
Malleus: Straggler-Resilient Hybrid Parallel Training of Large-scale Models via Malleable Data and Model Parallelization
Computing Range Consistent Answers to Aggregation Queries via Rewriting
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
In-Database Data Imputation
When Automatic Filtering Comes to the Rescue: Pre-Computing Company Competitor Pairs in Owler
When is Shapley Value Computation a Matter of Counting?
WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search
Veil: A Storage and Communication Efficient Volume-Hiding Algorithm
Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries
Brook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking Protocol
Subgroup Discovery with Small and Alternative Feature Sets
RITA: Group Attention is All You Need for Timeseries Analytics
MorphStream: Adaptive Scheduling for Scalable Transactional Stream Processing on Multicores
OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes
FedCSS: Joint Client-and-Sample Selection for Hard Sample-Aware Noise-Robust Federated Learning
Reliable and Private Utility Signaling for Data Markets
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme
GenJoin: Conditional Generative Plan-to-Plan Query Optimizer that Learns from Subplan Hints
Spruce: a Fast yet Space-saving Structure for Dynamic Graph Storage
Automated Validating and Fixing of Text-to-SQL Translation with Execution Consistency
ChainKV: A Semantics-Aware Key-Value Store for Ethereum System
FACET: Robust Counterfactual Explanation Analytics
Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence
DepCache: A KV Cache Management Framework for GraphRAG with Dependency Attention
RLOMM: An Efficient and Robust Online Map Matching Framework with Reinforcement Learning
iFlipper: Label Flipping for Individual Fairness
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
Representation Obliviousness and Pseudodeterminism in Streaming Algorithms
PACMMOD V1 N1 Editorial - Welcome to PACMMOD
From Suspicious Errors to Valid Data: On Repairing Spatio-Temporal Data via Spatial and Temporal Dependencies
FEC: Efficient Deep Recommendation Model Training with Flexible Embedding Communication
CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression
dbET: Execution Time Distribution-based Plan Selection
SANTOS: Relationship-based Semantic Table Union Search
Maestro: Automatic Generation of Comprehensive Benchmarks for Question Answering Over Knowledge Graphs