.svg)
.svg)
.svg)
.svg)
.svg)
Query more.
Wait less.
Tentris stores and queries RDF knowledge graphs at scale - fast, RAM-efficient, easy to use.
.svg)
.svg)
.svg)
.svg)
.svg)
.svg)
Be first to try TentrisDB
Oops! Something went wrong while submitting the form.
how it works
One universal index.
No tuning.
Instead of maintaining multiple indices, Tentris stores RDF graphs in a single compressed Hypertrie that eliminates structural redundancies found in graphs to minimize memory usage.
Adaptive
query Planning
Tentris uses exact cardinalities from the Hypertrie for adaptive query planning, reducing unnecessary work and improving performance on complex graph patterns.
Worst-Case
Optimal Joins
Tentris requires minimal RAM by evaluating queries using worst-case optimal joins. Query results are streamed and intermediate results are not materialized.
no vendor
lock-in
RDF1.1 and SPARQL1.1 compliant. Already on another RDF store? Get started right away.
Query more.
Wait less.
Free to start. Running in minutes.
Want Tentris for your company?
