Octavian Octavian Udrea from 4 Galloway Ln, Valhalla, NY 10595, age 45

Us Patents

Assembly And Deployment Of Multi-Platform Flow-Based Applications
view source
US Patent:

20110131557, Jun 2, 2011
Filed:

Nov 27, 2009
Appl. No.:

12/626745
Inventors:

Eric Bouillet - Hawthorne NY, US
Mark D. Feblowitz - Cambridge MA, US
Hanhua Feng - Hawthorne NY, US
Anand Ranganathan - Hawthorne NY, US
Anton V. Riabov - Hawthorne NY, US
Octavian Udrea - Hawthorne NY, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 9/45
US Classification:

717138
Abstract:

A method and computer program product for assembling and deploying multi-platform flow based applications. An information processing flow that produces a result is assembled, the information processing flow includes components connected by data links, a component includes software code that describes at least one of an input constraint or an output constraint of the component, and at least two of the components are deployable on different computing platforms. The information processing flow is partitioned into sub-flows, such that for each sub-flow every component in the sub-flow is deployable on the same computing platform. The sub-flows are deployed on their respective computing platforms.

Method And System To Store Rdf Data In A Relational Store
view source
US Patent:

20110225167, Sep 15, 2011
Filed:

Mar 15, 2010
Appl. No.:

12/724211
Inventors:

Bishwaranjan Bhattacharjee - Yorktown Heights NY, US
Kavitha Srinivas - Rye NY, US
Octavian Udrea - Ossining NY, US
Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:

G06F 17/30
G06F 12/00
US Classification:

707747, 711104, 707E17052, 711E12001
Abstract:

A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will be dedicated to a subject of the dataset, and at least one of the at least one other entity associated with the subject in the row is to be stored in a pair-wise manner in that row of the hashtable. In an exemplary embodiment, RDF data that uses triples (subject, predicate, object) is stored with the predicate/object stored in the pair-wise manner in its associated subject row.

Creating Benchmark Graph Data
view source
US Patent:

20120197884, Aug 2, 2012
Filed:

Jan 28, 2011
Appl. No.:

13/016271
Inventors:

SONGYUN DUAN - Pleasantville NY, US
KAVITHA SRINIVAS - Rye NY, US
OCTAVIAN UDREA - Ossining NY, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
US Classification:

707736, 707E17044
Abstract:

According to an aspect of the present principles, a method is provided for generating resource description framework benchmarks. The method includes deriving a resultant benchmark dataset with a user specified size and a user specified coherence from and with respect to an input dataset of a given size and a given coherence by determining which triples of subject-property-object to add to the input dataset or remove from the input dataset to derive the resultant benchmark dataset.

Sharing Of Flows In A Stream Processing System
view source
US Patent:

20120233590, Sep 13, 2012
Filed:

Mar 9, 2011
Appl. No.:

13/043891
Inventors:

Anand Ranganathan - Stamford CT, US
Anton V. Riabov - Ossining NY, US
Octavian Udrea - Ossining NY, US
Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:

G06F 9/44
US Classification:

717106
Abstract:

Techniques for generating code for a flow are provided. The techniques include receiving a flow for an application to be deployed, wherein the flow comprises one or more sub-flows, identifying sub-flows of the flow that match existing sub-flows that are already running in separate flows by querying a run-time flow information repository, generating code for the flow, wherein the code comprises newly generated code for each of the sub-flows that do not match existing sub-flows that are already running in separate flows, and wherein the code also comprises one or more connectors to matching sub-flows that are already running in separate flows in lieu of generating new code for the sub-flows that match existing sub-flows that are already running in separate flows, and deploying the generated code for the flow and updating the run-time flow information repository with information pertaining to the flow.

Optimizing Sparse Schema-Less Data In Relational Stores
view source
US Patent:

20130282765, Oct 24, 2013
Filed:

Apr 24, 2012
Appl. No.:

13/454559
Inventors:

Bishwaranjan BHATTACHARJEE - Yorktown Heights NY, US
Mihaela Ancuta BORNEA - White Plains NY, US
Patrick DANTRESSANGLE - Hampshire, GB
Julian DOLBY - Bronx NY, US
Kavitha SRINIVAS - Rye NY, US
Octavian UDREA - Ossining NY, US
Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:

G06F 7/00
G06F 17/30
US Classification:

707803, 707E17044, 707E17032
Abstract:

Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.

Automated Data Exploration
view source
US Patent:

20140040279, Feb 6, 2014
Filed:

Aug 2, 2012
Appl. No.:

13/565257
Inventors:

Alina Beygelzimer - Ossining NY, US
Nicholas Mastronarde - Los Angeles CA, US
Srinivasan Parthasarathy - Yorktown Heights NY, US
Anton V. Riabov - Yorktown Heights NY, US
Deepak Turaga - Yorktown Heights NY, US
Octavian Udrea - Yorktown Heights NY, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 17/30
US Classification:

707748, 707736, 707E17032
Abstract:

A method for automated data exploration including selecting a plurality of analytic flows from an analytic flow pattern, executing a task, wherein the task is tracked by the plurality of analytic flows, receiving feedback for each of the plurality of analytic flows, determining a performance score for each of the plurality of analytic flows, and adjusting the flow according to the performance score.

Cross-Platform Compiler For Data Transforms
view source
US Patent:

20140067750, Mar 6, 2014
Filed:

Mar 9, 2011
Appl. No.:

13/043952
Inventors:

Anand Ranganathan - Stamford CT, US
Anton V. Riabov - Ossining NY, US
Octavian Udrea - Ossining NY, US
Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:

G06F 17/30
US Classification:

707602
Abstract:

Techniques for automatically partitioning a multi-platform data transform flow graph to one or more target output platforms are provided. The techniques include performing type inference on a transform graph, wherein the transform graph comprises one or more data transforms, automatically partitioning the transform graph to one or more target output platforms based on one or more policies, performing an optimization of the partitioned transform graph, and generating code, from the partitioned transform graph, for each set of the one or more data transforms based on the one or more target output platforms.

Creating Stream Processing Flows From Sets Of Rules
view source
US Patent:

20140081896, Mar 20, 2014
Filed:

Mar 9, 2011
Appl. No.:

13/043844
Inventors:

Anand Ranganathan - Stamford CT, US
Anton V. Riabov - Ossining NY, US
Octavian Udrea - Ossining NY, US
Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY
International Classification:

G06N 5/02
US Classification:

706 48
Abstract:

Techniques for creating a distributed application flow from a set of rules are provided. The techniques include creating a control-flow graph for each rule, creating one or more dependency links between two or more rules, partitioning a resulting graph, wherein the resulting graph comprises one or more control-flow graphs and one or more dependency links, into one or more operators by determining an optimal set of one or more cuts through the resulting graph such that a cost function is minimized, and generating stream processing flow code from the partitioned graph.