Capstractcscapstract:2611.00003

Computer Science > Databases

Title:Locality-Aware Join Planning with Reserved Capacity

Abstract:

Physical query plans normally take the locations of input records as given. In a class of intermittently connected deployments, record placement can still be changed when the query is known, subject to a hard limit on occupancy and a cost for changing existing assignments. We study this problem at seated receptions, where participants carry input records and each dining table is a local execution site. A cost model jointly selects a seating plan and a physical join plan. It distinguishes positive rows from completeness evidence so that an empty chair can provide evidence for a left outer join whose preserved row is located elsewhere. On 120 held-out seating instances drawn at three scales, all evaluated plans agree with centralized relational evaluation. At 96 guests the joint optimizer reduces the median number of boundary-crossing records from 146 to 53 for a grouped program query and from 215 to 76 for a sponsor lookup. Central collection is cheaper for the triangle workload. When absent-carrier acknowledgments are dropped from the protocol, 8.8% of sponsor answers at 96 guests with a vacant reservation report absence before the inner relation is closed. We quantify the cost of retaining a place for a carrier that never arrives.

Comments:3 figures, 3 tables. Includes the exchange protocol and a plan verification appendix.
Subjects:Databases (cs.DB)
Cite as:capstract:2611.00003 [cs.DB]
 (or capstract:2611.00003v1 [cs.DB] for this version)

Submission history

From: Amalia R. Nzegho
[v1] Fri, 30 Oct 2026 09:37:39 UTC (186 KB)

Current browse context:

cs
Change to browse by:

Export citation