arXiv (OAI Expanded)
open access
An Exact Rounds-versus-Queries Trade-off for Pointer Chasing, Machine-Checked in Lean 4
A deterministic query algorithm with $d$ rounds submits $d$ batches of queries, each chosen from the answers to earlier batches. Canonne and Gur asked for general bounds on the cost of removing rounds. For $k$-step pointer chasing over $k$ tables of $m \geq 2$ entries we determine this cost exactly:
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Query Performance Tuning with Optimal Exploration of Optimizer Cost Model Parameter Space#1186921
- Query Performance Tuning with Optimal Exploration of Optimizer Cost Model Parameter Space#1181721
- Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches#1035613
- Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches#965394
- Cost-Aware Optimization for Agentic Query Execution#1232760
Record · ID 1393789
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive