Feat/computer systems/index optimization#87
Open
wrh-human wants to merge 3 commits into
Open
Conversation
- Medal Score: peer-relative gold/silver/bronze podium (normalized to [0,1]), reported on v1 (47 tasks) and the v1-lite subset (10 tasks). READMEs now lead with Medal Score; average rank stays on the website leaderboard. - leaderboard/: ship the frozen podium baselines (medal_podium.csv), published leaderboard (medal_leaderboard.csv), raw score table (exp1_models_raw.csv), a submission scorer (score_submission.py), and an example submission. Un-ignore leaderboard/*.csv. - v1-lite: add frontier_eval/conf/batch/v1_lite.yaml (10-task subset across all five categories, distinct families, gradual-improvement tasks). Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
🤖 AI Code Review (gemini-3-flash-preview)🇬🇧 English Analysis1. Executive Summary
2. AI Content Analysis
3. Engineering & Economic Assessment
4. Quality Assurance
5. Security & Privacy Check
🇨🇳 中文分析1. 摘要
2. AI 成分分析
3. 工程与经济评估
4. Quality Assurance
5. 安全与隐私检查
|
…Optimization) CacheReplacement: CPU cache replacement policy optimization via ChampSim. - Agent modifies C++ replacement policy (EVOLVE-BLOCK) - Score: GMEAN(IPC_candidate / IPC_LRU), baseline = 1.0 - Quick: 3 traces (~15 min) | Full: 10 traces (~30-60 min) - 10 validation tests pass, verified on Apple Silicon
🤖 AI Code Review (gemini-3-flash-preview)🇬🇧 English Analysis1. Executive Summary
2. AI Content Analysis
3. Engineering & Economic Assessment
4. Quality Assurance
5. Security & Privacy Check
🇨🇳 中文分析1. 摘要
2. AI 成分分析
3. 工程与经济评估
4. 质量保证
5. 安全与隐私检查
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Add IndexOptimization — a new database index selection benchmark under
ComputerSystems/. This task evaluates an agent's ability to optimize PostgreSQL query performance through intelligent B-tree index configuration, a core database administration problem with direct operational and economic impact.Benchmark ID
ComputerSystems/IndexOptimizationEngineering Problem
Given a PostgreSQL 16 database with TPC-H SF1 schema and a mixed analytical SQL workload, find a high-quality B-tree index configuration that improves query execution time compared to a heuristic baseline, subject to:
Economic Relevance
Database index optimization is a core engineering task in production environments:
Workload
6 TPC-H SF1 queries (~1.3 GB data, 6 million lineitems):
Scoring
speedup= baseline_time / candidate_time (heuristic vs agent)storage_penalty= 0.3 × (storage_mb / 500)count_penalty= 0.1 × (n_indexes / 10)Task Design
scripts/init.py(EVOLVE-BLOCK wrapped, matching DuckDBWorkloadOptimization pattern)Repository Structure
Relation to LLMIA
This task is inspired by LLMIA (Zhao et al., arXiv:2503.07884, 2025), which demonstrated the effectiveness of LLM-based index recommendation. This benchmark is algorithm-agnostic and does not include LLMIA's source code, prompt templates, or demonstration pool.
Testing
valid=1.0,correct=1.0