File: README

package info (click to toggle)
libdatrie 0.2.12-3
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 2,132 kB
  • sloc: sh: 4,306; ansic: 3,908; makefile: 193
file content (33 lines) | stat: -rw-r--r-- 1,188 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
datrie - Double-Array Trie Library
==================================

This is an implementation of double-array structure for representing trie, 
as proposed by Junichi Aoe [1].

Trie is a kind of digital search tree, an efficient indexing method in which
search time is independent of database size. It only takes O(m) search time,
where m is the length of the search string. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.

See the details of the implementation at [2]:
  https://linux.thai.net/~thep/datrie/datrie.html

Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.

--
Theppitak Karoonboonyanan.
September 2006.

References
----------

[1] Aoe, J. "An Efficient Digital Search Algorithm by Using a Double-Array 
    Structure". IEEE Transactions on Software Engineering. Vol. 15, 9 
    (Sep 1989). pp. 1066-1077.

[2] Karoonboonyanan, T. "An Implementation of Double-Array Trie".
    https://linux.thai.net/~thep/datrie/datrie.html