Skip to content
← Vector workbenchVector sizing / Corpus memory planning

Your corpus.
Its memory footprint.

Model the space behind your embeddings. See how vector dimensions, storage precision and index overhead add up before planning infrastructure.

01 / Define the corpus

Five inputs.
One sizing scenario.

10,000–100,000,000 vectors. These are calculator bounds.

Use your embedding model's output dimension.

This input affects the HNSW overhead estimate only.

A storage assumption, not a claim of index or provider support.

The page recalculates on submission. No JavaScript or assistant is required.

02 / Read the footprint

Estimated RAM envelope

75.94GiBplanning estimate

10,000,000 vectors · 1536 dimensions · 4 bytes per element · HNSW

Raw vector storage
57.22 GiB
Index overhead
1.19 GiB
Planning buffer / 30%
17.52 GiB
Disk planning / × 1.587.62 GiB

Raw vectors plus modeled index overhead, multiplied by 1.5. This does not include a measured database deployment.

Explore this scenario in the workbench

Arithmetic over stated assumptions, not a benchmark. GiB uses 1,073,741,824 bytes. Actual database memory, disk allocation, metadata and workload requirements can differ.

03 / Compare overhead assumptions

Same corpus.
Different index models.

Capacity arithmetic only.
This table does not compare search quality or latency.

Same 10,000,000 vectors, 1536 dimensions and 4-byte precision for each row. HNSW uses M = 16. Figures in GiB.
Index modelRaw vectorsIndex overheadRAM + 30%Disk × 1.5Open index scenario
Flat57.220.0074.3985.83Use index ↗
HNSW57.221.1975.9487.62Use index ↗
IVFFlat57.220.0274.4185.86Use index ↗

Flat has no separate index-overhead term in this simplified model. HNSW and IVFFlat overhead use different heuristics; this is not a recommendation to choose the smallest estimate.

04 / Inspect the model

The limits belong
beside the result.

Storage arithmetic

Raw bytes = vector count × dimensions × bytes per element. Divide by 1024³ for GiB. The calculation counts vector elements, not documents, source content or their metadata.

Index overhead heuristics

HNSW overhead = vector count × M × 8 bytes. IVFFlat overhead = square root of vector count × dimensions × bytes per element. Flat adds no separate term. These simplified terms do not reproduce a particular database implementation.

RAM buffer and disk multiplier

RAM = (raw vectors + index overhead) × 1.3. Disk = (raw vectors + index overhead) × 1.5. The 30% RAM buffer and 1.5 disk multiplier are planning assumptions, not measured limits or service guarantees.

What this model does not establish

Sharding, recall, query throughput, index build memory, replicas, backups, metadata, concurrency and provider costs are outside the calculation. Validate your actual database and workload before purchasing or provisioning infrastructure.