1. Is there any option like to do a free text search across multiple predicates at once e.g: I want to search for node(N) which satisfy "X Y" e.g: "john china", where "john" is 'name' predicate and china is 'country' predicate; and both these are grand children at unknown depths of some parent(N).
1. Yeah, you can run full-text search across multiple predicates, and then if you have reverse indices set up, you can chase their "parents".
2. We're investigating it.
3. You can find all the outbound edges, yes. But, you can't find all the inbound edges, without scanning over the entire DB which we don't recommend for performance reasons. However, if you have reverse indices, you could find inbound edges.
4. You can use /export endpoint [1] and then use live/bulk loader to reimport. That's the equivalent of backup/restore in Open Source version.
2. Have the issue like these around regex given any attention yet: https://github.com/dgraph-io/dgraph/issues/5131
3. How to find all inbound outbound edges: The issue discussed here: https://discuss.dgraph.io/t/find-all-inbound-outbound-edges/...
4. How does one backup/restore in a non-enterprise edition? Edit: 5. When will it support multi-tenancy?