Vlad Ioan Haprian
24Patents
2h-index
33Co-inventors
49Inventor score
Filing activity: Feb 1, 2018 → Mar 29, 2024
Most-cited inventions
| Patent | Title | Area | Cited by | Status |
|---|---|---|---|---|
| US12124448B2 | Using temporary tables to store graph algorithm results for a relational database management system | Physics | 4 | Active |
| US11500868B2 | Efficient identification of vertices and edges for graph indexes in an RDBMS | Physics | 2 | Active |
| US11093459B2 | Parallel and efficient technique for building and maintaining a main memory, CSR-based graph index in an RDBMS | Physics | 2 | Active |
| US11675785B2 | Dynamic asynchronous traversals for distributed graph queries | Physics | 1 | Active |
| US11537579B2 | Fast in-memory technique to build a reverse CSR graph index in an RDBMS | Physics | 1 | Active |
| US11392624B2 | Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems | Physics | 1 | Active |
| US11507579B2 | Efficient compilation of graph queries involving long graph query patterns on top of SQL based relational engine | Physics | 1 | Active |
| US11928097B2 | Deterministic semantic for graph property update queries and its efficient implementation | Physics | 0 | Active |
| US12242487B2 | Efficient compilation of bounded recursive graph queries on top of SQL based relational engine | Physics | 0 | Active |
| US12326866B1 | Out-of-core BFS for shortest path graph queries | Physics | 0 | Active |
| US10853137B2 | Efficient resource allocation for concurrent graph workloads | Physics | 0 | Active |
| US11074260B2 | Space-efficient methodology for representing label information in large graph data for fast distributed graph query | Electricity | 0 | Active |
| US10942970B2 | Reachability graph index for query processing | Physics | 0 | Active |
| US11593323B2 | Parallel and efficient technique for building and maintaining a main memory CSR based graph index in a RDBMS | Physics | 0 | Active |
| US10846127B2 | Fair and efficient concurrency management for graph processing | Physics | 0 | Active |
| US11250059B2 | Optimizing graph queries by performing early pruning | Physics | 0 | Active |
| US11392623B2 | Hybrid in-memory BFS-DFS approach for computing graph queries against heterogeneous graphs inside relational database systems | Physics | 0 | Active |
| US12361068B2 | Distributed multi-hop neighborhood extraction for graph machine-learning via push-lazy-push-traversal | Physics | 0 | Active |
| US12271402B2 | Method, product, and system to provide a parser for property graph queries with precise error reporting and auto-completion based on information from property graph schemas | Physics | 0 | Active |
| US11397732B2 | Hybrid in-memory BFS-DFS approach for computing graph queries involving complex path patterns including trees and cycles inside relational database systems | Physics | 0 | Active |
| US11989178B2 | Efficient compilation of graph queries including complex expressions on top of sql based relational engine | Physics | 0 | Active |
| US11921785B2 | Inline graph algorithm execution with a relational SQL engine | Physics | 0 | Active |
| US11567932B2 | Efficient compilation of graph queries on top of SQL based relational engine | Physics | 0 | Active |
| US12339849B1 | In-memory processing of unbounded recursive graph queries in relational databases | Physics | 0 | Active |
Source: USPTO / EPO open patent data. Inventor disambiguation is heuristic; counts are objective bibliographic measures.