Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets.

Sebastian Bruch|Franco Maria Nardini|Cosimo Rulli|Rossano Venturini|Leonardo Venuta


Anthology ID:DBLP:conf/ecir/BruchNRVV25
Volume:Advances in Information Retrieval - 47th European Conference on Information Retrieval, ECIR 2025, Lucca, Italy, April 6-10, 2025, Proceedings, Part III
Year:2025
Venue:European Conference on Advances in Information Retrieval (ECIR)
Publisher:Springer
Pages:437-445
URL:https://doi.org/10.1007/978-3-031-88714-7_43
DOI:https://doi.org/10.1007/978-3-031-88714-7_43
DBLP:conf/ecir/BruchNRVV25
BibTeX:
@inproceedings{bruch-2025-investigating, author = {Sebastian Bruch and Franco Maria Nardini and Cosimo Rulli and Rossano Venturini and Leonardo Venuta}, editor = {Claudia Hauff and Craig Macdonald and Dietmar Jannach and Gabriella Kazai and Franco Maria Nardini and Fabio Pinelli and Fabrizio Silvestri and Nicola Tonellotto}, title = {{Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets}}, booktitle = {{Advances in Information Retrieval - 47th European Conference on Information Retrieval, ECIR 2025, Lucca, Italy, April 6-10, 2025, Proceedings, Part III}}, series = {Lecture Notes in Computer Science}, volume = {15574}, pages = {437--445}, publisher = {Springer}, year = {2025}, url = {https://doi.org/10.1007/978-3-031-88714-7_43}, doi = {https://doi.org/10.1007/978-3-031-88714-7_43} }