Re:Communication Logs: Handling 250M SMS messages a day
by Cieplak on Thursday December 17, 2015 @01:24AM
(#10749936)
Thanks! I was just reading the neo4j source and noticed the bitmap indexes which apparently have several advantages to B-tree indexes for indexing graphs:
https://github.com/neo4j/neo4j/tree/3.0/community/lucene-ind...
ps:
http://stackoverflow.com/questions/9541541/b-tree-vs-bitmap-...
https://en.wikipedia.org/wiki/Bitmap_index
Thanks for showing me triplestores! Good to know that it's better to use a database engine optimized for triples for graphs vs rolling your own in SQL.
By the way, if you're interested in graph representations for efficient querying, check out TripleStores [1], and the Wiki list on subject-predicate-object databases [2].
[1] https://en.wikipedia.org/wiki/Triplestore [2] https://en.wikipedia.org/wiki/List_of_subject-predicate-obje...