Seismic is a highly efficient data structure for fast retrieval over learned sparse embeddings. Designed with scalability and performance in mind, Seismic makes querying sparse representations seamless.
⥠Installation
To install Seismic, simply run:
For performance optimizations, check out the detailed installation guide in docs/Installation.md.
đ Quick Start
Given a collection as a jsonl file (details here), you can quickly index it by running
= # Your data collection
=
and then exploit Seismic to quickly retrieve your set of queries
= 30
= f
=
=
=
=
=
đ„ Download the Datasets
The embeddings in jsonl format for several encoders and several datasets can be downloaded from this HuggingFace repository, together with the queries representations.
As an example, the Splade embeddings for MSMARCO can be downloaded and extracted by running the following commands.
or by using the Huggingface dataset download tool.
đ Data Format
Documents and queries should have the following format. Each line should be a JSON-formatted string with the following fields:
id: must represent the ID of the document as an integer.content: the original content of the document, as a string. This field is optional.vector: a dictionary where each key represents a token, and its corresponding value is the score, e.g.,{"dog": 2.45}.
This is the standard output format of several libraries to train sparse models, such as learned-sparse-retrieval.
The script convert_json_to_inner_format.py allows converting files formatted accordingly into the seismic inner format.
This will generate a data directory at the /path/to/output path, with documents.bin and queries.bin binary files inside.
If you download the NQ dataset from the HuggingFace repo, you need to specify --input-format nq as it uses a slightly different format.
Resources
Check out our docs folder for more detailed guide on use to use Seismic directly in Rust, replicate the results of our paper, or use Seismic with your custom collection.
đ Bibliography
- Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, Rossano Venturini. "Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations." In ACM SIGIR. 2024.
- Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli, and Rossano Venturini. "Pairing Clustered Inverted Indexes with Îș-NN Graphs for Fast Approximate Retrieval over Learned Sparse Representations." In ACM CIKM 2024.
- Sebastian Bruch, Franco Maria Nardini, Cosimo Rulli,Rossano Venturini, and Leonardo Venuta. Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets. To Appear In ECIR 2025.
Citation License
The source code in this repository is subject to the following citation license:
By downloading and using this software, you agree to cite the under-noted paper in any kind of material you produce where it was used to conduct a search or experimentation, whether be it a research paper, dissertation, article, poster, presentation, or documentation. By using this software, you have agreed to the citation license.
SIGIR 2024
CIKM 2024