Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Time To Live (TTL) on Predicates (Nodes & Relationships) #4516

Open
rahst12 opened this issue Jan 8, 2020 · 2 comments
Open

Time To Live (TTL) on Predicates (Nodes & Relationships) #4516

rahst12 opened this issue Jan 8, 2020 · 2 comments

Comments

@rahst12
Copy link

@rahst12 rahst12 commented Jan 8, 2020

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

@MichelDiz MichelDiz added this to To do - investigation needed in Tickets Review Jan 30, 2020
@MichelDiz
Copy link
Member

@MichelDiz MichelDiz commented Mar 8, 2020

@lgalatin
Copy link
Contributor

@lgalatin lgalatin commented Apr 20, 2020

Specific edge level is hard, but node and predicate level can be done.

@MichelDiz MichelDiz moved this from To do - investigation needed to Reviewed in Tickets Review Apr 20, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
Tickets Review
  
Reviewed
Linked pull requests

Successfully merging a pull request may close this issue.

None yet
3 participants
You can’t perform that action at this time.