53 results about "Root element" patented technology

Methods and systems are provided for managing the application of one or more XML data mappings or one or more XML schema files to a spreadsheet application workbook. One or more XML schema files for associating to the spreadsheet workbook are obtained. Each schema file is iterated to determine if one or more additional schema files are identified in each of the obtained schema files. Each obtained schema is parsed to determine data definitions, elements, attributes, structure, and simple data content required by each schema file for valid XML data. All obtained schema files are combined to create a unified schema definition. A single root element is selected to serve as a root element for the generalized instance structure. A generalized instance structure of the unified schema definition is built representing all available elements, attributes or simple data content of the unified schema definition that may be applied to the spreadsheet application workbook. A tree view of the generalized instance structure is displayed for providing a visual representation of the instance structure of the unified schema definition representing elements, attributes, structure, and simple data content of the XML defined by the unified schema definition that may be validly applied to the spreadsheet workbook according to the generalized instance structure. Writing pointers to the XML map object expresses a relationship between workbook locations and XML elements.

Methods and apparatus of managing a CMDB are provided. At least one composite CI is utilized in the CMDB. The at least one composite CI is represented as a graph of navigable relationships between one or more supporting elements in accordance with a template. The one or more supporting elements comprise at least a root element of the composite CI.

The present invention provide for an algebraic mapping of a policy expression from a compact to a normalized form, both in Boolean and set formulations. The policy algebra is defined in such a way that policy alternatives within the normalized expression will be the same across equivalent compact expressions—regardless of how the assertions are arbitrarily constrained or what operators are used to constrain such equivalent expressions. Moreover, the present invention also provides a model for identifying alternatives that are equivalent by comparing only the root element names or QName of each assertion within an alternative. In addition, embodiments as described herein can utilize the identification of equivalent alternatives in order to create an intersection policy expression to limit alternatives of admissible behavior to those in common across both endpoints.