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.

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.

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.

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 while 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.

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.

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.

Abstract: Methods, systems and computer-readable medium 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.

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.

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.

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.

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.

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.