Performance

100X faster and 5.5X less memory required than a memory-resident relational implementation (512,000 items) 3 msec per reduced taxonomy at 800,000 items

Related links

September 1-5, 2008: FIND'08 2nd International Workshop on Dynamic Taxonomies and Faceted Search, Turin, Italy, in conjunction with DEXA 2008