Boulgakov Andrei wrote: > > By the way: What is the list's recommendation for a database for a > > dictionary? (i.e. zillion records; English words are the keys; 99% of > > the activity is search and read and almost no update activity; When > > matching texts against the DB, the length is not known, and > > the longest > > key (that is matching) is taken; The time to find a match is > > critical). > > Berkeley DB?
Actually, the records are stored currently in Berkeley DB... :-) In the start-up of the application, they are loaded, and a special Patricia Trie is built. My question was confusing, so I want to add the following: I'm talking about in-memory database (I can hold the entire tree in memory). Or you may use the word "data structure" or "algorithm" instead of "database". Thanks, -- Eli Marmor [EMAIL PROTECTED] CTO, Founder Netmask (El-Mar) Internet Technologies Ltd. __________________________________________________________ Tel.: +972-9-766-1020 8 Yad-Harutzim St. Fax.: +972-9-766-1314 P.O.B. 7004 Mobile: +972-50-23-7338 Kfar-Saba 44641, Israel ================================================================= To unsubscribe, send mail to [EMAIL PROTECTED] with the word "unsubscribe" in the message body, e.g., run the command echo unsubscribe | mail [EMAIL PROTECTED]
