Documentation Index
Fetch the complete documentation index at: https://lancedb-bcbb4faf-docs-namespace-typescript-examples.mintlify.app/llms.txt
Use this file to discover all available pages before exploring further.
View on Hugging Face
Source dataset card and downloadable files for
lance-format/ms-marco-v2.1-lance.hf://datasets/lance-format/ms-marco-v2.1-lance/data.
Key features
- Self-contained passage-ranking rows — each query carries up to 10 candidate passages in parallel
passage_text/passage_url/passage_is_selectedcolumns, alongside the human-writtenanswersandwell_formed_answers. - First relevant passage promoted to its own field in
selected_passage, so RAG / answer-evaluation workflows can read the gold context without indexing into the parallel passage lists. - Pre-computed 384-dim query embeddings (
query_emb,sentence-transformers/all-MiniLM-L6-v2, cosine-normalized) with a bundledIVF_PQindex for semantic query lookup. - One columnar dataset — scan query metadata cheaply, defer the heavy passage text reads to the rows that matter.
Splits
| Split | Rows |
|---|---|
train.lance | 808,731 |
validation.lance | 101,093 |
Schema
| Column | Type | Notes |
|---|---|---|
query_id | int64 | MS MARCO query id |
query | string | The user’s natural-language query |
query_type | string | One of DESCRIPTION, NUMERIC, ENTITY, LOCATION, PERSON |
answers | list<string> | Human-written reference answers |
well_formed_answers | list<string> | Reference answers re-written as full sentences |
passage_text | list<string> | Up to 10 candidate passages |
passage_url | list<string> | Source URLs for each candidate |
passage_is_selected | list<int8> | 1 if Bing labelled the passage relevant |
selected_passage | string? | First relevant passage (null if none) |
query_emb | fixed_size_list<float32, 384> | MiniLM query embedding |
Pre-built indices
IVF_PQonquery_emb— semantic query lookup (cosine)INVERTED(FTS) onqueryandselected_passage— keyword and hybrid searchBTREEonquery_id— stable lookup by identifierBITMAPonquery_type— cheap predicate evaluation for query class
Why Lance?
- Blazing Fast Random Access: Optimized for fetching scattered rows, making it ideal for random sampling, real-time ML serving, and interactive applications without performance degradation.
- Native Multimodal Support: Store text, embeddings, and other data types together in a single file. Large binary objects are loaded lazily, and vectors are optimized for fast similarity search.
- Native Index Support: Lance comes with fast, on-disk, scalable vector and FTS indexes that sit right alongside the dataset on the Hub, so you can share not only your data but also your embeddings and indexes without your users needing to recompute them.
- Efficient Data Evolution: Add new columns and backfill data without rewriting the entire dataset. This is perfect for evolving ML features, adding new embeddings, or introducing moderation tags over time.
- Versatile Querying: Supports combining vector similarity search, full-text search, and SQL-style filtering in a single query, accelerated by on-disk indexes.
- Data Versioning: Every mutation commits a new version; previous versions remain intact on disk. Tags pin a snapshot by name, so retrieval systems and training runs can reproduce against an exact slice of history.
Load with datasets.load_dataset
You can load Lance datasets via the standard HuggingFace datasets interface, suitable when your pipeline already speaks Dataset / IterableDataset or you want a quick streaming sample.
Load with LanceDB
LanceDB is the embedded retrieval library built on top of the Lance format (docs), and is the interface most users interact with. Each.lance file in data/ is a table — open by name (train, validation). The same handle is used by the Search, Curate, Evolve, Versioning, and Materialize-a-subset sections below.
Load with Lance
pylance is the Python binding for the Lance format and works directly with the format’s lower-level APIs. Reach for it when you want to inspect dataset internals — schema, scanner, fragments, the list of pre-built indices.
Tip — for production use, download locally first. Streaming from the Hub works for exploration, but heavy random access and ANN search are far faster against a local copy:Then point Lance or LanceDB at./ms-marco-v2.1-lance/data.
Search
The bundledIVF_PQ index on query_emb makes nearest-neighbour query lookup a single call. In production you would encode an incoming user query through the same 384-dim MiniLM encoder used at ingest and pass the resulting vector to tbl.search(...). The example below uses the embedding from row 42 as a runnable stand-in so the snippet works without loading a model.
query_emb is never read on the result side, and the full passage_text list is left untouched, keeping the working set small even when the underlying scan touches every row of the validation split.
Because the dataset also ships an INVERTED index on both query and selected_passage, the same query can be issued as a hybrid search that combines the dense vector with a keyword query against the gold passage. LanceDB merges the two result lists and reranks them in a single call, which is useful when a phrase must literally appear in the relevant passage but the dense side still does most of the ranking.
metric, nprobes, and refine_factor on the vector side to trade recall against latency for your workload.
Curate
A typical curation pass over MS MARCO starts by combining metadata filters with structural predicates over the parallel passage lists before any heavy text gets read. Lance evaluates the filter inside a single scan, so the candidate set comes back already filtered, and the bounded.limit(1000) keeps the output small enough to inspect. The example below assembles a set of numeric questions for which Bing labelled at least one passage relevant and the annotators produced a well-formed reference answer.
query_ids, or hand to the Evolve and Train sections below. Neither passage_text nor query_emb is read by this scan, so a 1000-row curation pass against the Hub moves only kilobytes of metadata.
Evolve
Lance stores each column independently, so a new column can be appended without rewriting the existing data. The lightest form is a SQL expression: derive the new column from columns that already exist, and Lance computes it once and persists it. The example below adds aquery_length column and a num_selected count over the parallel passage_is_selected list, either of which can then be used directly in where clauses without recomputing the predicate on every query.
Note: Mutations require a local copy of the dataset, since the Hub mount is read-only. See the Materialize-a-subset section at the end of this card for a streaming pattern that downloads only the rows and columns you need, or use hf download to pull the full corpus.
query_id:
Train
Projection lets a training loop read only the columns each step actually needs. LanceDB tables expose this throughPermutation.identity(tbl).select_columns([...]), which plugs straight into the standard torch.utils.data.DataLoader so prefetching, shuffling, and batching behave as in any PyTorch pipeline. For a reader-style QA model the natural projection is the query plus the gold passage and the answer; for a query-encoder retraining loop the precomputed embedding is enough on its own.
["query_emb", "passage_text", "passage_is_selected"] to select_columns(...) on the next run reads only those columns, which is the right shape for training a passage reranker on cached query embeddings. Columns added in Evolve cost nothing per batch until they are explicitly projected.
Versioning
Every mutation to a Lance dataset, whether it adds a column, merges labels, or builds an index, commits a new version. Previous versions remain intact on disk. You can list versions and inspect the history directly from the Hub copy; creating new tags requires a local copy since tags are writes.numeric-v1 keeps returning stable passages while the dataset evolves in parallel — newly added reranker scores or labels do not change what the tag resolves to. A training experiment pinned to the same tag can be rerun later against the exact same queries and passages, so changes in metrics reflect model changes rather than data drift. Neither workflow needs shadow copies or external manifest tracking.
Materialize a subset
Reads from the Hub are lazy, so exploratory queries only transfer the columns and row groups they touch. Mutating operations (Evolve, tag creation) need a writable backing store, and a training loop benefits from a local copy with fast random access. Both can be served by a subset of the dataset rather than the full corpus. The pattern is to stream a filtered query through.to_batches() into a new local table; only the projected columns and matching row groups cross the wire, and the bytes never fully materialize in Python memory.
./ms-marco-numeric is a first-class LanceDB database. Every snippet in the Search, Evolve, Train, and Versioning sections above works against it by swapping hf://datasets/lance-format/ms-marco-v2.1-lance/data for ./ms-marco-numeric.
Source & license
Converted frommicrosoft/ms_marco (v2.1). MS MARCO is released under the MIT license.