Yeah it gets expensive fast. At human scale data sets though it's generally fine. Dunno how far sufficiently clever algorithms can take this though
-
-
-
I imagine the right way to approach such problems is to hold the largest subset of the graph possible in-memory on a single instance?
- Show replies
New conversation -
-
-
Consistency is probably not crucial, eventual consistency will be fine. Also I mean PageRank is a pretty efficient algorithm for indexing the whole web’s graph structure
-
I would have thought the exact opposite. Surely Roam’s proposition is that as one captures and refines information then the relationships will be exposed which then leads to “new” information. Is a sidebar or graph view that will eventually be correct a good tool for doing that?
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.