Patents by Inventor Iraklis Psaroudakis
Iraklis Psaroudakis has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11829419Abstract: A system for loading graph data from an external store in response to a graph query is disclosed. In some embodiment, given a graph database where all vertices are stored in memory and some but not all edges are stored in the external store, the system performs one of two methods. In the first method, the system iteratively expands a set of vertices that is initially specified in the graph query and collects all edges connected to the set of vertices, including edges stored in the external store, that satisfy a vertex constraint also specified in the query. In the second method, the system finds a set of vertices that satisfy the vertex constraint and collects all edges connected to the set of vertices, including edges stored in an external store.Type: GrantFiled: May 14, 2022Date of Patent: November 28, 2023Assignee: Oracle International CorporationInventors: Iraklis Psaroudakis, Mhd Yamen Haddad, Martin Sevenich
-
Publication number: 20230367814Abstract: A system for loading graph data from an external store in response to a graph query is disclosed. In some embodiment, given a graph database where all vertices are stored in memory and some but not all edges are stored in the external store, the system performs one of two methods. In the first method, the system iteratively expands a set of vertices that is initially specified in the graph query and collects all edges connected to the set of vertices, including edges stored in the external store, that satisfy a vertex constraint also specified in the query. In the second method, the system finds a set of vertices that satisfy the vertex constraint and collects all edges connected to the set of vertices, including edges stored in an external store.Type: ApplicationFiled: May 14, 2022Publication date: November 16, 2023Inventors: IRAKLIS PSAROUDAKIS, MHD YAMEN HADDAD, MARTIN SEVENICH
-
Publication number: 20230350903Abstract: Techniques are described herein for address matching from a single address string to an address matching score. In an embodiment, an address string is received and parsed into parsed address data. Once an address string is parsed into parsed address data, the parsed address data is standardized by converting the parsed address data into a standard format and replacing abbreviations, colloquial names with formal names. Once an address string has been standardized into a standardized street locale, candidate addresses that are identical to or similar to the standardized street locale are identified and are assigned a score. Each score comprises a probability that the respective candidate address and the standardized street locale represent a same place or location.Type: ApplicationFiled: April 29, 2022Publication date: November 2, 2023Inventors: IRAKLIS PSAROUDAKIS, GIULIA CAROCARI, ANDREA ZIANI, MIROSLAV CEPEK
-
Publication number: 20230229570Abstract: Herein is machine learning for anomalous graph detection based on graph embedding, shuffling, comparison, and unsupervised training techniques that can characterize an unfamiliar graph. In an embodiment, a computer obtains many known vectors that respectively represent known graphs. A new vector is generated that represents a new graph that contains multiple vertices. The new vector may contain an arithmetic aggregation of vertex vectors that respectively represent multiple vertices and/or a vector that represents a virtual vertex that is connected to the multiple vertices by respective virtual edges. In the many known vectors, some similar vectors that are similar to the new vector are identified. The new graph is automatically characterized based on a subset of the known graphs that the similar vectors represent.Type: ApplicationFiled: January 18, 2022Publication date: July 20, 2023Inventors: Miroslav Cepek, Iraklis Psaroudakis, Rhicheek Patra, Timothy Trovatelli
-
Publication number: 20230214407Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: ApplicationFiled: February 24, 2023Publication date: July 6, 2023Inventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Patent number: 11593398Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: GrantFiled: October 9, 2020Date of Patent: February 28, 2023Assignee: Oracle International CorporationInventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Publication number: 20230004977Abstract: In an embodiment, a computer stores a bipartite graph that consists of a source subgraph and a target subgraph. Each vertex in the bipartite graph represents an entity. The source subgraph and the target subgraph are connected by many similarity edges. Each similarity edge indicates an original amount of similarity between the entity of a source vertex in the source subgraph and the entity of a target vertex in the target subgraph. For each similarity edge, the computer determines: a set of neighbor source vertices that are reachable from the source vertex of the similarity edge by traversing at most a source radius count of source edges in the source subgraph, a set of neighbor target vertices that are reachable from the target vertex of the similarity edge by traversing at most a target radius count of target edges in the target subgraph, and various amounts based on graph topology. For each similarity edge, the computer calculates a new amount of similarity based on those various amounts.Type: ApplicationFiled: June 30, 2021Publication date: January 5, 2023Inventors: Miroslav Cepek, Iraklis Psaroudakis, Nina Corvelo Benz
-
Patent number: 11461130Abstract: In an embodiment, a computer of a cluster of computers receives graph logic that specifies a sequence of invocations, including a current invocation and a next invocation, of parallelism operations that can detect whether the graph logic should prematurely terminate. The computer initiates, on the computers of the cluster, execution of the graph logic to process a distributed graph. Before the current invocation, the graph logic registers reversion logic for a modification of the distributed graph that execution of the graph logic has caused. During the current invocation, it is detected that the graph logic should prematurely terminate. Execution of the graph logic on the cluster is terminated without performing the next invocation in the sequence of invocations. The reversion logic reverses the modification of the distributed graph to restore consistency. The distributed graph is retained in volatile memory of the cluster for reuse such as relaunch of the graph logic.Type: GrantFiled: May 26, 2020Date of Patent: October 4, 2022Assignee: Oracle International CorporationInventors: Petr Koupy, Vasileios Trigonakis, Iraklis Psaroudakis, Jinsoo Lee, Sungpack Hong, Hassan Chafi
-
Patent number: 11275721Abstract: Techniques and solutions are provided for performing adaptive database table placement in a non-uniform memory access (NUMA) architecture. The adaptive table placement can occur in response to changing workloads on the NUMA nodes. For example, if a particular NUMA node is saturated, a database table may be moved from the memory of the saturated NUMA node to the memory of another NUMA node that is underutilized. In some cases, an entire database table is moved, while in other cases the database table is partitioned and only part of the table is moved.Type: GrantFiled: July 17, 2015Date of Patent: March 15, 2022Assignee: SAP SEInventors: Tobias Scheuer, Iraklis Psaroudakis, Abdelkader Sellami, Norman May, Anastasia Ailamaki
-
Publication number: 20210373938Abstract: In an embodiment, a computer of a cluster of computers receives graph logic that specifies a sequence of invocations, including a current invocation and a next invocation, of parallelism operations that can detect whether the graph logic should prematurely terminate. The computer initiates, on the computers of the cluster, execution of the graph logic to process a distributed graph. Before the current invocation, the graph logic registers reversion logic for a modification of the distributed graph that execution of the graph logic has caused. During the current invocation, it is detected that the graph logic should prematurely terminate. Execution of the graph logic on the cluster is terminated without performing the next invocation in the sequence of invocations. The reversion logic reverses the modification of the distributed graph to restore consistency. The distributed graph is retained in volatile memory of the cluster for reuse such as relaunch of the graph logic.Type: ApplicationFiled: May 26, 2020Publication date: December 2, 2021Inventors: Petr Koupy, Vasileios Trigonakis, Iraklis Psaroudakis, Jinsoo Lee, Sungpack Hong, Hassan Chafi
-
Publication number: 20210287069Abstract: Techniques are described herein for a Name Matching Engine that integrates two Machine Learning (ML) module options. The first ML module is a feature-engineered classifier that boosts text-based name matching techniques with a binary classifier ML model. The feature-engineered classifier comprises a first stage of text-based candidate finding, and a second stage in which a binary classifier model predicts whether each string, of the candidate match list, is a match or not. The binary classifier model is based on features from two or more of: a name feature level, a word feature level, a character feature level, and an initial feature level. The second ML module of the Name Matching Engine comprises an end-to-end Recurrent Neural Network (45RNN) model that directly accepts name strings as a sequence of n-grams and generates learned text embeddings. The text embeddings of matching name strings are close to each other in the feature space.Type: ApplicationFiled: August 10, 2020Publication date: September 16, 2021Inventors: Aras Mumcuyan, Iraklis Psaroudakis, Miroslav Cepek, Rhicheek Patra
-
Publication number: 20210042323Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: ApplicationFiled: October 9, 2020Publication date: February 11, 2021Inventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Patent number: 10853137Abstract: Techniques are described herein for allocating and rebalancing computing resources for executing graph workloads in manner that increases system throughput. According to one embodiment, a method includes receiving a request to execute a graph processing workload on a dataset, identifying a plurality of graph operators that constitute the graph processing workload, and determining whether execution of each graph operator is processor intensive or memory intensive. The method also includes assigning a task weight for each graph operator of the plurality of graph operators, and performing, based on the assigned task weights, a first allocation of computing resources to execute the plurality of graph operators. Further, the method includes causing, according to the first allocation, execution of the plurality of graph operators by the computing resources, and monitoring computing resource usage of graph operators executed by the computing resources according to the first allocation.Type: GrantFiled: March 12, 2019Date of Patent: December 1, 2020Assignee: Oracle International CorporationInventors: Vlad Ioan Haprian, Iraklis Psaroudakis, Alexander Weld, Oskar Van Rest, Sungpack Hong, Hassan Chafi
-
Patent number: 10803087Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: GrantFiled: October 19, 2018Date of Patent: October 13, 2020Assignee: Oracle International CorporationInventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Publication number: 20200293372Abstract: Techniques are described herein for allocating and rebalancing computing resources for executing graph workloads in manner that increases system throughput. According to one embodiment, a method includes receiving a request to execute a graph processing workload on a dataset, identifying a plurality of graph operators that constitute the graph processing workload, and determining whether execution of each graph operator is processor intensive or memory intensive. The method also includes assigning a task weight for each graph operator of the plurality of graph operators, and performing, based on the assigned task weights, a first allocation of computing resources to execute the plurality of graph operators. Further, the method includes causing, according to the first allocation, execution of the plurality of graph operators by the computing resources, and monitoring computing resource usage of graph operators executed by the computing resources according to the first allocation.Type: ApplicationFiled: March 12, 2019Publication date: September 17, 2020Inventors: Vlad Ioan Haprian, Iraklis Psaroudakis, Alexander Weld, Oskar Van Rest, Sungpack Hong, Hassan Chafi
-
Publication number: 20200125668Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: ApplicationFiled: October 19, 2018Publication date: April 23, 2020Inventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Patent number: 10545789Abstract: Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.Type: GrantFiled: April 25, 2018Date of Patent: January 28, 2020Assignee: SAP SEInventors: Anastasia Ailamaki, Tobias Scheuer, Iraklis Psaroudakis, Norman May
-
Publication number: 20180246755Abstract: Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.Type: ApplicationFiled: April 25, 2018Publication date: August 30, 2018Inventors: Anastasia Ailamaki, Tobias Scheuer, Iraklis Psaroudakis, Norman May
-
Patent number: 9983903Abstract: Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.Type: GrantFiled: April 1, 2016Date of Patent: May 29, 2018Assignee: SAP SEInventors: Anastasia Ailamaki, Tobias Scheuer, Iraklis Psaroudakis, Norman May
-
Publication number: 20170017674Abstract: Techniques and solutions are provided for performing adaptive database table placement in a non-uniform memory access (NUMA) architecture. The adaptive table placement can occur in response to changing workloads on the NUMA nodes. For example, if a particular NUMA node is saturated, a database table may be moved from the memory of the saturated NUMA node to the memory of another NUMA node that is underutilized. In some cases, an entire database table is moved, while in other cases the database table is partitioned and only part of the table is moved.Type: ApplicationFiled: July 17, 2015Publication date: January 19, 2017Inventors: Tobias Scheuer, Iraklis Psaroudakis, Abdelkader Sellami, Norman May, Anastasia Ailamaki