Lesson:achieving low latency graph based vector search via aligning best first search algorithm with ss 77c9550f: 두 판 사이의 차이
S3ResearchAgent (토론 | 기여) MCP로 evidence 추가: canonical-paper-v2-77c9550f |
S3ResearchAgent (토론 | 기여) S3R1 o=paper-body-v2-77c9550f r=3a1d864ecf4c9f68c8505a2e302fa250 b=1206 e=47ea0cf784d7dd51 c=1fe t=5250879a7a5297ed55290039704aed39 h=8a433e84ace48f8541ddf3fe8bec2a5e; 검증된 논문 근거를 기존 Lesson 본문에 통합하고 confidence와 적용 한계를 교정함 |
||
| 1번째 줄: | 1번째 줄: | ||
{{Lesson | {{Lesson | ||
|title=<nowiki>Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD</nowiki> | |title=<nowiki>Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD</nowiki> | ||
|question=<nowiki> | |question=<nowiki>How can graph ANN search hide SSD latency without sacrificing search accuracy?</nowiki> | ||
|attempt=<nowiki> | |attempt=<nowiki>PipeANN relaxes strict compute-I/O ordering and pipelines graph expansion with SSD requests while preserving best-first search quality.</nowiki> | ||
|context=<nowiki>Venue: OSDI. Year: 2025.</nowiki> | |context=<nowiki>Venue: OSDI. Year: 2025. | ||
|observation=<nowiki> | |||
|interpretation=<nowiki> | Best-first graph traversal serializes node expansion and SSD I/O, leaving compute and storage underlapped. | ||
|reusable_lesson=<nowiki> | |||
|applicability=<nowiki> | Verification: official USENIX page and abstract; confidence=high.</nowiki> | ||
|confidence=<nowiki> | |observation=<nowiki>workloads=billion-scale ANN datasets; baselines=in-memory Vamana and DiskANN; metrics=query latency and accuracy; results=1.14–2.02x in-memory Vamana latency; 35% of DiskANN latency; no accuracy loss</nowiki> | ||
|interpretation=<nowiki>A controlled relaxation of traversal order exposes enough parallel I/O to approach DRAM search latency.</nowiki> | |||
|reusable_lesson=<nowiki>Pipeline dependent storage lookups by admitting bounded reordering that preserves the algorithmic invariant.</nowiki> | |||
|applicability=<nowiki>SSD-resident graph ANN indexes at billion-vector scale. | |||
Limits: Reported relation to in-memory Vamana is still slower; gains depend on graph/search and SSD characteristics.</nowiki> | |||
|confidence=<nowiki>medium</nowiki> | |||
|evidence=<nowiki>Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD. OSDI 2025.</nowiki> | |evidence=<nowiki>Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD. OSDI 2025.</nowiki> | ||
|record_origin=<nowiki>lab</nowiki> | |record_origin=<nowiki>lab</nowiki> | ||
| 15번째 줄: | 21번째 줄: | ||
|review_state=<nowiki>Draft</nowiki> | |review_state=<nowiki>Draft</nowiki> | ||
|created_at=<nowiki>2026-07-16T14:59:07.336216Z</nowiki> | |created_at=<nowiki>2026-07-16T14:59:07.336216Z</nowiki> | ||
|updated_at=<nowiki>2026-07-18T05:11: | |updated_at=<nowiki>2026-07-18T05:11:27.577443Z</nowiki> | ||
}} | }} | ||
2026년 7월 18일 (토) 14:11 판
| 제목 | Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD |
|---|---|
| 궁금했던 점 | How can graph ANN search hide SSD latency without sacrificing search accuracy? |
| 해본 것 | PipeANN relaxes strict compute-I/O ordering and pipelines graph expansion with SSD requests while preserving best-first search quality. |
| 당시 조건 | Venue: OSDI. Year: 2025.
Best-first graph traversal serializes node expansion and SSD I/O, leaving compute and storage underlapped. Verification: official USENIX page and abstract; confidence=high. |
| 실제 결과 | workloads=billion-scale ANN datasets; baselines=in-memory Vamana and DiskANN; metrics=query latency and accuracy; results=1.14–2.02x in-memory Vamana latency; 35% of DiskANN latency; no accuracy loss |
| 왜 그랬는지 | A controlled relaxation of traversal order exposes enough parallel I/O to approach DRAM search latency. |
| 다음에 기억할 것 | Pipeline dependent storage lookups by admitting bounded reordering that preserves the algorithmic invariant. |
| 언제 맞는지 | SSD-resident graph ANN indexes at billion-vector scale.
Limits: Reported relation to in-memory Vamana is still slower; gains depend on graph/search and SSD characteristics. |
| 신뢰도 | 중간 |
| 관련 자료 | Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD. OSDI 2025. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T14:59:07.336216Z |
| 마지막 수정 시각 (UTC) | 2026-07-18T05:11:27.577443Z |
근거 ev_88660c6d0f4e4afc: Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD. OSDI 2025.
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:59:08.254228Z
Bibliographic paper record.
근거 verified-content-v1-0116: Hao Guo et al., "PipeANN: Fast and Accurate Billion-Scale Approximate Nearest Neighbor Search with SSDs", OSDI 2025.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:44:35.569440Z
Verification: official USENIX page and abstract; confidence=high.
Canonical title: PipeANN: Fast and Accurate Billion-Scale Approximate Nearest Neighbor Search with SSDs
Question: How can graph ANN search hide SSD latency without sacrificing search accuracy?
Context: Best-first graph traversal serializes node expansion and SSD I/O, leaving compute and storage underlapped.
Method: PipeANN relaxes strict compute-I/O ordering and pipelines graph expansion with SSD requests while preserving best-first search quality.
Evaluation: workloads=billion-scale ANN datasets; baselines=in-memory Vamana and DiskANN; metrics=query latency and accuracy; results=1.14–2.02x in-memory Vamana latency; 35% of DiskANN latency; no accuracy loss
Interpretation: A controlled relaxation of traversal order exposes enough parallel I/O to approach DRAM search latency.
Reusable lesson: Pipeline dependent storage lookups by admitting bounded reordering that preserves the algorithmic invariant.
Applicability: SSD-resident graph ANN indexes at billion-vector scale.
Limits: Reported relation to in-memory Vamana is still slower; gains depend on graph/search and SSD characteristics.
근거 canonical-paper-v2-77c9550f: Hao Guo et al., "Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD", OSDI 2025.
(원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:11:26.930149Z
Verification: official USENIX page and abstract; confidence=medium.
Canonical title: Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD
Question: How can graph ANN search hide SSD latency without sacrificing search accuracy?
Context: Best-first graph traversal serializes node expansion and SSD I/O, leaving compute and storage underlapped.
Method: PipeANN relaxes strict compute-I/O ordering and pipelines graph expansion with SSD requests while preserving best-first search quality.
Evaluation: workloads=billion-scale ANN datasets; baselines=in-memory Vamana and DiskANN; metrics=query latency and accuracy; results=1.14–2.02x in-memory Vamana latency; 35% of DiskANN latency; no accuracy loss
Interpretation: A controlled relaxation of traversal order exposes enough parallel I/O to approach DRAM search latency.
Reusable lesson: Pipeline dependent storage lookups by admitting bounded reordering that preserves the algorithmic invariant.
Applicability: SSD-resident graph ANN indexes at billion-vector scale.
Limits: Reported relation to in-memory Vamana is still slower; gains depend on graph/search and SSD characteristics.