Patents by Inventor Dmitry Letin

Dmitry Letin 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).

  • Early exit from table scans of loosely ordered and/or grouped relations using nearly ordered maps
    Patent number: 11194780
    Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.
    Type: Grant
    Filed: September 18, 2018
    Date of Patent: December 7, 2021
    Assignee: International Business Machines Corporation
    Inventors: Garth A. Dickie, Dmitry Letin
  • Data-partitioning for processing loosely ordered relations
    Patent number: 10331645
    Abstract: Storage regions in a database are associated with respective intervals including first and second interval values indicating a value range for values within that storage region. The first interval values are sorted into an order that determines a scanning order for a data operation on data in the storage regions. The storage regions are scanned in the scanning order to arrange data from the storage regions in at least a partially ordered sequence for the data operation.
    Type: Grant
    Filed: August 17, 2015
    Date of Patent: June 25, 2019
    Assignee: International Business Machines Corporation
    Inventors: Garth A. Dickie, Ian R. Finlay, Dmitry Letin
  • Data-partitioning for processing loosely ordered relations
    Patent number: 10324918
    Abstract: Storage regions in a database are associated with respective intervals including first and second interval values indicating a value range for values within that storage region. The first interval values are sorted into an order that determines a scanning order for a data operation on data in the storage regions. The storage regions are scanned in the scanning order to arrange data from the storage regions in at least a partially ordered sequence for the data operation.
    Type: Grant
    Filed: May 6, 2016
    Date of Patent: June 18, 2019
    Assignee: International Business Machines Corporation
    Inventors: Garth A. Dickie, Ian R. Finlay, Dmitry Letin
  • EARLY EXIT FROM TABLE SCANS OF LOOSELY ORDERED AND/OR GROUPED RELATIONS USING NEARLY ORDERED MAPS
    Publication number: 20190018872
    Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.
    Type: Application
    Filed: September 18, 2018
    Publication date: January 17, 2019
    Inventors: Garth A. Dickie, Dmitry Letin
  • Early exit from table scans of loosely ordered and/or grouped relations using nearly ordered maps
    Patent number: 10108649
    Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.
    Type: Grant
    Filed: February 25, 2014
    Date of Patent: October 23, 2018
    Assignee: Internatonal Business Machines Corporation
    Inventors: Garth A. Dickie, Dmitry Letin
  • Early exit from table scans of loosely ordered and/or grouped relations using nearly ordered maps
    Patent number: 10108651
    Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.
    Type: Grant
    Filed: November 24, 2014
    Date of Patent: October 23, 2018
    Assignee: International Business Machines Corporation
    Inventors: Garth A. Dickie, Dmitry Letin
  • DATA-PARTITIONING FOR PROCESSING LOOSELY ORDERED RELATIONS
    Publication number: 20170052991
    Abstract: Storage regions in a database are associated with respective intervals including first and second interval values indicating a value range for values within that storage region. The first interval values are sorted into an order that determines a scanning order for a data operation on data in the storage regions. The storage regions are scanned in the scanning order to arrange data from the storage regions in at least a partially ordered sequence for the data operation.
    Type: Application
    Filed: May 6, 2016
    Publication date: February 23, 2017
    Inventors: Garth A. Dickie, Ian R. Finlay, Dmitry Letin
  • DATA-PARTITIONING FOR PROCESSING LOOSELY ORDERED RELATIONS
    Publication number: 20170052990
    Abstract: Storage regions in a database are associated with respective intervals including first and second interval values indicating a value range for values within that storage region. The first interval values are sorted into an order that determines a scanning order for a data operation on data in the storage regions. The storage regions are scanned in the scanning order to arrange data from the storage regions in at least a partially ordered sequence for the data operation.
    Type: Application
    Filed: August 17, 2015
    Publication date: February 23, 2017
    Inventors: Garth A. Dickie, Ian R. Finlay, Dmitry Letin
  • EARLY EXIT FROM TABLE SCANS OF LOOSELY ORDERED AND/OR GROUPED RELATIONS USING NEARLY ORDERED MAPS
    Publication number: 20150242452
    Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.
    Type: Application
    Filed: February 25, 2014
    Publication date: August 27, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Garth A. Dickie, Dmitry Letin
  • EARLY EXIT FROM TABLE SCANS OF LOOSELY ORDERED AND/OR GROUPED RELATIONS USING NEARLY ORDERED MAPS
    Publication number: 20150242506
    Abstract: According to embodiments of the present invention, methods, systems and computer-readable media are presented for scanning a plurality of storage regions within memory for a specified quantity of results, wherein each storage region is associated with an interval including first and second interval values indicating a value range for values within that storage region. The techniques comprise sorting the first interval values into an order, wherein the order of the first interval values determines a scanning order for the plurality of storage regions, determining a result value, wherein the result value is an upper bound, a lower bound, or is outside of the specified quantity of results, and examining the sorted first interval values and scanning corresponding individual storage regions in response to a comparison of the determined result value with the first interval value of that storage region.
    Type: Application
    Filed: November 24, 2014
    Publication date: August 27, 2015
    Inventors: Garth A. Dickie, Dmitry Letin