Patents by Inventor William B. Ackerman
William B. Ackerman 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: 10909078Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for processing data are provided. Compressed data is received and a requested operation for uncompressed data is performed on the compressed data by determining an intermediate location in a compression hierarchy of compression nodes and applying the requested operation to the data at that intermediate location.Type: GrantFiled: February 25, 2015Date of Patent: February 2, 2021Assignee: International Business Machines CorporationInventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Patent number: 10901948Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for processing data are provided. Compressed data is received and a requested operation for uncompressed data is performed on the compressed data by determining an intermediate location in a compression hierarchy of compression nodes and applying the requested operation to the data at that intermediate location.Type: GrantFiled: March 4, 2016Date of Patent: January 26, 2021Assignee: International Business Machines CorporationInventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Patent number: 10671610Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.Type: GrantFiled: August 10, 2018Date of Patent: June 2, 2020Assignee: International Business Machines CorporationInventors: William B. Ackerman, Eileen T. Lin, David L. Meyers, Shivin S. Misra, Michael R. Zabka
-
Patent number: 10353899Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.Type: GrantFiled: September 14, 2016Date of Patent: July 16, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: William B. Ackerman, Eileen T. Lin, David L. Meyers, Shivin S. Misra, Michael R. Zabka
-
Publication number: 20180349442Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.Type: ApplicationFiled: August 10, 2018Publication date: December 6, 2018Inventors: William B. Ackerman, Eileen T. Lin, David L. Meyers, Shivin S. Misra, Michael R. Zabka
-
Patent number: 10089356Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.Type: GrantFiled: August 28, 2015Date of Patent: October 2, 2018Assignee: International Business Machines CorporationInventors: William B. Ackerman, Eileen T. Lin, David L. Meyers, Shivin S. Misra, Michael R. Zabka
-
Publication number: 20170060978Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.Type: ApplicationFiled: September 14, 2016Publication date: March 2, 2017Inventors: William B. Ackerman, Eileen T. Lin, David L. Meyers, Shivin S. Misra, Michael R. Zabka
-
Publication number: 20170060953Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.Type: ApplicationFiled: August 28, 2015Publication date: March 2, 2017Inventors: William B. Ackerman, Eileen T. Lin, David L. Meyers, Shivin S. Misra, Michael R. Zabka
-
Patent number: 9535923Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: GrantFiled: March 16, 2016Date of Patent: January 3, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Patent number: 9519651Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: GrantFiled: March 22, 2016Date of Patent: December 13, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Patent number: 9514147Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: GrantFiled: March 16, 2016Date of Patent: December 6, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Patent number: 9514149Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: GrantFiled: March 22, 2016Date of Patent: December 6, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Patent number: 9514148Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: GrantFiled: March 22, 2016Date of Patent: December 6, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Publication number: 20160246811Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for processing data are provided. Compressed data is received and a requested operation for uncompressed data is performed on the compressed data by determining an intermediate location in a compression hierarchy of compression nodes and applying the requested operation to the data at that intermediate location.Type: ApplicationFiled: March 4, 2016Publication date: August 25, 2016Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Publication number: 20160246810Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for processing data are provided. Compressed data is received and a requested operation for uncompressed data is performed on the compressed data by determining an intermediate location in a compression hierarchy of compression nodes and applying the requested operation to the data at that intermediate location.Type: ApplicationFiled: February 25, 2015Publication date: August 25, 2016Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Publication number: 20160204798Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: ApplicationFiled: March 22, 2016Publication date: July 14, 2016Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Publication number: 20160204797Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: ApplicationFiled: March 22, 2016Publication date: July 14, 2016Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Publication number: 20160204799Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: ApplicationFiled: March 22, 2016Publication date: July 14, 2016Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Publication number: 20160196278Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: ApplicationFiled: March 16, 2016Publication date: July 7, 2016Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller
-
Publication number: 20160197622Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.Type: ApplicationFiled: March 16, 2016Publication date: July 7, 2016Inventors: William B. Ackerman, Garth A. Dickie, Jeffrey M. Keller