IDiyas

For the Inventor, By the Inventor

Walldorf, Germany

Marcus Paradies

USPTO Granted Patents = 14

 

Average Co-Inventor Count = 4.2

ph-index = 4

Forward Citations = 54(Granted Patents)


Location History:

  • Walldorf, DE (2015 - 2020)
  • Erfurt, DE (2020 - 2023)

Company Filing History:

goldMedal13 out of 5,892 
 
Sap Se
 patents
silverMedal1 out of 3,607 
 
Sap Ag
 patents

Years Active: 2015-2023

Loading Chart...
Loading Chart...
14 patents (USPTO):
1. 11681716 - Extended path finding operations on graph data (2023-06-20),
2. 10839012 - Adaptable adjacency structure for querying graph data (2020-11-17),
3. 10831771 - Interactive exploration of large graphs (2020-11-10),
4. 10810259 - Graph data derivatives (2020-10-20),
5. 10776371 - Extended path finding operations on graph data (2020-09-15),
6. 10769188 - Text searches on graph data (2020-09-08),
7. 10546021 - Adjacency structures for executing graph algorithms in a relational database (2020-01-28),
8. 10503781 - Extending graph traversals with application logic (2019-12-10),
9. 10394855 - Graph-modeled data processing in a relational database (2019-08-27),
10. 9934324 - Index structure to accelerate graph traversal (2018-04-03),
11. 9697254 - Graph traversal operator inside a column store (2017-07-04),
12. 9547728 - Graph traversal operator and extensible framework inside a column store (2017-01-17),
13. 9031976 - Flexible tables (2015-05-12),
14. 8996492 - Graph traversal operator inside a column store (2015-03-31),

Title: Innovations of Marcus Paradies

Introduction

Marcus Paradies is a notable inventor based in Walldorf, Germany. He has made significant contributions to the field of graph data processing, holding a total of 14 patents. His work focuses on enhancing the efficiency of pathfinding operations and graph algorithms, which are crucial in various applications.

Latest Patents

One of his latest patents is titled "Extended path finding operations on graph data." This method provides a way to perform a pathfinding operation in graph data stored in a database. The process involves receiving a request from a client to perform a weighted path operation on a portion of the graph data. The method identifies the shortest path between two endpoints in the graph while minimizing attributes associated with vertices and edges.

Another significant patent is "Adaptable adjacency structure for querying graph data." This method responds to client requests to execute graph algorithms on stored graph data. It determines the necessary data to execute the algorithm and modifies the existing adjacency structure to include any absent data. The graph algorithm is then executed based on this modified structure, allowing for efficient querying of the graph data.

Career Highlights

Marcus has worked with prominent companies such as SAP SE and SAP AG. His experience in these organizations has allowed him to develop and refine his innovative ideas in graph data processing.

Collaborations

Throughout his career, Marcus has collaborated with talented individuals, including Michael Rudolf and Thomas Fischer. These partnerships have contributed to the advancement of his projects and patents.

Conclusion

Marcus Paradies is a distinguished inventor whose work in graph data processing has led to multiple patents and innovative solutions. His contributions continue to impact the field significantly.

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to support@idiyas.com
Loading…