Patents by Inventor Oliver Seeliger
Oliver Seeliger 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: 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: 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: 20070130110Abstract: A method and system for transforming a query tree that includes more than one aggregator. The method includes identifying a first aggregator in the query tree, identifying a second aggregator that is located below the first aggregator in the query tree, and merging the second aggregator with the first aggregator to form a merged aggregator.Type: ApplicationFiled: December 7, 2005Publication date: June 7, 2007Applicant: Microsoft CorporationInventors: Goetz Graefe, Oliver Seeliger, Torsten Grabs, Yevgeniy Kogan
-
Publication number: 20060242115Abstract: 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.Type: ApplicationFiled: April 25, 2005Publication date: October 26, 2006Applicant: Microsoft CorporationInventors: Adrian Baras, Michael Rys, Istvan Cseri, Oliver Seeliger, Peter Kukol
-
Publication number: 20050210023Abstract: Improved query optimizer using implied predicates. The system facilitates allowing a query optimizing component to introduce into a query, extra predicates that facilitate the following: render the same results as the original query; are used as dictated by rules passed to the optimizing component—these rules specify whether the new predicate is an equivalence (that will substitute the old predicate) or an implication (in which the old predicate is preserved); are considered as cost-based alternatives, and discarded if not useful; are tied to index utilization; and can consider both standard and multi-valued indices.Type: ApplicationFiled: March 18, 2004Publication date: September 22, 2005Inventors: Renato Barrera, Jose Blakeley, Cesar Galindo-Legaria, Balaji Rathakrishnan, Oliver Seeliger
-
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: 20050177551Abstract: Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.Type: ApplicationFiled: December 30, 2004Publication date: August 11, 2005Applicant: Microsoft CorporationInventors: Balaji Rathakrishnan, Beysim Sezgin, Denis Altudov, Jose Blakeley, Oliver Seeliger, Ramachandran Venkatesh, Wei Yu, Dragan Tomic, Denis Churin, Bruno Denuit, Conor Cunningham, Stefano Stefani
-
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
-
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: 20050091256Abstract: A technique for updating collection-valued and other complex structured columns in a nested table using a nested extension of an UPDATE statement that uses syntax and semantics to modify collection-valued columns in a way that is analogous to the syntax and semantics of the UPDATE statement that is used to modify scalar-valued columns of the table (called the outer UPDATE). Using the same syntactic and semantic constructs as the table at the outer level allows an existing implementation that processes modifications to relational tables to reuse its implementation techniques for processing outer updates to modify collection-valued columns as well. The UPDATE extensions enable the specification of updates to nested collections embedded at arbitrary levels of depth in the object model. The new syntax is embedded inside the outer UPDATE statement in a way that parallels the structure of the data itself and thus maps more directly to the user's conceptual model of the data.Type: ApplicationFiled: October 24, 2003Publication date: April 28, 2005Inventors: Balaji Rathakrishnan, Stefano Stefani, Aleksandras Surna, Jose Blakeley, Oliver Seeliger
-
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