Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPoyias, Andreas-
dc.contributor.authorRaman, Rajeev-
dc.identifier.citationLecture Notes in Computer Science, 2015, 9309, pp. 324-336 (13)en
dc.description.abstractWe 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.en
dc.relation.ispartofseriesTheoretical Computer Science and General Issues-
dc.rightsCopyright © 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
dc.titleImproved Practical Compact Dynamic Triesen
dc.typeConference Paperen
dc.description.presented22nd International Symposium on String Processing and Information Retrievalen
pubs.organisational-group/Organisation/COLLEGE OF SCIENCE AND ENGINEERINGen
pubs.organisational-group/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Scienceen
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.