Takuki Ogawa

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
— Trie is one of the data structures for keyword matching. The trie is used in natural language processing, IP address routing, and so on. It is represented by the matrix form, the link form, the double array, and LOUDS. The double array combines retrieval speed of the matrix form with compactness of the list form. LOUDS is a succinct data structure using(More)
  • 1