Re: N-Tuple Transactions?

> without it, the same programs may have different results when executed on different databases. It would be nice if we could make it so that TinkerPop-level transactions allowed for more control over the expectations of a traversal. There are many instances where mutation oriented traversals have

Re: N-Tuple Transactions?

Tough question, since I have not used Akka or the actor model, but here are some first thoughts. From what I am reading, the trick would be to implement the transaction log as a CRDT . Operation-based CRDTs -- which propagate individ

Re: N-Tuple Transactions?

Wow. I totally understood what you wrote. Question: What is the TransactionLog in a distributed environment? e.g. Akka-driven traversers spawned from the same query migrating around the cluster mutating stuff. Thanks for the lesson, Marko. http://rredux.com

Re: N-Tuple Transactions?

Hi Stephen, More the latter. TinkerPop transactions would be layered on top of the native transactions of the database (if any), which gives the VM more control over the operational semantics of a computation in between database commits. For example, in many scenarios it would be desirable not to

Re: N-Tuple Transactions?

Hi Josh, interesting... we have graphs with everything from no transactions like TinkerGraph to more acid transactional systems and everything in between - will transaction support as you describe it cover all the different transactional semantics of the underlying graphs which we might encounter?

Re: N-Tuple Transactions?

Hi Marko, Get ready for monads . I mentioned them in my post on algebraic property graphs. In functional programming, monads are a typical way of composing chains

N-Tuple Transactions?

Hello Josh (others), You mentioned a week or so ago that the n-tuple model should be able to capture both indices and transactions. At the time, I scoffed at the notion. However, as you know, I have been recently enlightened to how n-tuples can model indices and am using it extensively in the