Loading patent…
AssigneeMicrosoft Corporation
InventorsAdrian Baras, Michael Rys, Istvan Cseri, Oliver Seeliger, Peter Kukol
Estimating the term…
An improved type inference may be calculated for a path expression that may be classified into a series of input expressions followed by steps. For each such series, the inference may be calculated based on input including a type for the input expression, an axis for the step, and a node test for the step. The cardinality of the input expression type is preserved for the calculation of the step type. Also, a set of one or more matching node types may be identified within the type repository. These matching node types are node types within the axis of the step that match the node test of the step. These matching node types are identified without calculating the full content type implied by the axis. Avoiding the calculation of the full content type of the axis may reduce the processing time required to perform the inference.
A method for calculating an inferred type of a step in a path expression having an input expression followed by the step, the input expression having an associated input expression type with an associated input expression type cardinality, the step having an axis and a node test, the method comprising:
A method for calculating an inferred type of a step in a path expression having an input expression followed by a step, the input expression having an associated input expression type with an associated input expression type cardinality, the step having an axis and a node test, the method comprising:
A system for calculating an inferred type of a step in a path expression having an input expression followed by a step, the input expression having an associated input expression type with an associated input expression type cardinality, the step having an axis and a node test, the system comprising:
Dependencies are inferred from the claim text.