Chunked Lists versus Extensible Arrays for Text Inversion
Information Retrieval
2023-08-31 v1
Abstract
In our 2017 work on in-memory list-based text inversion [Hawking and Billerbeck. Efficient In-Memory, List-Based Text Inversion. ADCS 2017] we compared memory use and indexing speed of a considerable number of variants of chunked linked lists. In the present work we compare the best performing of those variants (FBB - dynamic Fibonacci chunking) with the extensible SQ array technique (SQA) presented in [Moffat and Mackenzie. Immediate-Access Indexing Using Space-Efficient Extensible Arrays. ADCS 2023].
Cite
@article{arxiv.2308.15498,
title = {Chunked Lists versus Extensible Arrays for Text Inversion},
author = {David Hawking and Bodo Billerbeck},
journal= {arXiv preprint arXiv:2308.15498},
year = {2023}
}
Comments
2 pages, 2 figures, 1 table