Search

Leon U Guzenda

from Henderson, NV
Age ~77
Get Report
Also known as:
Leon X Guzenda, Gloria Leon
Related to:
Susan Berg, 56Hali S Fortuna, 30Aleksa B Fortuna, 31Zakary Fortuna, 35
Connected to:
Bonnie Guzenski, 65Paul A Guzenski, 59Darius Guzevicius, 57Christopher A Guzewich, 57Joyce I Guzewicz, 78Kimberly A Guzewich, 56Rita L Guzewski, 72Alex Guzhavin, 50Juan P Guzhnay, 39Ekaterina B Guzhva, 59

Leon Guzenda Phones & Addresses

  • Henderson, NV
  • 1090 Waterwood Dr, Rio Vista, CA 94571 (707) 374-6121
  • 370 El Portal Way, San Jose, CA 95123 (408) 281-3284
  • Dedham, MA

Work

Company: Objectivity Jan 2016 Position: Chief technology marketing officer

Education

Degree: Bachelors, Bachelor of Science School / High School: Bangor University 1966 to 1969 Specialities: Engineering

Skills

Cloud Computing • Databases • Big Data • Software Development • Enterprise Software • Saas • Agile Methodologies • Software Engineering • Project Management • Business Intelligence • Integration • Enterprise Architecture • Soa • Start Ups • Java • Product Management • Distributed Systems • Strategic Partnerships • Nosql • Xml • Program Management • Strategy • Management • C • Object Oriented Design • C++ • Linux • Unix • Consulting • Software Project Management • Scrum

Industries

Computer Software

Resumes

Resumes

Leon Guzenda Photo 1

Chief Technology Marketing Officer

View page
Location:
1090 Waterwood Dr, Rio Vista, CA 94571
Industry:
Computer Software
Work:
Objectivity
Chief Technology Marketing Officer
Objectivity Jul 1988 - Apr 2009
Chief Technology Officer
Objectivity Jul 1988 - Apr 2009
Consulting
Atp 1983 - 1988
Director, Database Products
Icl 1972 - 1983
Principal Project Director
Education:
Bangor University 1966 - 1969
Bachelors, Bachelor of Science, Engineering University of Wales 1966 - 1969
Bachelors, Bachelor of Science, Engineering Carisbrooke Grammar School 1958 - 1964
Skills:
Cloud Computing
Databases
Big Data
Software Development
Enterprise Software
Saas
Agile Methodologies
Software Engineering
Project Management
Business Intelligence
Integration
Enterprise Architecture
Soa
Start Ups
Java
Product Management
Distributed Systems
Strategic Partnerships
Nosql
Xml
Program Management
Strategy
Management
C
Object Oriented Design
C++
Linux
Unix
Consulting
Software Project Management
Scrum

Business Records

Name / Title
Company / Classification
Phones & Addresses
Leon Guzenda
CTO
OBJECTIVITY INC
Custom Computer Programing · Computer Sales · Custom Computer Programming Services
3099 N 1 St SUITE 200, San Jose, CA 95134
640 W California Ave, Sunnyvale, CA 94086
(408) 992-7100, (408) 944-9030, (408) 992-7167, (408) 829-6973
Leon Guzenda
Principal
Silver Buzz Cafi
Business Services at Non-Commercial Site · Nonclassifiable Establishments
1090 Waterwood Dr, Rio Vista, CA 94571

Publications

Us Patents

Method And System For Acceleration Of Pathway Detection And Ranking Within An Information Technology Database

View page
US Patent:
20110246450, Oct 6, 2011
Filed:
Apr 2, 2010
Appl. No.:
12/753835
Inventors:
LEON GUZENDA - Rio Vista CA, US
International Classification:
G06F 17/30
US Classification:
707716, 707E17017, 707E17005, 707803
Abstract:
Methods, systems and computer-readable medium are provided for replicating the data fields used by relational join operations in transient or persistent data structures with explicit support for named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables, including relationships defined between other tables. The schema of a target relational database, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schema is analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute the specific types of query listed above and incrementally populates instances of the transient or persistent structures.

For Acceleration Of Pathway Selection, Application, And Ranking In A Hybrid Network

View page
US Patent:
20110246671, Oct 6, 2011
Filed:
May 3, 2010
Appl. No.:
12/772277
Inventors:
LEON GUZENDA - Rio Vista CA, US
Assignee:
Objectivity, Inc. - Sunnyvale CA
International Classification:
G06F 15/16
US Classification:
709240
Abstract:
Methods, systems and computer-readable medium are provided for selecting and ordering pathways identified between two selected nodes of a hybrid network. Nodes within the network have named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables of one or more relational databases, including relationships defined between other tables. The schemas of one or more target relational databases, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schemas are analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute queries

Configurable Software Database Parallel Query System And Method

