Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › In-memory processing of unbounded recursive graph queries in relational databases

In-memory processing of unbounded recursive graph queries in relational databases

US Patent 12339849 · Granted Jun 24, 2025

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Shortest and cheapest paths in distributed asynchronous graph traversals2025
Shortest and cheapest paths in distributed asynchronous graph traversals2025
Shortest and cheapest paths in distributed asynchronous graph traversals2025
RFID tag for a tamper proof attachment to an object such as a licence plate2025
Method of distributed graph loading for minimal communication and good balance v2025
Compilation techniques for algorithmic graph processing in a relational database2025
Compilation techniques for algorithmic graph processing in a relational database2025
Efficient, in-memory, relational representation for heterogeneous graphs2025
Distributed multi-hop neighborhood extraction for graph machine-learning via pus2025
Distributed multi-hop neighborhood extraction for graph machine-learning via pus2025
Subqueries in distributed asynchronous graph queries2025
Out-of-core BFS for shortest path graph queries2025