Apparatus and method for utilizing context to resolve ambiguous queries
First Claim
Patent Images
1. A non-transitory computer readable storage medium, comprising executable instructions causing at least one computing system to:
- derive, from a database schema, an irreducible ambiguous group comprising a sub-schema with a set of vertices wherein any two vertices are part of a loop and have at least two minimal paths relating them in the sub-schema, the sub-schema specifying a subset of a graph of the database schema and comprising a list of boundary tables and a list of object tables, the boundary tables connecting the sub-schema to other parts of the database schema, the object tables being used to define objects in a semantic layer;
receive user generated input designating joins in the sub-schema as excluded joins; and
define a context of the sub-schema by;
finding a tree that connects all boundary tables of the sub-schema plus all of the object tables of the sub-schema while excluding the excluded joins the tree specifying mandatory joins and neutral joins.
2 Assignments
0 Petitions
Accused Products
Abstract
A computer readable storage medium includes executable instructions to derive from a database schema an irreducible ambiguous group comprising a sub-schema with a set of vertices wherein any two vertices are part of a loop. Contexts are defined on the sub-schema. For each context, joins in the sub-schema are designated as mandatory joins, excluded joins and neutral joins. A selection of a context from multiple contexts invoked by a path characterizing a query is processed. The query is resolved using the context.
30 Citations
11 Claims
-
1. A non-transitory computer readable storage medium, comprising executable instructions causing at least one computing system to:
-
derive, from a database schema, an irreducible ambiguous group comprising a sub-schema with a set of vertices wherein any two vertices are part of a loop and have at least two minimal paths relating them in the sub-schema, the sub-schema specifying a subset of a graph of the database schema and comprising a list of boundary tables and a list of object tables, the boundary tables connecting the sub-schema to other parts of the database schema, the object tables being used to define objects in a semantic layer; receive user generated input designating joins in the sub-schema as excluded joins; and define a context of the sub-schema by;
finding a tree that connects all boundary tables of the sub-schema plus all of the object tables of the sub-schema while excluding the excluded joins the tree specifying mandatory joins and neutral joins. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method for implementation by at one or more data processors comprising:
-
deriving, by at least one data processor from a database schema, a sub-schema with a set of vertices wherein any two vertices are part of a loop and have at least two minimal paths relating them in the sub-schema, the sub-schema specifying a subset of a graph of the database schema and comprising a list of boundary tables and a list of object tables, the boundary tables connecting the sub-schema to other parts of the database schema, the object tables being used to define objects in a semantic layer; receiving, by at least one data processor, data designating joins in the sub-schema as excluded joins; and defining, by at least one data processor, a context for the sub-schema by finding a tree that connects all boundary tables of the sub-schema plus all of the object tables of the sub-schema while excluding the excluded joins, the tree specifying mandatory joins and neutral joins.
-
-
11. A system comprising:
-
at least one data processor; memory coupled to the at least one data processor, the memory storing instructions, which when executed, cause the at least one data processor to; derive, from a database schema, a sub-schema with a set of vertices wherein any two vertices are part of a loop and have at least two minimal paths relating them in the sub-schema, the sub-schema specifying a subset of a graph of the database schema and comprising a list of boundary tables and a list of object tables, the boundary tables connecting the sub-schema to other parts of the database schema, the object tables being used to define objects in a semantic layer; receive data designating joins in the sub-schema as excluded joins; and define a context for the sub-schema by finding a tree that connects all boundary tables of the sub-schema plus all of the object tables of the sub-schema while excluding the excluded joins, the tree specifying mandatory joins and neutral joins.
-
Specification