SIGMOD/PODS Plenary Poster Sessions
Poster Session Venue & Layout
Posters are being put up over the following poster areas which are primarily in (covered and air conditioned) hangars put up between the Scarlet room area and the Convention Centre. Poster stands are numbered, and each poster is assigned to one of the numbered poster stands for its assigned day.
Poster Area 1
Poster Area 2A
Poster Area 2B
Zinnia Prefunction Area
Tuesday, June 2
Tuesday, June 2 · 5:00 PM – 6:30 PM
PODS Sessions 1 – 5
PODS
Poster Area 1
Poster Stands 1.1 – 1.15
1.1: Near-Optimality for Single-Source Personalized PageRank
1.2: Clustering with Set Outliers and Applications in Relational Clustering
1.3: Coresets for Robust Query Optimization
1.4: Size Bound-Adorned Datalog
1.5: Recursive querying of neural networks via weighted structures
1.6: A Logical View of GNN-Style Computation and the Role of Activation Functions
1.7: Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories
1.8: Tight Lower Bounds for ℓ2 Sampling
1.9: Finding Heavy-Hitters with Optimal State Changes
1.10: Representation Obliviousness and Pseudodeterminism in Streaming Algorithms
1.11: Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
1.12: Bounding the Fragmentation of B-trees Subject to Batched Insertions
1.13: Faster Relational Algorithms Using Geometric Data Structures
1.14: A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
1.15: Tractability Frontiers of the Shapley Value for Aggregate
Conjunctive Queries
SIGMOD Sessions R2 + R7
SIGMOD
Poster Area 1
Poster Stands 1.16 – 1.31
1.16: GenJoin: Conditional Generative Plan-to-Plan Query Optimizer that Learns from Subplan Hints
1.17: Large-Scale Multiple Query Optimisation with Incremental Quantum(-Inspired) Annealing
1.18: Query Optimization for Database-Returning Queries
1.19: Reliable Answers for Recurring Questions: Boosting Text-to-SQL Accuracy with Template Constrained Decoding
1.20: SplineSketch: Even More Accurate Quantiles with Error Guarantees
1.21: CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations
1.22: PRISM: Navigating Cost-Accuracy Trade-offs for NL2SQL
1.23: Regular Expression Indexing for Log Analysis
1.24: Brook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking Protocol
1.25: [Best Paper Honorable Mention] Sublime: Sublinear Error & Space for Unbounded Skewed Streams
1.26: Focus! Fast On-disk Concurrency-control Using Sketches
1.27: Adaptive Sharding in Untrusted Environments
1.28: Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases
1.29: LeaseGuard: Raft Leases Done Right
1.30: Predictive Translation: High-Performance Buffer Management Without the Trade-Offs
1.31: O3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer Offloading
SIGMOD Sessions R1 + R6 + R11
SIGMOD
Poster Area 2A
Poster Stands 2A.1 – 2A.24
2A.1: DRAMA: Unifying Data Retrieval and Analysis for Open-Domain Queries
2A.2: Visual Template Inference for Data Extraction from Documents
2A.3: Cut Costs, Not Accuracy: LLM-Powered Data Processing with Guarantees
2A.4: Chatty-KG: A Multi-Agent AI System for On-Demand Conversational Question Answering over Knowledge Graphs
2A.5: AgenticScholar: Agentic Data Management with Pipeline Orchestration for Scholarly Corpora
2A.6: Efficient LLM Serving for Agentic Workflows: A Data Systems Perspective
2A.7: Embedings for Numericl Data Preserving Unit and Variable Semantics
2A.8: BAT: Target-Instance-Free Data Preparation Synthesis via LLM-Driven Tree Search
2A.9: In-context Clustering-based Entity Resolution with Large Language Models: A Design Space Exploration
2A.10: Retrieve-and-Verify: A Table Context Selection Framework for Accurate Column Annotations
2A.11: Data-Semantics-Aware Recommendation of Diverse Pivot Tables
2A.12: AutoDDG: Automated Dataset Description Generation using Large Language Models
2A.13: BEACON: Budget-Aware Entity Matching Across Domains
2A.14: Shape-Agnostic Table Overlap Discovery: A Maximum Common Subhypergraph Approach
2A.15: LSHAlign: All-Pair Near-Duplicate Text Alignment via Locality-Sensitive Hashing
2A.16: SHoTClean: Bridging Soft and Hard Constraints for Multivariate Time Series Cleaning
2A.17: Stochastic Submodular Data Forgetting
2A.18: Causal Explanations for Disparate Trends: Where and Why?
2A.19: Stress-Testing Causal Claims via Cardinality Repairs
2A.20: Analyzing Deviations from Monotonic Trends through Database Repair
2A.21: Discovery of Denial Constraints with Hardware Acceleration
2A.22: Local Stability of Rankings
2A.23: Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
2A.24: Interpretable Attribute Discretization
SIGMOD Sessions R4 + R8 + R12 + R13 + R14
SIGMOD
Poster Area 2B
Poster Stands 2B.1 - 2B.25
2B.1: Zero-Redundancy Search for Bi-Components in Bipartite Graphs
2B.2: Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search
2B.3: High-Throughput, Cost-Effective Billion-Scale Vector Search with a Single GPU
2B.4: CoDec: Prefix-Shared Decoding Kernel for LLMs
2B.5: DepCache: A KV Cache Management Framework for GraphRAG with Dependency Attention
2B.6: Efficient Proximity Queries on Simplified Height Maps
2B.7: Fast Indexing for Temporal Information Retrieval
2B.8: LPStream: Fine-grained Lazy Provenance for Stream Processing
2B.9: WaveStitch: Flexible and Fast Conditional Time Series Generation With Diffusion Models
2B.10: Enjima: A Resource-Adaptive Stream Processing System
2B.11: FIRAS: A Framework for Interval Range Search and Sampling
2B.12: DimWeaver: Dimensional Weaved Trajectory Compression
2B.13: Sketch-based Secure Query Processing for Streaming Data
2B.14: Reward-SQL: Boosting Text-to-SQL via Stepwise Execution-Aware Reasoning and Process-Supervised Rewards
2B.15: Query Rewriting via Large Language Models
2B.16: Augmenting Real-World Query Optimizers Without Modifying Internals: Efficient Plan Reuse and List-wise Plan Ranking
2B.17: Bridging the Gap: Cardinality Estimation for Semantic Queries on Unstructured Data
2B.18: APQO: An Adaptive Framework for Parametric Query Optimization
2B.19: Enumerating Graph Pattern Matches with ML Oracles
2B.20: LINE: A Learned Index with Group-Enhanced Leaves and Cache-Optimized Inner Tree
2B.21: TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search
2B.22: On Self-Designing Learned Indexes
2B.23: HIRE: A Hybrid Learned Index for Robust and Efficient Performance under Mixed Workloads
2B.24: LM-Tree: A Hybrid Learned Index for Similarity Search in Metric Spaces
2B.25: CANDOR-Bench: Benchmarking In-Memory Continuous ANNS under Dynamic Open-World Streams [Experiments & Analysis]
SIGMOD Sessions R3 + R9
SIGMOD
Poster Area 3
Poster Stands 3.1 – 3.13
3.1: TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning
3.2: Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings
3.3: Distribution-Aware Exploration for Adaptive HNSW Search
3.4: PathSeer: Adaptive Neighbor Handling for Efficient Filtered ANN Search
3.5: Beyond Vector Search: Querying With and Without Predicates
3.6: Efficient Approximate Nearest Neighbor Search via Hemi-Sphere Centroids Graph
3.7: Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study: [Experiments & Analysis]
3.8: RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search
3.9: VecBench: A Controllable Benchmark for Filtered Vector Search
3.10: Balancing Global and Local: Representative Sampling for Large_Scale Vector Data
3.11: SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
3.12: GPS: Revisiting the Data Layout for Disk-based High-Dimensional Vector Search
3.13: Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations
Wednesday, June 3
Wednesday, June 3 · 5:00 PM – 6:30 PM
PODS Sessions 6 – 10
PODS
Poster Area 1
Poster Stands 1.1 – 1.13
1.1: FPT Parameterisations of Fractional and Generalised Hypertree Width
1.2: Towards Parameterized Hardness on Maintaining Conjunctive Queries
1.3: Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
1.4: Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
1.5: Optimal Enumeration of Regular Pattern Matches
1.6: PANDAExpress: a Simpler and Faster PANDA Algorithm
1.7: Fine-Grained Dichotomies for Conjunctive Queries with Minimum or
Maximum
1.8: Weighted Fourier Factorizations: Optimal Gaussian Noise for
Differentially Private Marginal and Product Queries
1.9: Concurrent Composition for Differentially Private Continual
Mechanisms
1.10: Improved Accuracy for Private Continual Cardinality Estimation in
Fully Dynamic Streams via Matrix Factorization
1.11: Subset Sampling over Joins
1.12: Towards Output-Optimal Uniform Sampling and Approximate Counting for
Join-Project Queries
1.13: Sparsity-Dimension Trade-Offs for Oblivious Subspace Embeddings
SIGMOD Sessions R16 + R18 + R29
SIGMOD
Poster Area 1
Poster Stands 1.14 – 1.33
1.14: GraphMatch: Subgraph Query Processing on Steroids
1.15: cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries
1.16: Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
1.17: Bound-Tightened Densest Subgraph Discovery on GPU
1.18: PJsim: Towards Precise and Scalable Graph Similarity
1.19: GraphRTX: Lighting the Way to Scalable Graph Analytics
1.20: Sublime: Selecting Subgraph Matching Algorithms via Machine Learning
1.21: A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]
1.22: Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR
1.23: RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage
1.24: FaaSBoard: Efficient Graph Processing with a Disaggregated Architecture on Serverless Services
1.25: ACGraph: An Efficient Asynchronous Out-of-Core Graph Processing Framework
1.26: A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness: [Experiments & Analysis]
1.27: GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries
1.28: Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware
1.29: NeutronHeter: Optimizing Distributed Graph Neural Network Training for Heterogeneous Clusters
1.30: Improving LZ4 for Effective Compression and Efficient Query
1.31: Cleaning Time Series under Seasonal and Trend Constraints
1.32: Reliable and Private Utility Signaling for Data Markets
1.33: A Fast, Mergable, and LDP Compatible Sketch for Counting the Number of Distinct Values in Fully Dynamic Tables
SIGMOD Sessions R21 + R22 + R27
SIGMOD
Poster Area 2A
Poster Stands 2A.1 - 2A.24
2A.1: On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
2A.2: Qualitative Join Discovery in Data Lakes using Examples
2A.3: A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations
2A.4: Poisson Sampling over Acyclic Joins
2A.5: Accelerating Approximate Analytical Join Queries over Unstructured Data with Statistical Guarantees
2A.6: SmartRabbit: An Interactive Query Processor
2A.7: Factorized and Vectorized Execution: Optimizing Analytical and Semantic Queries over Relations
2A.8: Stochastic Variational Inference for Datalog Probabilistic Programming
2A.9: Query-Aware Path Inference from Spatial Videos
2A.10: Task Cascades for Efficient Unstructured Data Processing
2A.11: Aeris Filter: A Strongly and Monotonically Adaptive Range Filter
2A.12: Breadcrumb Filters: Fast Fully Featured Filters
2A.13: Causal Search for Skylines (CSS): Causally-Informed Selective Data De-Correlation
2A.14: Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
2A.15: Zeno Filter: To Infinity in Tiny Steps
2A.16: To Adapt or Not to Adapt, That is the Ski Question
2A.17: DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search
2A.18: WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search
2A.19: Building Efficient Serverless Vector DBs via Block-based Data Partitioning: [Experiments & Analysis]
2A.20: [Best Paper Honorable Mention] Integrating Vector Databases across Embedding Models
2A.21: DiskJoin: Large-scale Vector Similarity Join with SSD
2A.22: FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search
2A.23: An In-Depth Study of Filter-Agnostic Vector Search on a PostgreSQL Database System: [Experiments & Analysis]
2A.24: Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph
SIGMOD Sessions R17 + R23 + R24 + R26
SIGMOD
Poster Area 2B
Poster Stands 2B.1 - 2B.26
2B.1: Automated Discovery of Test Oracles for Database Management Systems Using LLMs
2B.2: Test Data Generation for Complex SQL Queries
2B.3: Understanding and Detecting Query Performance Regression in Practical Index Tuning: [Experiments & Analysis]
2B.4: AgentTune: An Agent-Based Large Language Model Framework for Database Knob Tuning
2B.5: Unseen Anomaly Detection from System Logs
2B.6: SQLBarber: A System Leveraging Large Language Models to Generate Customized and Realistic SQL Workloads
2B.7: 100x Cost & Latency Reduction: Performance Analysis of AI Query Approximation using Lightweight Proxy Models: [Experiments & Analysis]
2B.8: Detecting Join Bugs in Database Engines via Join Implication Reasoning
2B.9: AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams
2B.10: Improving Range Scan Performance in LSM-trees with Group Caching
2B.11: Concurrent Path-Copying Update to Tree Structures
2B.12: Loom: Weaving PCS-Preserving and Searchable Cloud Backups for Secure Messaging
2B.13: Performant Synchronization in Geo-Distributed Databases
2B.14: A General Framework for Per-record Differential Privacy
2B.15: Defense against Poisoning Attacks under Shuffle-DP
2B.16: Shielding PII to Prevent Re-identification and Preserve Utility
2B.17: N2E: A General Framework to Reduce Node-Differential Privacy to Edge-Differential Privacy for Graph Analytics
2B.18: Acyclic Graph Pattern Counting under Local Differential Privacy
2B.19: Differentially Private Explanations for Clusters
2B.20: PrivAGS: Differentially Private Attributed Graph Synthesis
2B.21: Aegis: A Correlation-Based Data Masking Advisor for Data Sharing Ecosystems
2B.22: Rollbaccine: Herd Immunity against Storage Rollback Attacks in TEEs
2B.23: NSHEDB: Noise-Sensitive Homomorphic Encrypted Database Query Engine
2B.24: Mathematical Foundations of Poisoning Attacks on Linear Regression over Cumulative Distribution Functions
2B.25: HONEYBEE: Efficient Role-based Access Control for Vector Databases via Dynamic Partitioning
2B.26: [Best Paper Award] GPM: The Gaussian Pancake Mechanism for Planting Undetectable Backdoors in Differential Privacy
SIGMOD Sessions R19 + R28
SIGMOD
Poster Area 3
Poster Stands 3.1 – 3.11
3.1: Automating Database-Native Function Code Synthesis with LLMs
3.2: AixelAsk: A Stepwise-Guided Retrieval and Reasoning Framework for Large Table QA
3.3: DIVER: A Robust Text-to-SQL System with Dynamic Interactive Value Linking and Evidence Reasoning
3.4: SRS: Detecting Logic Bugs of Join Implementation in DBMSs via Set Relation Synthesis
3.5: Finding Missed Optimizations in DBMSs through Unbalanced Short-circuit Query Construction
3.6: EPSC: Testing Database Management Systems via Equivalent Prepared Statement Construction
3.7: One DBMS, Two Modes, and a Bunch of Bugs: Catching Logic Bugs in Distributed DBMSs via Differential Testing
3.8: DBugScribe: Automatic Database Bug Reproduction from Community Reports
3.9: Are Your LLM-based Text-to-SQL Models Secure? Exploring SQL Injection via Backdoor Attacks
3.10: NRBench : A Benchmark Suite for Learned Database Components with Drift Modeling: [Experiments & Analysis]
3.11: Workload-Aware Incremental Reclustering in Cloud Data Warehouses
Thursday, June 4
Thursday, June 4 · 5:00 PM – 6:30 PM
TODS Posters
TODS
Poster Area 1
Poster Stands 1 – 6
1.1: Tight Fine-Grained Bounds for Direct Access on Join Queries
1.2:
Marrying Top-k with Skyline Queries: Operators with Relaxed Preference Input and Controllable Output
Size
1.3:
Expressiveness within Sequence Datalog
1.4:
The Bounded Cardinality Normal Form for the Logical Design of Relational Database Schemata
1.5:
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns
1.6:
Scaling and Load-Balancing Equi-Joins
SIGMOD Sessions R31 + R32 + R36
SIGMOD
Poster Area 1
Poster Stands 1.8 - 1.31
1.8: TensorSocket: Shared Data Loading for Deep Learning Training
1.9: NeurStore: Efficient In-database Deep Learning Model Management System
1.10: Mixtera: A Data Plane for Foundation Model Training
1.11: SPALM: A Sparsity-Pattern-Adaptive Library for Matrices
1.12: OctoSelector: Efficient and Effective Batch-Aware Model Selection for Large Language Models
1.13: DFLOP: A Data-driven Framework for Multimodal LLM Training Pipeline Optimization
1.14: A Backend-Agnostic Compiler for Approximate Query Processing with Probabilistic Tensor Algebra
1.15: Geld: Load-balanced D-Core Decomposition for Consumer GPUs
1.16: [Best Paper Honorable Mention] F3: The Open-Source Data File Format for the Future
1.17: Counting Is All You Need for Instant Tuple Discovery: Enabling Real-Time HTAP in Standalone DBMSs
1.18: Analysis and Evaluation of Using Microsecond-Latency Memory for In-Memory Indices and Caches in SSD-Based Key-Value Stores: [Experiments & Analysis]
1.19: Approximate Query Processing under Updates
1.20: P-MOSS: Scheduling Main-Memory Indexes Over NUMA Servers Using Next Token Prediction
1.21: PTO: A Workload-driven Predictive Table Optimizer for Lakehouse Systems
1.22: From Learning to Recycling: A Log-Structured Learned-Less Index
1.23: Translytical Processing via DB-OS Co-designed Buffer: Cross-Engine Isolation and Instant Update Visibility for HTAP
1.24: SEFRQO: A Self-Evolving Fine-Tuned RAG-Based Query Optimizer
1.25: RIB: Robust Learning-based Index Benefit Estimation
1.26: DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory
1.27: LiveBin: A Localized and Version-Aware Binned Scan Index
1.28: VecFlow: A High-Performance Vector Data Management System for Filtered-Search on GPUs
1.29: Zenith: A GPU-based Data Management System for High-Performance Multi-Vector Search on Superchips
1.30: ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks
1.31: Burr: A Benchmark for Ontology Learning from Relational Databases [Experiments & Analysis]
SIGMOD Sessions R33 + R34 + R37 + R38
SIGMOD
Poster Area 2A
Poster Stands 2A.1 - 2A.19
2A.1: Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks
2A.2: ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive & Data Science Application]
2A.3: LLM-Powered Interactive Graph Search: A Scalable and Practical Approach
2A.4: Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC
2A.5: FLEA: Frequency-based Lossless Encoding Algorithm for Periodic Time Series
2A.6: Constrained Shortest Path Finding on Terrain Surfaces
2A.7: Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks
2A.8: Adaptive Outlier Detection over Data Stream
2A.9: MTSP-LDP: A Framework for Multi-Task Streaming Data Publication under Local Differential Privacy
2A.10: Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
2A.11: Robust Fair Influence Maximization under Multiple Community Partitions
2A.12: LMSC: Local Sketch Modularity Optimisation for Size-Constrained Community Search in Networks
2A.13: DRPQ: Distributed Evaluation of Regular Path Queries On Streaming Graphs
2A.14: Through the Lens of Hubness: A Revisit on Graph-Based Approximate Nearest Neighbor Search: [Experiments & Analysis]
2A.15: MultiVis-Agent: A Multi-Agent Framework with Logic Rules for Reliable and Comprehensive Cross-Modal Data Visualization
2A.16: FlowPilot: A Recommender System for Designing Scientific Workflows
2A.17: Towards Selecting Informative Alternative Relational Query Plans for Database Education
2A.18: Comparison and Analysis of Value Linking in Text-to-SQL systems: [Experiments & Analysis]
2A.19: The Power of Anomaly Detection in Predictive Maintenance: [Experiments & Analysis]
SIGMOD Sessions R35 + R39 + R40 + R41 + R42
SIGMOD
Poster Area 2B
Poster Stands 2B.1 – 2B.22
2B.1: Fair Data Pre-processing with Imperfect Attribute Space
2B.2: PLForge: Enhancing Language Models for Natural Language to Procedural Extensions of SQL
2B.3: GeoKGM: A Multimodal Large Language Model for Zero-Shot Knowledge Graph Completion in Geospatial Databases
2B.4: Generalized Entity Matching with Adaptivity via Large Language Models
2B.5: AixelNet: Pre-trained Model with Table-aware Adaptation for Structured Data Prediction
2B.6: Hydraulis: Balancing Large Transformer Model Training via Co-designing Parallel Strategies and Data Assignment
2B.7: Quantile Estimation with Duplicates
2B.8: HotPrefix: Hotness-Aware KV Cache Scheduling for Efficient Prefix Sharing in LLM Inference Systems
2B.9: Kangaroo: Efficient Lossless Floating-Point Compression via Dynamic Reference Selection
2B.10: GoodTP: An Effective Data Selection Framework for Enhancing Trajectory Similarity Learning via Monte Carlo Tree Search
2B.11: Approximate DBSCAN via Density-Biased Sampling and Kernel Density Estimation
2B.12: ST-Raptor: LLM-Powered Semi-Structured Table Question Answering
2B.13: Understanding the Impact of Data Noise in Federated Learning: [Experiments & Analysis]
2B.14: ASSS : Adaptive Stratified Sampling for Shapley-like Values
2B.15: Hyra: Scalable Byzantine-Resilient State Storage Engine with Hierarchical Erasure-Coded
2B.16: SWMT: A Sliding Window Merkle Tree with Delayed Writes for Scalable Blockchain State Management
2B.17: LSM-Raft: Optimizing Raft for LSM-tree Store
2B.18: Periodic Community Search in Temporal Graphs: Time Series-based Methods
2B.19: Succinct Structure Representations for Efficient Query Optimization
2B.20: Guardrail: Automated Integrity Constraint Synthesis From Noisy Data
2B.21: Privacy-preserving and Verifiable Causal Prescriptive Analytics
2B.22: MoDora: Tree-Based Semi-Structured Document Analysis System