arXiv (All)
open access
Towards a B+-tree with Fluctuation-Free Performance
Performance predictability is critical for modern DBMSs. Index maintenance can trigger rare but severe I/O spikes. In a B/B+-tree of Height H, due to node split propagation, the cost of a single insert can vary from (H + 1) I/Os when node split does not happen to (3H + 1) I/Os when split propagation
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
- BIT: What is the intuition behind a binary indexed tree and how was it thought about?#796528
- Nova: Scalable Streaming Join Placement and Parallelization in Resource-Constrained Geo-Distributed Environments#1036648
- TreeRedux: Separating Concerns in Spark's Distributed Tree Aggregation#667999
- DataKernelBench: Can LLMs Optimize Database Queries on GPUs?#1356161
- Global tree forecasters collapse at the hierarchical aggregate: a five-panel failure characterization#1064456
Record · ID 1343520
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