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.
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.
[1]: https://dgraph.io/docs/deploy/#exporting-database