Thanks Daniel yes, I thought about that too, I like redis a lot, and the redis module addition to kamailio is excellent news. However in this context it's not trivial to write a function that looks for the best match in a redis tree structure as mt_match does...
Regards Javi On Sat, Nov 12, 2011 at 9:28 AM, Daniel-Constantin Mierla <mico...@gmail.com > wrote: > Hello, > > just mentioning ndb_redis module (in 3.2) - you may want to look at, it is > key based access memory system. Otherwise, I haven't used personally > berkeley db to comment on this particular subject. > > Cheers, > Daniel > > > > > On 11/11/11 7:50 PM, Javier Gallart wrote: > > Hi list > > we've been happily using the mtree module for months now. Lately the > size of the tree has grown a lot. The mtree table needs to be fully > repopulated and reloaded several times a day, and we are looking for a > fastest mechanism (for populating the table, I guess the reload time does > not depend much on the db backend...). Does anyone tried with Berkeley DB? > Is this combination mtree-berkeley actually feasible...? > > Thanks > > > Javi > > > _______________________________________________ > SIP Express Router (SER) and Kamailio (OpenSER) - sr-users mailing > listsr-us...@lists.sip-router.orghttp://lists.sip-router.org/cgi-bin/mailman/listinfo/sr-users > > > -- > Daniel-Constantin Mierla -- http://www.asipto.com > Kamailio Advanced Training, Dec 5-8, Berlin: > http://asipto.com/u/kathttp://linkedin.com/in/miconda -- > http://twitter.com/miconda > >
_______________________________________________ SIP Express Router (SER) and Kamailio (OpenSER) - sr-users mailing list sr-users@lists.sip-router.org http://lists.sip-router.org/cgi-bin/mailman/listinfo/sr-users
