sequential reading from HDD could be faster than random access to memory.
YOW! 2012: Marko Rodriguez - Graph Systems and Databases | Going Deep | Channel 9:
Gremlin graph traversal language
The claim about data access speed is interesting, may be worth checking.
Forum discussion. Article at ACM Queue
"Write-Only" data systems have advantage of sequential access to data.
One of such system, Datomic, keeps creating index blocks for fast access,
but original data are write-only.
In similar way, Google's Big Table keeps creating indexes for fast access to subsets of data...
No comments:
Post a Comment