The Irresistible Database for Java Combining Great RDBMS and NoSQL Features.
Supposed to appear by the end of November 2013 so it isn’t clear if SQL, NoSQL are about to be joined by Irresistable as a database category or not. 😉
The following caught my eye:
Very fast joins with graph-based relations
A single join has O(1) time complexity. A combination of multiple joins is internally processed as graph traversal with smart query optimization.
Without details, “very fast” has too wide a range of meanings to be very useful.
I don’t agree with the evaluation of Performance for RDBMS as “Limited.” People keep saying that as a truism when performance of any data store depends upon the architecture, data model, caching, etc.
I saw a performance test recently that depended upon (hopefully) a mis-understanding of one of the subjects of comparison. No surprise that it did really poorly in the comparison.
On the other hand, I am looking forward to the release of OhmDB as an early holiday surprise!
PS: I did subscribe to the newsletter on the theory that enough legitimate email might drown out the spam I get.