Chunked Lists versus Extensible Arrays for Text Inversion
David Hawking, Bodo Billerbeck
TL;DR
This paper compares the memory efficiency and indexing speed of the best chunked linked list variant with the extensible SQ array technique for text inversion tasks.
Contribution
It provides a comparative analysis of chunked linked lists and extensible arrays, highlighting their performance differences in text inversion applications.
Findings
FBB (dynamic Fibonacci chunking) outperforms SQA in memory use.
FBB achieves faster indexing speeds than SQA.
The study offers insights into the trade-offs between these data structures.
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].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Packet Processing and Optimization · Algorithms and Data Compression · Natural Language Processing Techniques
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings