Patents by Inventor Boris Klots

Boris Klots 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: 10333863
    Abstract: Allocation of resources across multiple consumers allows efficient utilization of shared resources. Observed usages of resources by consumers over time intervals are used to determine a total throughput of resources by the consumers. The total throughput of resources is used to determine allocation of resources for a subsequent time interval. The consumers are associated with priorities used to determine their allocations. Minimum and maximum resource guarantees may be associated with consumers. The resource allocation aims to allocate resources based on the priorities of the consumers while aiming to avoid starvation by any consumer. The resource allocation allows efficient usage of network resources in a database storage system storing multiple virtual databases.
    Type: Grant
    Filed: July 8, 2015
    Date of Patent: June 25, 2019
    Assignee: DELPHIX CORP.
    Inventors: Boris Klots, Subhadeep Sinha, Satish Kumar
  • Patent number: 10223437
    Abstract: A method and apparatus for adaptive data repartitioning and adaptive data replication is provided. A data set stored in a distributed data processing system is partitioned by a first partitioning key. A live workload comprising a plurality of data processing commands is processed. While processing the live workload, statistical properties of the live workload are maintained. Based on the statistical properties of the live workload with respect to the data set, it is determined to replicate and/or repartition the data set by a second partitioning key. The replicated and/or repartitioned data set is partitioned by the second partitioning key.
    Type: Grant
    Filed: February 27, 2015
    Date of Patent: March 5, 2019
    Assignee: Oracle International Corporation
    Inventors: Boris Klots, Vikas Aggarwal, Nipun Agarwal, John Kowtko, Felix Schmidt, Kantikiran Pasupuleti
  • Patent number: 9842148
    Abstract: Herein is described a data placement scheme for a distributed query processing systems that achieves load balance amongst the nodes of the system. To identify a node on which to place particular data, a supervisor node performs a placement algorithm over the particular data's identifier, where the placement algorithm utilizes two or more hash functions. The supervisor node runs the placement algorithm until a destination node is identified that is available to store the data, or the supervisor node has run the placement algorithm an established number of times. If no available node is identified using the placement algorithm, then an available destination node is identified for the particular data and information identifying the data and the selected destination node is included in an exception map. Most data may be located by any node in the system based on the node performing the placement algorithm for the required data.
    Type: Grant
    Filed: May 5, 2015
    Date of Patent: December 12, 2017
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Gong Zhang, Sabina Petride, Boris Klots, Sam Idicula, Nipun Agarwal
  • Publication number: 20160328456
    Abstract: Herein is described a data placement scheme for a distributed query processing systems that achieves load balance amongst the nodes of the system. To identify a node on which to place particular data, a supervisor node performs a placement algorithm over the particular data's identifier, where the placement algorithm utilizes two or more hash functions. The supervisor node runs the placement algorithm until a destination node is identified that is available to store the data, or the supervisor node has run the placement algorithm an established number of times. If no available node is identified using the placement algorithm, then an available destination node is identified for the particular data and information identifying the data and the selected destination node is included in an exception map. Most data may be located by any node in the system based on the node performing the placement algorithm for the required data.
    Type: Application
    Filed: May 5, 2015
    Publication date: November 10, 2016
    Inventors: Gong Zhang, Sabina Petride, Boris Klots, Sam Idicula, Nipun Agarwal
  • Publication number: 20160253402
    Abstract: A method and apparatus for adaptive data repartitioning and adaptive data replication is provided. A data set stored in a distributed data processing system is partitioned by a first partitioning key. A live workload comprising a plurality of data processing commands is processed. While processing the live workload, statistical properties of the live workload are maintained. Based on the statistical properties of the live workload with respect to the data set, it is determined to replicate and/or repartition the data set by a second partitioning key. The replicated and/or repartitioned data set is partitioned by the second partitioning key.
    Type: Application
    Filed: February 27, 2015
    Publication date: September 1, 2016
    Inventors: Boris Klots, Vikas Aggarwal, Nipun Agarwal, John Kowtko, Felix Schmidt, Kantikiran Pasuppuleti
  • Patent number: 9396451
    Abstract: Order allocation techniques pertaining to stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. The collection of pods defines a container path through the distribution center.
    Type: Grant
    Filed: December 20, 2013
    Date of Patent: July 19, 2016
    Assignee: June Ray Limited
    Inventors: William Henry Waddington, Patricia C. Grewell, Peter Ham, Boris Klots
  • Patent number: 9305281
    Abstract: Order allocation techniques pertaining to stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. The collection of pods defines a container path through the distribution center.
    Type: Grant
    Filed: September 25, 2015
    Date of Patent: April 5, 2016
    Assignee: June Ray Limited
    Inventors: William Henry Waddington, Patricia C. Grewell, Peter Ham, Boris Klots
  • Publication number: 20160019633
    Abstract: Order allocation techniques pertaining to stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. The collection of pods defines a container path through the distribution center.
    Type: Application
    Filed: September 25, 2015
    Publication date: January 21, 2016
    Inventors: William Henry Waddington, Patricia C. Grewell, Peter Ham, Boris Klots
  • Publication number: 20150312169
    Abstract: Allocation of resources across multiple consumers allows efficient utilization of shared resources. Observed usages of resources by consumers over time intervals are used to determine a total throughput of resources by the consumers. The total throughput of resources is used to determine allocation of resources for a subsequent time interval. The consumers are associated with priorities used to determine their allocations. Minimum and maximum resource guarantees may be associated with consumers. The resource allocation aims to allocate resources based on the priorities of the consumers while aiming to avoid starvation by any consumer. The resource allocation allows efficient usage of network resources in a database storage system storing multiple virtual databases.
    Type: Application
    Filed: July 8, 2015
    Publication date: October 29, 2015
    Inventors: Boris Klots, Subhadeep Sinha, Satish Kumar
  • Patent number: 9106591
    Abstract: Allocation of resources across multiple consumers allows efficient utilization of shared resources. Observed usages of resources by consumers over time intervals are used to determine a total throughput of resources by the consumers. The total throughput of resources is used to determine allocation of resources for a subsequent time interval. The consumers are associated with priorities used to determine their allocations. Minimum and maximum resource guarantees may be associated with consumers. The resource allocation aims to allocate resources based on the priorities of the consumers while aiming to avoid starvation by any consumer. The resource allocation allows efficient usage of network resources in a database storage system storing multiple virtual databases.
    Type: Grant
    Filed: December 24, 2009
    Date of Patent: August 11, 2015
    Assignee: Delphix Corporation
    Inventors: Boris Klots, Subhadeep Sinha, Satish Kumar
  • Patent number: 8989910
    Abstract: Methods, machine-readable media, apparatuses and systems are provided to collect and analyze data relating to energy consumption and factors affecting energy production. In various embodiments, such analysis can include time series analysis, multivariate correlation analysis, cluster analysis, anomaly detection methods, multi-dimensional density analysis and demand modeling.
    Type: Grant
    Filed: December 30, 2011
    Date of Patent: March 24, 2015
    Assignee: C3, Inc.
    Inventor: Boris Klots
  • Publication number: 20140108287
    Abstract: Order allocation techniques pertaining to stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. The collection of pods defines a container path through the distribution center.
    Type: Application
    Filed: December 20, 2013
    Publication date: April 17, 2014
    Applicant: IpVenture, Inc.
    Inventors: William Henry Waddington, Patricia C. Grewell, Peter Ham, Boris Klots
  • Patent number: 8655724
    Abstract: Methods and apparatus are described for evaluating a binary classification system operable to classify each of a plurality of events as a first event type or a second event type. At least some of the events of the first event type are independently verifiable with reference to verification data. The binary classification system is susceptible to a first error type in which events of the first event type are classified as the second event type, and a second error type in which events of the second event type are classified as the first event type. Operation of a first configuration of the binary classification system is evaluated with reference to an objective function. The objective function is derived by expressing a number of errors of the second error type in terms of a number of errors of the first error type with reference to the verification data, and by assuming relative proportions of the first and second event types within the plurality of events.
    Type: Grant
    Filed: September 5, 2013
    Date of Patent: February 18, 2014
    Assignee: Yahoo! Inc.
    Inventors: Richard Tao-Hwa Chow, Pavel Berkhin, Elena Eneva, Boris Klots, Nicolas Eddy Mayoraz, Rajesh Girish Parekh
  • Patent number: 8626333
    Abstract: Order allocation techniques pertaining to stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. The collection of pods defines a container path through the distribution center.
    Type: Grant
    Filed: March 13, 2012
    Date of Patent: January 7, 2014
    Assignee: IpVenture, Inc.
    Inventors: William Henry Waddington, Patricia C. Grewell, Peter Ham, Boris Klots
  • Publication number: 20140006145
    Abstract: Methods and apparatus are described for evaluating a binary classification system operable to classify each of a plurality of events as a first event type or a second event type. At least some of the events of the first event type are independently verifiable with reference to verification data. The binary classification system is susceptible to a first error type in which events of the first event type are classified as the second event type, and a second error type in which events of the second event type are classified as the first event type. Operation of a first configuration of the binary classification system is evaluated with reference to an objective function. The objective function is derived by expressing a number of errors of the second error type in terms of a number of errors of the first error type with reference to the verification data, and by assuming relative proportions of the first and second event types within the plurality of events.
    Type: Application
    Filed: September 5, 2013
    Publication date: January 2, 2014
    Applicant: Yahoo! Inc.
    Inventors: Richard Tao-Hwa Chow, Pavel Berkhin, Elena Eneva, Boris Klots, Nicolas Eddy Mayoraz, Rajesh Girish Parekh
  • Patent number: 8554622
    Abstract: Methods and apparatus are described for evaluating a binary classification system operable to classify each of a plurality of events as a first event type or a second event type. At least some of the events of the first event type are independently verifiable with reference to verification data. The binary classification system is susceptible to a first error type in which events of the first event type are classified as the second event type, and a second error type in which events of the second event type are classified as the first event type. Operation of a first configuration of the binary classification system is evaluated with reference to an objective function. The objective function is derived by expressing a number of errors of the second error type in terms of a number of errors of the first error type with reference to the verification data, and by assuming relative proportions of the first and second event types within the plurality of events.
    Type: Grant
    Filed: December 18, 2006
    Date of Patent: October 8, 2013
    Assignee: Yahoo! Inc.
    Inventors: Richard Tao-Hwa Chow, Pavel Berkhin, Elena Eneva, Boris Klots, Nicolas Eddy Mayoraz, Rajesh Girish Parekh
  • Publication number: 20120173449
    Abstract: Order allocation techniques pertaining to stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. The collection of pods defines a container path through the distribution center.
    Type: Application
    Filed: March 13, 2012
    Publication date: July 5, 2012
    Inventors: William Henry Waddington, Patricia C. Grewell, Peter Ham, Boris Klots
  • Patent number: 8140183
    Abstract: Order allocation techniques that reduce the number of stops that a container makes in the process of fulfilling a customer order is disclosed. In one embodiment, this is accomplished by first identifying a pod that stocks the largest number of different items in a customer order. Then, a second pod is identified that stocks the largest number of remaining items in the customer order. Ultimately, all items in the customer order are assigned a pod. The collection of pods defines a container path through the distribution center.
    Type: Grant
    Filed: May 6, 2009
    Date of Patent: March 20, 2012
    Assignee: IpVenture, Inc.
    Inventors: William Henry Waddington, Patricia C. Grewell, Peter Ham, Boris Klots
  • Publication number: 20110161973
    Abstract: Allocation of resources across multiple consumers allows efficient utilization of shared resources. Observed usages of resources by consumers over time intervals are used to determine a total throughput of resources by the consumers. The total throughput of resources is used to determine allocation of resources for a subsequent time interval. The consumers are associated with priorities used to determine their allocations. Minimum and maximum resource guarantees may be associated with consumers. The resource allocation aims to allocate resources based on the priorities of the consumers while aiming to avoid starvation by any consumer. The resource allocation allows efficient usage of network resources in a database storage system storing multiple virtual databases.
    Type: Application
    Filed: December 24, 2009
    Publication date: June 30, 2011
    Applicant: DELPHIX CORP.
    Inventors: Boris Klots, Subhadeep Sinha, Satish Kumar
  • Publication number: 20100241269
    Abstract: A load balancing technology segregates various inventory types (e.g., potatoes vs. milk, vs. pretzels, vs. tissue paper, etc.) based upon how frequently they are ordered in a distribution center. Inventory types that are ordered at the slowest rate are not “replicated” over multiple pods in the distribution center. Rather, they are constrained to reside at a single pod within the distribution center. Items that are ordered somewhat more frequently than those in the slowest group are replicated in multiple pods across the distribution center. In other words, these items are separately stocked at locations on more than one pod in the distribution center. This means that a container passing through the distribution center can obtain each of the items in the second group of item types at multiple pods in the distribution center. Thus, these items do not create a bottleneck in the order fulfillment process. Inventory types in a third group, the fastest movers, are segregated from items in the first two groups.
    Type: Application
    Filed: May 22, 2010
    Publication date: September 23, 2010
    Inventors: Peter Ham, Boris Klots, Radhakrishna Hari, Franklin R. Koenig, Gautam Bhargava, Gerry Perham