Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upTime To Live (TTL) on Predicates (Nodes & Relationships) #4516
Projects
Comments
Adding one more ref about this https://discuss.dgraph.io/t/time-to-live-for-nodes-etc-in-dgraph/6092 |
Specific edge level is hard, but node and predicate level can be done. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Experience Report
I am currently ingesting a large continuous streaming data set. The most recent data is the most important data. The oldest - either by policy or by least importance needs to be aged-off. Today, we use Neo4J Community Edition. We perform a query to find nodes/relationships older than a specific date and then delete them.
Note: Feature requests are judged based on user experience and modeled on Go Experience Reports. These reports should focus on the problems: they should not focus on and need not propose solutions.
What you wanted to do
After x number of days, I want to age off data - without having to issue a query/mutation to find the data and remove it.
What you actually did
Today, we use Neo4J Community Edition. We perform a query to find nodes/relationships older than a specific date and then delete them.
Why that wasn't great, with examples
N/A - the issues are with Neo4J - this is just a clear improvement over the Neo4J product that, while evaluating Dgraph is an obvious plus (especially because Badger has it).
Any external references to support your case
https://discuss.dgraph.io/t/time-to-live-for-nodes-in-dgraph/2066
https://www.youtube.com/watch?v=VftmLgwk_cY