Howdy, Stranger!
It looks like you're new here. If you want to get involved, click one of these buttons!
Quick Links
Categories
- 7.8K All Categories
- 11 Help with translations
- 4.2K General questions
- 106 Roadmap
- 358 Game & application design
- 315 Plugins
- 70 User experience
- 74 Marketplace
- 290 Code snippets
- 34 Building a team?
- 269 Suggestions & requests
- 352 Announce your apps made with Gideros.
- 90 Step by step tutorials
- 660 Bugs and issues
- 195 Introduce yourself
- 236 Announcements
- 105 Forum talk
- 403 Relax cafe
In this Discussion
Compressed ternary DAGs for dictionary search
atilim
Maintainer
Hi all,
I've implemented Ternary Search Trees (http://www.drdobbs.com/database/184410528) with the optimizations described here http://www.strchr.com/ternary_dags
There are a bunch of advantages compared to other dictionary search techniques:
1. It's fast: On my Samsung S II, the search speed is about 30000-50000 searches per second.
2. It's compact and GC friendly: The loaded dictionary file is only a single string. We don't create tables with many fields. And after compression, usually the dictionary file is smaller than the original file.
You can create your dictionaries by using the code buildtst.cpp. And the search algorithm is included in main.lua.
cheers,
I've implemented Ternary Search Trees (http://www.drdobbs.com/database/184410528) with the optimizations described here http://www.strchr.com/ternary_dags
There are a bunch of advantages compared to other dictionary search techniques:
1. It's fast: On my Samsung S II, the search speed is about 30000-50000 searches per second.
2. It's compact and GC friendly: The loaded dictionary file is only a single string. We don't create tables with many fields. And after compression, usually the dictionary file is smaller than the original file.
You can create your dictionaries by using the code buildtst.cpp. And the search algorithm is included in main.lua.
cheers,
+1 -1 (+3 / -0 )Share on Facebook
Comments
Likes: MoKaLux