View page
US Patent:
20080065591, Mar 13, 2008
Filed:
Sep 8, 2006
Appl. No.:
11/517945
Inventors:
Leon Guzenda - Rio Vista CA, US
International Classification:
G06F 17/30
US Classification:
707 2
Abstract:
A system and method for generating and performing parallel queries of a software database are provided, wherein the software database is distributed within a plurality of localized databases. The system may include several components, to include a user query interface. The user generates and transmits a query to a parallel query engine by means of the user query interface. The parallel query engine tasks a plurality of search agents with the query in accordance with a configurable task splitter. The task splitter is configurable by a system administrator whereby the parallel query process may be designed to conform to locally imposed or desired criteria. Each search agent than searches through an assigned or associated localized database for data elements, such as software objects, that meet both the query and the task splitter criteria. One or more search agents may optionally function in accordance with a database specific filter, wherein data elements matching the query and the task splitter criteria must additionally meet the filter criteria before communication from the search agent to the user query interface.

System And Method To Identify Islands Of Nodes Within A Graph Database

View page
US Patent:
20210141835, May 13, 2021
Filed:
Sep 29, 2020
Appl. No.:
17/036399
Inventors:
LEON GUZENDA - Rio Vista CA, US
International Classification:
G06F 16/901
G06F 16/9035
G06F 9/46
Abstract:
The invented method includes one or more of the following aspects of selecting a multiplicity of nodes, deriving a designator for each node of the multiplicity of nodes and associating each designator in a one-to-one correspondence with a respective node from which a respective designator is derived, each designator indicating a plurality of dimensional values, and each dimensional value expressing a quality of a variate property of an associated node, selecting a unique designator having a particular pattern of dimensional values, selecting a first node having a first node designator matching the particular pattern of dimensional values, and when no node is found to have the particular pattern of dimensional values expressed in the respective designator to be connected by an edge to an external node, reporting a positive finding of an island.

Minimizing Resource Contention While Loading Graph Structures Into A Distributed Database

View page
US Patent:
20170139986, May 18, 2017
Filed:
Nov 17, 2015
Appl. No.:
14/944176
Inventors:
LEON GUZENDA - RIO VISTA CA, US
International Classification:
G06F 17/30
Abstract:
Presented is a method by which large amounts of data may be sorted and downloaded. In the presented invention, two keys are selected which may be associated with all records in a designated distributed, relational, object-oriented, graph or other database, and the records are sorted first by means of the first and second keys to generate a first file, and subsequently by means of the second and first keys to generate a second file. It is determined which of the resultant files contains a larger number of groups, and the file containing the larger number of groups is selected for loading, preferably by means of a plurality of data load streams. Further presented is means by which the data load streams may be executed in parallel with one another whilst minimizing contention for shared resources. The method additionally helps to increase the amount of parallelism that may be deployed in support of database search operations.

Method And System For Performing Searches Of Graphs As Represented Within An Information Technology System

View page
US Patent:
20140250140, Sep 4, 2014
Filed:
Mar 2, 2013
Appl. No.:
13/783233
Inventors:
LEON GUZENDA - Rio Vista CA, US
International Classification:
G06F 17/30
US Classification:
707758
Abstract:
A system and method for performing searches within a social graph database or with social graph data structures of an information technology system. In one aspect, a first graph is accessed that includes a plurality of nodes and edges between pairs of the plurality of nodes. A plurality of zones within the graph are defined or discovered and a search for a pathway from a first node of a first to an Nth node of an Nth zone is initiated, and a determination is made whether a zone pathway exists between the first zone to the Nth zone. In addition, the present invention provides for determining the existence of edges between zones; forming a zone graph prior to initiating the search for a pathway; forming a superzone graph prior to initiating the search for a pathway, wherein each group of connected zones is presented as an individual node.

Method And System For Enabling Electronic Communication Through Connectivity Of Separate Social Graphs

View page
US Patent:
20140250144, Sep 4, 2014
Filed:
Mar 14, 2013
Appl. No.:
13/831235
Inventors:
LEON GUZENDA - RIO VISTA CA, US
International Classification:
G06F 17/30
US Classification:
707769
Abstract:
A server receives a query message from a requester that identifies a source node of a first graph and includes a target information. The server then preferably searches a plurality of graphs to locate one or more nodes that include or are associated with the target information. When one or more target nodes are found by the server, the server informs the requester and requests authorization to attempt to form a pathway between the source node and one or more target nodes. The server may offer additional information harvested from a target node to the requester in order to encourage the requesting party to authorize pathway formation to the instant target node. The server directs an electronic message that may comprise an invitation to link through a graph, a network address of the source node, and/or an identifier of the requesting party.
Control profile
Leon U Guzenda from Henderson, NV, age ~77 Get Report