Patents by Inventor Conor Cunningham

Conor Cunningham 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).

  • Publication number: 20050198001
    Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.
    Type: Application
    Filed: February 4, 2005
    Publication date: September 8, 2005
    Applicant: Microsoft Corporation
    Inventors: Conor Cunningham, Eric Hanson, Milind Joshi, Cesar Galindo-Legaria, Florian Waas
  • Publication number: 20050198019
    Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.
    Type: Application
    Filed: March 31, 2005
    Publication date: September 8, 2005
    Inventors: Conor Cunningham, Eric Hanson, Milind Joshi, Cesar Galindo-Legaria, Florian Waas
  • Publication number: 20050198016
    Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.
    Type: Application
    Filed: February 4, 2005
    Publication date: September 8, 2005
    Applicant: Microsoft Corporation
    Inventors: Conor Cunningham, Eric Hanson, Milind Joshi, Cesar Galindo-Legaria, Florian Waas
  • Publication number: 20050177551
    Abstract: 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: Application
    Filed: December 30, 2004
    Publication date: August 11, 2005
    Applicant: Microsoft Corporation
    Inventors: 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: 20050091183
    Abstract: Efficient hierarchical searching is based on object type. By pre-computing additional information and storing it in a fast-lookup structure, it is possible to quickly identify objects that satisfy an object retrieval request. Furthermore, it is also possible to use this technique to avoid object hydration for operations in the store. Moreover, it is possible to leverage database statistical structures such as histograms to estimate the number of qualifying objects without having to examine each object.
    Type: Application
    Filed: October 23, 2003
    Publication date: April 28, 2005
    Inventors: Conor Cunningham, Ramachandran Venkatesh, Eric Hanson