Database Paper Browser

Back to papers

Plan-Per-Tuple Optimization Solution - Parallel Execution of Expensive User-Defined Functions

Summary: Plan-per-tuple optimization enables per-tuple execution plans for expensive/high-variance UDF predicates on multimedia objects in shared-nothing DBs. Runtime per-tuple selection among N! resource strategies (interconnect, memory, CPU, disk) enables adaptive plans for non co-located joins. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8539
Venue
VLDB
Year
1998
Pagerank
4.1945683e-05
Overall Rank
12,755 | 11.27%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers