Patents by Inventor Thomas Beavin

Thomas Beavin 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: 20070078813
    Abstract: Methods, computer programs and system for executing a query on data that has been partitioned into a plurality of partitions are provided. The method includes providing partitioned data including one or more columns and the plurality of partitions. The partitioned data includes a limit key value associated with each column for a given partition. The method further includes receiving a query including a predicate on one of the one or more columns of the partitioned data; and utilizing the predicate on the one of the one or more columns in a pruning decision on at least one of the one or more partitions based on the limit key values associated with the plurality of partitions.
    Type: Application
    Filed: October 4, 2005
    Publication date: April 5, 2007
    Applicant: International Business Machines Corporation
    Inventors: Thomas Beavin, Sauraj Goswami, Terence Purcell
  • Publication number: 20060287979
    Abstract: Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.
    Type: Application
    Filed: June 17, 2005
    Publication date: December 21, 2006
    Inventors: Thomas Beavin, Mengchu Cai, Yao-Ching Chen, Hsiuying Cheng, Fen-Ling Lin, Irene Liu, Jerry Mukai, Demai Ni, Yoichi Tsuji, Li Xia, Ying Zeng
  • Publication number: 20060173833
    Abstract: Processing non-Boolean term conditions in database queries. A query that is a request for data in a database is received and includes at least one uneven non-Boolean term condition that spans multiple tables in the database. The non-Boolean term condition is split into separate portions, each of the portions providing a Boolean term that can be satisfied by accessing one table in the database. The separate portions are executed independently to find at least one data result in the database that satisfies the Boolean term of each separate portion, and the data result from each separate portion are combined into a final result that satisfies the query.
    Type: Application
    Filed: January 28, 2005
    Publication date: August 3, 2006
    Inventors: Terence Purcell, Thomas Beavin