Microsoft Technology Licensing, LLC

Gideon Schaller

Istvan Cseri

Shankar Pal

Oliver Nicholas Seeliger

Michael Rys

Sameet Harishanker Agarwal

Jose A Blakeley

F Soner Terek

Dragan Tomic

Elizabeth Jean O'Neil

Patrick Eugene O'Neil

Nigel Clifton Westbury

Goetz Graefe

Joseph Xavier

Wei Yu

Frank Mantek

Denis Churin

Michael Mee

Sameer Arun Verkhedkar

Denis Y Altudov

Peter Kukol

Adrian Sorin Baras

The present invention provides 'XML Schema Collections' and methods and systems for using the same. XML data is typically stored as an XML instance, each of which should conform to a 'schema' according to a desired goal. An XML schema provides identification and organization for the data supplied by an XML instance. XML Schema Collections are collections of one or more XML schema namespaces. An storage location designated for storage of XML data, such as an XML column in a relational database, can be &#x201c;typed&#x201d; with an XML Schema Collection object, allowing that storage location to store XML instances that conform to more than one XML schema. XML Schema Collections provide increased data storage versatility, and facilitation of data searches.

XML schema collection objects and corresponding systems and methods

The present invention provides 'XML Schema Collections' and methods and systems for using the same. XML data is typically stored as an XML instance, each of which should conform to a 'schema' according to a desired goal. An XML schema provides identification and organization for the data supplied by an XML instance. XML Schema Collections are collections of one or more XML schema namespaces. A storage location designated for storage of XML data, such as an XML column in a relational database, can be &#x201c;typed&#x201d; with an XML Schema Collection object, allowing that storage location to store XML instances that conform to more than one XML schema. XML Schema Collections provide increased data storage versatility, and facilitation of data searches.

Modifying a portion of an XML document stored in a relational database includes converting operations on the document into an operator tree. The operator tree includes a first operator corresponding to a first portion of the schema for the modified data and a second operator corresponding to a parent portion of the schema for the modified data. A first and a second portion of the schema are extracted from the overall document schema. A first validation of the modified data using the first operator with the first portion of the schema is performed. This forms a partially validated XML document portion. Next, a second validation of the partially validated XML document portion with the second portion of the schema is performed using the second operator. The XML document constraints are verified and the modified data is merged into the XML document, thus avoiding a full validation of the XML document when certain XML Schema types are absent in the modified data.

Partial XML validation

Storing and querying XML data in a primary table or document utilizes an index of XML data and includes creating a primary table structure, creating a primary XML index commensurate with the primary table structure, populating the primary table and the primary XML index, and running a query on the XML data in a primary table by utilizing the XML index. The XML index can be implemented as a node table. The node table may have a B-tree structure and be populated by shredding the XML values in the primary table. The XML data may be stored as binary large objects in an XML column of the primary table. Secondary XML indexes may be created to assist in the search and retrieval of XML data stored in the primary table. Both the primary XML index and the secondary XML index tables may be created using data definition language statements.

Indexing XML datatype content system and method

A technique for representing the structure of hierarchically-organized data in a non-hierarchical data structure, such as a relation. The hierarchically-organized data is represented as a tree, and each node in the tree is assigned a position identifier that represents both the depth level of the node within the hierarchy, and its ancestor/descendant relationship to other nodes. The data represented by each node, as well as its position identifier, is stored in a row of a relational database, thereby capturing the hierarchical structure of the data in such relational database. A technique is provided for the compressed storage of position identifiers in a format that allows an efficient bytewise comparison of position identifiers to determine relative order and ancestry.

System and method for relational representation of hierarchical data

A computerized system and method for transforming the results of a query into a hierarchical information stream, such as an eXtensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the 'auto1' mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the 'auto2' mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the &#x201c;explicit&#x201d; mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.

Transforming query results into hierarchical information

An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.

System and method for compiling an extensible markup language based query

A computerized system and method for transforming the results of a query into a hierarchical information stream, such as an extensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the &ldquo;auto1&rdquo; mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the &ldquo;auto2&rdquo; mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the &ldquo;explicit&rdquo; mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.

Growing community of inventors

Bellevue, WA, United States of America

Gideon Schaller