SQL function provsql.provenance_evaluate_compiled() – C++ semiring evaluation. More...

#include "postgres.h"
#include "fmgr.h"
#include "catalog/pg_type.h"
#include "utils/uuid.h"
#include "utils/builtins.h"
#include "utils/lsyscache.h"
#include "provsql_utils.h"
#include "provsql_mmap.h"
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include "Expectation.h"
#include "having_semantics.hpp"
#include "provenance_evaluate_compiled.hpp"
#include "semiring/Boolean.h"
#include "semiring/Counting.h"
#include "semiring/Formula.h"
#include "semiring/How.h"
#include "semiring/Why.h"
#include "semiring/Which.h"
#include "semiring/BoolExpr.h"
#include "semiring/Tropical.h"
#include "semiring/Viterbi.h"
#include "semiring/Lukasiewicz.h"
#include "semiring/IntervalUnion.h"
#include "semiring/MinMax.h"

Include dependency graph for provenance_evaluate_compiled.cpp:

Go to the source code of this file.

Functions
bool	join_with_temp_uuids (Oid table, const std::vector< std::string > &uuids)
	Join a provenance mapping table with a set of UUIDs using SPI.
static Datum	provenance_evaluate_compiled_internal (pg_uuid_t token, Oid table, const std::string &semiring, Oid type)
	Core implementation of compiled provenance evaluation.
Datum	provenance_evaluate_compiled (PG_FUNCTION_ARGS)
	PostgreSQL-callable wrapper for provenance_evaluate_compiled().
Datum	plain_truth (PG_FUNCTION_ARGS)
	Whether a token holds in the database as it is, every input tuple present: `sr_boolean` without a mapping.

Variables
const char *	drop_temp_table = "DROP TABLE IF EXISTS tmp_uuids;"
	DROP TABLE statement for the per-query temporary provenance mapping table.

Detailed Description

SQL function provsql.provenance_evaluate_compiled() – C++ semiring evaluation.

Implements the compiled (C++ generic) variant of provenance circuit evaluation. Unlike provenance_evaluate() (which calls user-supplied PostgreSQL functions for each semiring operation), this function evaluates the circuit using one of the built-in C++ semiring implementations from the semiring/ directory.

Supported semirings (selected by the semiring argument):

"boolean" → semiring::Boolean
"counting" → semiring::Counting
"formula" → semiring::Formula (symbolic representation as a formula)
"how" → semiring::How (canonical polynomial provenance ℕ[X])
"why" → semiring::Why (witness sets)
"which" → semiring::Which (lineage)
"boolexpr" → semiring::BoolExpr (Boolean circuit for probability)
"tropical" → semiring::Tropical (min-plus, shortest-cost)
"viterbi" → semiring::Viterbi (max-times, most-likely derivation)
"lukasiewicz" → semiring::Lukasiewicz (Łukasiewicz fuzzy t-norm)
"interval_union" → semiring::IntervalUnion (multirange union, PG14+) for any of tstzmultirange, nummultirange, int4multirange; selected by the result type of the call
"minmax" / "maxmin" → semiring::MinMax over any user-defined PostgreSQL enum type, selected by get_typtype() == TYPTYPE_ENUM

Each compiled semiring exposes parse_leaf() and (for text-valued carriers) to_text() member functions, so this file is purely a dispatcher: it picks the right semiring instance from the (result-type, semiring-name) pair, then calls the pec() template which runs the same four-step pipeline for every semiring (build leaf mapping, evaluate HAVING sub-circuits, evaluate the main circuit, encode the result as a Datum).

Definition in file provenance_evaluate_compiled.cpp.

Function Documentation

◆ join_with_temp_uuids()

bool join_with_temp_uuids	(	Oid	table,
		const std::vector< std::string > &	uuids )

Join a provenance mapping table with a set of UUIDs using SPI.

Parameters

table	OID of the provenance mapping relation.
uuids	List of UUID strings to join against.

Returns: true if a temporary table was created (caller must drop it).

Definition at line 157 of file provenance_evaluate_compiled.cpp.

Here is the caller graph for this function:

◆ plain_truth()

Datum plain_truth ( PG_FUNCTION_ARGS )

Whether a token holds in the database as it is, every input tuple present: sr_boolean without a mapping.

The rewriter filters by it the rows a displayed aggregate value reads, so that the value is what plain SQL computes on the same data: a row kept only for its provenance (the padding of a lowered outer join, a group a HAVING rejects, a row beyond a rank-filtered LIMIT) does not count. Gates whose truth follows from their children's (⊗, ⊕, ⊖, δ, ...) are walked directly, through the backend's gate cache; a comparison is left to the evaluation over the Boolean semiring, with no mapping to read.

Definition at line 526 of file provenance_evaluate_compiled.cpp.

Here is the call graph for this function:

◆ provenance_evaluate_compiled()

Datum provenance_evaluate_compiled ( PG_FUNCTION_ARGS )

PostgreSQL-callable wrapper for provenance_evaluate_compiled().

Definition at line 375 of file provenance_evaluate_compiled.cpp.

Here is the call graph for this function:

◆ provenance_evaluate_compiled_internal()

Datum provenance_evaluate_compiled_internal	(	pg_uuid_t	token,
		Oid	table,
		const std::string &	semiring,
		Oid	type )

static

Core implementation of compiled provenance evaluation.

Parameters

token	UUID of the root provenance gate.
table	OID of the provenance mapping relation.
semiring	Name of the semiring to evaluate over.
type	OID of the result element type.