Method and system for acceleration of pathway detection and ranking within an information technology database

A computer-implemented method comprising:

• a. Identifying a type of start node and a type of end node of a relational database system, the relational database system comprising a query engine and a relational database having a plurality of node types and a plurality of link types;
• b. Determining a plurality of search pathways from each start node type to the end node type;
• c. Counting the link types between node types of each of the plurality of search pathways;
• d. Ranking the plurality of search pathways in order of fewest link types per search pathway to most link types per pathway and in consideration of a cardinality of at least one link type, and by ranking search pathways having at least one one-to-one link types between two pathway nodes of a comprising search pathway, whereby search pathways having at least one one-to-one link types are ranked for earlier examination than search pathways having equal link type counts and fewer one-to-one link types;
• and
• e. Providing accessibility to the ranking of each search pathway to the query engine.

A tangible, non-transitory computer-readable media comprising machine-readable instructions that direct a computational system to execute the method comprising:

• a. Generating an object-oriented schema from a relational database schema;
• b. Analyzing the object-oriented schema to determine a plurality of search pathways that link rows in one table with rows in the same or another table;
• c. Ranking each of the plurality of search pathways for expected computational efficiency in view of a cardinality of at least one link type between table rows;
• and
• d. Providing the search pathways to a query engine in accordance with the expected computational efficiency ranking.

A computer-implemented method comprising:

• a. Identifying a type of start node and a type of end node of a relational database system, the relational database system comprising a query engine and a relational database having a plurality of node types and a plurality of link types;
• b. Determining a plurality of search pathways from each start node type to the end node type;
• c. Counting the link types between node types of each of the plurality of search pathways;
• d. Ranking the plurality of search pathways in order of fewest link types per search pathway to most link types per pathway and in consideration of a cardinality of at least one link type, and by ranking search pathways having at least one many-to-one link types between pathway nodes, whereby search pathways having more many-to one link types are ranked for earlier examination than search pathways having equal link type counts and no many-to-one link types;
• and
• e. Providing accessibility to the ranking of each search pathway to the query engine.