I'd think that you could use a post-commit hook, detect the operation, and then modify the "left" and "right" records to maintain the doubly linked list. The downside would be that you're incurring multiple hits to disk, but you're already incurring multiple hits to disk with an RDBMS when you modify a table with indexes so it's not a big deal.
Erik - what do you mean by inexact range searches? Jeremiah Peschka Microsoft SQL Server MVP MCITP: Database Developer, DBA On Sun, Jan 23, 2011 at 1:41 PM, Les Mikesell <lesmikes...@gmail.com> wrote: > On 1/22/11 7:46 PM, Eric Moritz wrote: > >> >> Unlike the web, with Riak, we have complete control over what links to >> what. >> Unfortunately it adds complexity to applications that otherwise would be >> simple >> in an ACID DB. The benefit to this added complexity is AP. >> > > It is usually easy to build a forward-linking tree structure as you ga, but > how do you maintain it so as you remove some end/intermediate items you also > remove the references from the things linking there? > > -- > Les Mikesell > lesmikes...@gmail.com > > > _______________________________________________ > riak-users mailing list > riak-users@lists.basho.com > http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com >
_______________________________________________ riak-users mailing list riak-users@lists.basho.com http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com
