Abstract
A suffix trie is a full-text index that can efficiently answer queries in a text database. However, this index uses much more space than the text itself. In practice, a suffix trie requires from 10 to 20 times the size of T. In this work, we present an exhaustive experimental evaluation of a sequential representation of suffix trie (\({ST}_{\!s}\)) consisting of storing each component of a suffix trie in a separated array. We analyze count and locate time, construction time, and space usage for three versions of \({ST}_{\!s}\): the original one and two later improvements.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
