Smalyshev added a comment. Preliminary notes:
- Graph is a set of vertex collections and edge collections, both document collection with some special attributes. - ArangoDB keeps indexes only in memory and rebuilds them on collection load. Which takes about 1 hour for the dump of 3M objects and 4 indexes. - Only one fulltext index per collection - Non-indexed search is not very fast, so we do need indexes - Buleprints support is for 2.5 and seems to be deprecated, so not sure if TP3 support ever happens. They have "generic graph support" which is not following Tinkerpop but uses their internal idioms. I am having doubts their model would scale to our data sizes. Maybe sharding will help but we'd need quite a lot of shards then. TASK DETAIL https://phabricator.wikimedia.org/T88549 REPLY HANDLER ACTIONS Reply to comment or attach files, or !close, !claim, !unsubscribe or !assign <username>. EMAIL PREFERENCES https://phabricator.wikimedia.org/settings/panel/emailpreferences/ To: Smalyshev Cc: JanZerebecki, Aklapper, Manybubbles, jkroll, Smalyshev, Wikidata-bugs, aude, GWicke, daniel _______________________________________________ Wikidata-bugs mailing list [email protected] https://lists.wikimedia.org/mailman/listinfo/wikidata-bugs
