Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/33033
Title: Improved Practical Compact Dynamic Tries
Authors: Poyias, Andreas
Raman, Rajeev
First Published: 5-Sep-2015
Presented at: 22nd International Symposium on String Processing and Information Retrieval
Publisher: Springer
Citation: Lecture Notes in Computer Science, 2015, 9309, pp. 324-336 (13)
Abstract: We consider the problem of implementing a dynamic trie with an emphasis on good practical performance. For a trie with n nodes with an alphabet of size σ, the information-theoretic lower bound is nlogσ+O(n) bits. The Bonsai data structure [1] supports trie operations in O(1) expected time (based on assumptions about the behaviour of hash functions). While its practical speed performance is excellent, its space usage of (1+ϵ)n(logσ+O(loglogn)) bits, where ϵ is any constant >0, is not asymptotically optimal. We propose an alternative, m-Bonsai, that uses (1+ϵ)n(logσ+O(1)) bits in expectation, and supports operations in O(1) expected time (again based on assumptions about the behaviour of hash functions). We give a heuristic implementation of m-Bonsai which uses considerably less memory and is slightly faster than the original Bonsai.
Series/Report no.: Theoretical Computer Science and General Issues
DOI Link: 10.1007/978-3-319-23826-5_31
ISSN: 0302-9743
ISBN: 978-3-319-23825-8
Links: http://link.springer.com/chapter/10.1007%2F978-3-319-23826-5_31
http://hdl.handle.net/2381/33033
Version: Post-print
Status: Peer-reviewed
Type: Conference Paper
Rights: Copyright © 2015, Springer International Publishing Switzerland. Deposited with reference to the publisher’s archiving policy available on the SHERPA/RoMEO website. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23826-5_31
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
spire_paper_102_final.pdfPost-review (final submitted)311.52 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.