Patents by Inventor Gideon Schaller
Gideon Schaller has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8352512Abstract: 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 “typed” 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.Type: GrantFiled: September 8, 2010Date of Patent: January 8, 2013Assignee: Microsoft CorporationInventors: Dragan Tomic, Joseph Xavier, Shankar Pal, Istvan Cseri, Gideon Schaller, Michael Rys, Oliver Nicholas Seeliger
-
Patent number: 7882146Abstract: 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 “typed” 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.Type: GrantFiled: December 1, 2003Date of Patent: February 1, 2011Assignee: Microsoft CorporationInventors: Dragan Tomic, Joseph Xavier, Shankar Pal, Istvan Cseri, Gideon Schaller, Michael Rys, Oliver Nicholas Seeliger
-
Publication number: 20100332557Abstract: 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 “typed” 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.Type: ApplicationFiled: September 8, 2010Publication date: December 30, 2010Applicant: Microsoft CorporationInventors: Dragan Tomic, Joseph Xavier, Shankan Pal, Istvan Cseri, Gideon Schaller, Michael Rys, Oliver Nicholas Seeliger
-
Patent number: 7774321Abstract: 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.Type: GrantFiled: November 7, 2005Date of Patent: August 10, 2010Assignee: Microsoft CorporationInventors: Dragan Tomic, Shankar Pal, Gideon Schaller, Istvan Cseri, Wei Yu
-
Patent number: 7634498Abstract: 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.Type: GrantFiled: October 24, 2003Date of Patent: December 15, 2009Assignee: Microsoft CorporationInventors: Shankar Pal, Istvan Cseri, Gideon Schaller, Oliver N. Seeliger, Denis Y. Altudov, Denis V. Churin, Sameer A. Verkhedkar
-
Patent number: 7493352Abstract: 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.Type: GrantFiled: August 24, 2004Date of Patent: February 17, 2009Assignee: Microsoft CorporationInventors: Patrick Eugene O'Neil, Elizabeth Jean O'Neil, Shankar Pal, Gideon Schaller, Istvan Cseri, Jose A. Blakeley, Nigel Clifton Westbury, Sameet Agarwal, F. Soner Terek
-
Patent number: 7444321Abstract: 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 “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.Type: GrantFiled: January 27, 2004Date of Patent: October 28, 2008Assignee: Microsoft CorporationInventors: Istvan Cseri, Goetz Graefe, Frank Mantek, Michael Mee, Michael Rys, Gideon Schaller, Oliver Seeliger
-
Patent number: 7421445Abstract: 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.Type: GrantFiled: August 24, 2004Date of Patent: September 2, 2008Assignee: Microsoft CorporationInventors: Patrick Eugene O'Neil, Elizabeth Jean O'Neil, Shankar Pal, Gideon Schaller, Istvan Cseri, Jose A. Blakeley, Nigel Clifton Westbury, Sameet Agarwal, F. Soner Terek
-
Patent number: 7386541Abstract: 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.Type: GrantFiled: March 18, 2004Date of Patent: June 10, 2008Assignee: Microsoft CorporationInventors: Shankar Pal, Istvan Cseri, Oliver Seeliger, Gideon Schaller, Adrian Baras, Wei Yu, Denis Churin, Peter Kukol
-
Publication number: 20070112851Abstract: 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.Type: ApplicationFiled: November 7, 2005Publication date: May 17, 2007Applicant: Microsoft CorporationInventors: Dragan Tomic, Shankar Pal, Gideon Schaller, Istvan Cseri, Wei Yu
-
Publication number: 20050210002Abstract: 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.Type: ApplicationFiled: March 18, 2004Publication date: September 22, 2005Inventors: Shankar Pal, Istvan Cseri, Oliver Seeliger, Gideon Schaller, Adrian Baras, Wei Yu, Denis Churin, Peter Kukol
-
Publication number: 20050120029Abstract: 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 “typed” 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.Type: ApplicationFiled: December 1, 2003Publication date: June 2, 2005Inventors: Dragan Tomic, Joseph Xavier, Shankar Pal, Istvan Cseri, Gideon Schaller, Michael Rys, Oliver Seeliger
-
Patent number: 6889226Abstract: 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.Type: GrantFiled: November 30, 2001Date of Patent: May 3, 2005Assignee: Microsoft CorporationInventors: Patrick Eugene O'Neil, Elizabeth Jean O'Neil, Shankar Pal, Gideon Schaller, Istvan Cseri, Jose A. Blakeley, Nigel Clifton Westbury, Sameet Agarwal, F. Soner Terek
-
Publication number: 20050091188Abstract: 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.Type: ApplicationFiled: October 24, 2003Publication date: April 28, 2005Inventors: Shankar Pal, Istvan Cseri, Gideon Schaller, Oliver Seeliger, Denis Altudov, Denis Churin, Sameer Verkhedkar
-
Publication number: 20050027743Abstract: 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.Type: ApplicationFiled: August 24, 2004Publication date: February 3, 2005Applicant: Microsoft CorporationInventors: Patrick O'Neil, Elizabeth O'Neil, Shankar Pal, Gideon Schaller, Istvan Cseri, Jose Blakeley, Nigel Westbury, Sameet Agarwal, F. Terek
-
Publication number: 20050027728Abstract: 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.Type: ApplicationFiled: August 24, 2004Publication date: February 3, 2005Applicant: Microsoft CorporationInventors: Patrick O'Neil, Elizabeth O'Neil, Shankar Pal, Gideon Schaller, Istvan Cseri, Jose Blakeley, Nigel Westbury, Sameet Agarwal, F. Terek
-
Publication number: 20050021549Abstract: 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.Type: ApplicationFiled: August 24, 2004Publication date: January 27, 2005Applicant: Microsoft CorporationInventors: Patrick O'Neil, Elizabeth O'Neil, Shankar Pal, Gideon Schaller, Istvan Cseri, Jose Blakeley, Nigel Westbury, Sameet Agarwal, F. Terek
-
Publication number: 20050004896Abstract: 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 “auto 1” 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 “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.Type: ApplicationFiled: January 27, 2004Publication date: January 6, 2005Applicant: Microsoft CorporationInventors: Istvan Cseri, Goetz Graefe, Frank Mantek, Michael Mee, Michael Rys, Gideon Schaller, Oliver Seeliger
-
Patent number: 6708164Abstract: 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 “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query.Type: GrantFiled: March 17, 2000Date of Patent: March 16, 2004Assignee: Microsoft CorporationInventors: Istvan Cseri, Goetz Graefe, Frank Mantek, Michael Mee, Michael Rys, Gideon Schaller, Oliver Seeliger
-
Publication number: 20030110150Abstract: 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.Type: ApplicationFiled: November 30, 2001Publication date: June 12, 2003Inventors: Patrick Eugene O'Neil, Elizabeth Jean O'Neil, Shankar Pal, Gideon Schaller, Istvan Cseri, Jose A. Blakeley, Nigel Clifton Westbury, Sameet Agarwal, F. Soner Terek