Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Hybrid in-memory BFS-DFS approach for computing graph queries involving complex path patterns including trees and cycles inside relational database systems

Hybrid in-memory BFS-DFS approach for computing graph queries involving complex path patterns including trees and cycles inside relational database systems

US Patent 11397732 · Granted Jul 26, 2022

Estimated economic value: $116,121,000 ⓘ

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
Automatic, online and space efficient clustering and compression of very large d2025
Estimating graph size and memory consumption of distributed graph for efficient 2025
Method of distributed graph loading for minimal communication and good balance v2025
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
Distributed multi-hop neighborhood extraction for graph machine-learning via pus2025
Subqueries in distributed asynchronous graph queries2025
Subqueries in distributed asynchronous graph queries2025