Pith. sign in

iPDB -- Optimizing Semantic SQL Queries

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it
abstract

Structured Query Language (SQL) has remained the standard query language for databases. SQL is highly optimized for processing structured data laid out in relations. Meanwhile, in the present application development landscape, it is highly desirable to utilize the power of learned models to perform complex tasks. Large language models (LLMs) have been shown to understand and extract information from unstructured textual data. However, SQL as a query language and accompanying relational database systems are either incompatible or inefficient for workloads that require leveraging learned models. This results in complex engineering and multiple data migration operations that move data between the data sources and the model inference platform. In this paper, we present iPDB, a relational system that supports in-database machine learning (ML) and large language model (LLM) inferencing using extended SQL syntax. In iPDB, LLMs and ML calls can function as semantic projects, as predicates to perform semantic selects and semantic joins, or for semantic aggregations in group-by clauses. iPDB has a new relational predict operator along with semantic query optimizations that enable users to write and efficiently execute semantic SQL queries, outperforming other state-of-the-art systems by 2.5x mean speedup, with speedups of up to 30x.

fields

cs.DB 4

years

2026 4

representative citing papers

SemCEB: A Cardinality Estimation Benchmark for Semantic Operators

cs.DB · 2026-06-22 · unverdicted · novelty 7.0

SemCEB is the first benchmark for cardinality estimation over semantic operators, evaluating sampling methods and Semantic Histograms on accuracy, cost, latency, and memory using 102 queries on a real-world dataset.

Cost-Aware Optimization for Agentic Query Execution

cs.DB · 2026-06-02 · unverdicted · novelty 7.0

EnumGRPO is a self-improving optimizer for agentic query execution that reduces LLM-operator costs by ~317x while improving accuracy by 18% over a hybrid baseline across four databases.

PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans

cs.DB · 2026-04-10 · conditional · novelty 7.0

PLOP is a cost-based optimizer that finds optimal placements for semantic LLM operators in hybrid query plans via dynamic programming, delivering up to 1.5x speedup and 4.29x cost reduction on 44 benchmark queries while preserving accuracy.

SemJoin: Semantic Join Optimization

cs.DB · 2026-06-28 · unverdicted · novelty 6.0

SemJoin dynamically routes semantic joins via an LLM advisor to Cluster Join or Classifier strategies, achieving 20-33 higher F1 than ABJ and lower token cost than FDJ on three datasets.

citing papers explorer

Showing 4 of 4 citing papers.

  • SemCEB: A Cardinality Estimation Benchmark for Semantic Operators cs.DB · 2026-06-22 · unverdicted · none · ref 15 · internal anchor

    SemCEB is the first benchmark for cardinality estimation over semantic operators, evaluating sampling methods and Semantic Histograms on accuracy, cost, latency, and memory using 102 queries on a real-world dataset.

  • Cost-Aware Optimization for Agentic Query Execution cs.DB · 2026-06-02 · unverdicted · none · ref 16 · internal anchor

    EnumGRPO is a self-improving optimizer for agentic query execution that reduces LLM-operator costs by ~317x while improving accuracy by 18% over a hybrid baseline across four databases.

  • PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans cs.DB · 2026-04-10 · conditional · none · ref 15 · internal anchor

    PLOP is a cost-based optimizer that finds optimal placements for semantic LLM operators in hybrid query plans via dynamic programming, delivering up to 1.5x speedup and 4.29x cost reduction on 44 benchmark queries while preserving accuracy.

  • SemJoin: Semantic Join Optimization cs.DB · 2026-06-28 · unverdicted · none · ref 2 · internal anchor

    SemJoin dynamically routes semantic joins via an LLM advisor to Cluster Join or Classifier strategies, achieving 20-33 higher F1 than ABJ and lower token cost than FDJ on three datasets.