Skip to content

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

@rahst12

Description

@rahst12

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

Metadata

Metadata

Assignees

No one assigned

    Labels

    exp/beginnerSomething most people could solve.kind/featureSomething completely new we should consider.status/acceptedWe accept to investigate/work on it.

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions