Patents by Inventor David Vengerov

David Vengerov 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: 10353897
    Abstract: A system performs database management. The system receives a request for a query of a plurality of tables under a join condition on an attribute and determines a uniform mapping that maps a domain of the attribute into a set of numbers, where the domain of the attribute includes all attribute values taken by the attribute in the tables. Then, for a row in a table, the system includes the row into a synopsis of the table if the row includes an attribute value that is mapped by the uniform mapping to a number less than an inclusion probability associated with the table. The system obtains a plurality of synopsis for the tables by repeating the including for all rows in the table and for all tables, and determines, based on the plurality of synopsis, an estimate join size of the tables under the join condition.
    Type: Grant
    Filed: June 29, 2015
    Date of Patent: July 16, 2019
    Assignee: Oracle International Corporation
    Inventors: David Vengerov, Mohamed Zait, Sunil P. Chakkappen, Andre Menck
  • Patent number: 10339069
    Abstract: Techniques are provided for managing cached data objects in a mixed workload environment. In an embodiment, a database system receives request to access a target data object. The database system determines whether the request to access the target data object is associated with a first type of workload or a second type of workload. In response to determining that the request is associated with the first type of workload, the target data object replaces a least recently used data object in a cache. In response to determining that the request is associated with the second type of workload, the target data object is cached based on an associated access-level value.
    Type: Grant
    Filed: March 14, 2013
    Date of Patent: July 2, 2019
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Adam Y. Lee, J. William Lee, Dmitry Mikhailovich Potapov, Neil MacNaughton, Vipin Gokhale, Bharat Chandra Baddepudi, David Vengerov
  • Publication number: 20190163671
    Abstract: Methods, systems and computer program products for recommendation systems. Embodiments commence by gathering a set of pathnames that refer to content objects of a collaboration system. A tokenizer converts at least some of the pathnames into vectors. The vectors comprise hierarchical path components such as folder names or file names, which vectors are labeled with an indication as to whether or not the folder or file referred to in a particular vector had been clicked on by one or more users. Some portion of the labeled vectors are used to train a predictive model. Another portion of the vectors are used to validate the predictive model. When the model exhibits sufficient precision and recall, the predictive model is then used to predict the probability that a particular user would have an interest in a particular folder or file. The folder name or file name is presented as a collaboration recommendation.
    Type: Application
    Filed: January 31, 2019
    Publication date: May 30, 2019
    Applicant: Box, Inc.
    Inventors: David Vengerov, Sesh Jalagam, Victor De Vansa Vikramaratne
  • Publication number: 20180089275
    Abstract: A system is provided that generates a list of most common items and respective item frequencies from a data set that includes a plurality of items. The system creates a first list of items from the data set and monitors an estimate count for each item in the first list, where the first list is sorted by the estimate count. The system further transfers items that exceed a threshold hit count from the first list to a second list. The system further monitors a hit count for the items in the second list, where the items in the second list are sorted by the hit count. The system further transfers the items that are displaced from the second list back to the first list.
    Type: Application
    Filed: September 26, 2016
    Publication date: March 29, 2018
    Inventor: David VENGEROV
  • Publication number: 20160378829
    Abstract: A system performs database management. The system receives a request for a query of a plurality of tables under a join condition on an attribute and determines a uniform mapping that maps a domain of the attribute into a set of numbers, where the domain of the attribute includes all attribute values taken by the attribute in the tables. Then, for a row in a table, the system includes the row into a synopsis of the table if the row includes an attribute value that is mapped by the uniform mapping to a number less than an inclusion probability associated with the table. The system obtains a plurality of synopsis for the tables by repeating the including for all rows in the table and for all tables, and determines, based on the plurality of synopsis, an estimate join size of the tables under the join condition.
    Type: Application
    Filed: June 29, 2015
    Publication date: December 29, 2016
    Inventors: David VENGEROV, Mohamed ZAIT, Sunil P. CHAKKAPPEN, Andre MENCK
  • Patent number: 9465715
    Abstract: A system optimizes a number of shared server processes executing on a processor. The system creates, in a memory, a data array for storing a plurality of performance metric values, each associated with a number of shared server processes. The system selects a value for an optimized number of shared server processes according to a first procedure based on the performance metric, observes a performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric. The system repeats the selecting, observing and storing until at least a predetermined number of contiguous data values are stored in the data array. The system selects the value for the optimized number according to a second procedure based on a slope of the performance metric. The system observes the performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric.
    Type: Grant
    Filed: June 12, 2014
    Date of Patent: October 11, 2016
    Inventors: David Vengerov, Douglas Neale
  • Publication number: 20150363291
    Abstract: A system optimizes a number of shared server processes executing on a processor. The system creates, in a memory, a data array for storing a plurality of performance metric values, each associated with a number of shared server processes. The system selects a value for an optimized number of shared server processes according to a first procedure based on the performance metric, observes a performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric. The system repeats the selecting, observing and storing until at least a predetermined number of contiguous data values are stored in the data array. The system selects the value for the optimized number according to a second procedure based on a slope of the performance metric. The system observes the performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric.
    Type: Application
    Filed: June 12, 2014
    Publication date: December 17, 2015
    Inventors: David VENGEROV, Douglas NEALE
  • Patent number: 8930235
    Abstract: A system for optimizing shelf space placement for a product receives decision variables and constraints, and executes a Randomized Search (“RS”) using the decision variables and constraints until an RS solution is below a pre-determined improvement threshold. The system then solves a Mixed-Integer Linear Program (“MILP”) problem using the decision variables and constraints, and using the RS solution as a starting point, to generate a MILP solution. The system repeats the RS executing and MILP solving as long as the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration. The system then, based on the final MILP solution, outputs a shelf position and a number of facings for the product.
    Type: Grant
    Filed: November 9, 2012
    Date of Patent: January 6, 2015
    Assignee: Oracle International Corporation
    Inventors: Kresimir Mihic, Andrew Vakhutinsky, David Vengerov
  • Publication number: 20140358600
    Abstract: A system is provided that that generates an optimal item placement for one or more items. The system receives one or more items, where each item includes an item height and an item width. The system further receives a container, where the container comprises a container height and a container width. The system further generates a number of copies for each item and a position within the container for each copy of each item, where each copy of each item is placed at the corresponding position within the container. The system further outputs the number of copies for each item and the position within the container for each copy of each item.
    Type: Application
    Filed: May 30, 2013
    Publication date: December 4, 2014
    Applicant: Oracle International Corporation
    Inventor: David VENGEROV
  • Publication number: 20140095802
    Abstract: Techniques are provided for managing cached data objects in a mixed workload environment. In an embodiment, a database system receives request to access a target data object. The database system determines whether the request to access the target data object is associated with a first type of workload or a second type of workload. In response to determining that the request is associated with the first type of workload, the target data object replaces a least recently used data object in a cache. In response to determining that the request is associated with the second type of workload, the target data object is cached based on an associated access-level value.
    Type: Application
    Filed: March 14, 2013
    Publication date: April 3, 2014
    Applicant: Oracle International Corporation
    Inventors: Adam Y. Lee, J. William Lee, Dmitry Mikhailovich Potapov, Neil MacNaughton, Vipin Gokhale, Bharat Chandra Baddepudi, David Vengerov
  • Patent number: 8601217
    Abstract: A method of inserting cache blocks into a cache queue includes detecting a first cache miss for the cache queue, identifying a storage block receiving an access in response to the cache miss, calculating a first estimated cache miss cost for a first storage container that includes the storage block, calculating an insertion probability for the first storage container based on a mathematical formula of the first estimated cache miss cost, randomly selecting an insertion probability number from a uniform distribution, and inserting, in response to the insertion probability exceeding the insertion probability number, a new cache block corresponding to the storage block into the cache queue.
    Type: Grant
    Filed: January 14, 2011
    Date of Patent: December 3, 2013
    Assignee: Oracle International Corporation
    Inventors: Garret Frederick Swart, David Vengerov
  • Patent number: 8601216
    Abstract: A method for removing cache blocks from a cache queue includes detecting a first cache miss for the cache queue, identifying, within the cache queue, a new cache block storing a value of a storage block, calculating an estimated cache miss cost for a storage container having the storage block, calculating a removal probability for the storage container based on a mathematical formula of the estimated cache miss cost, randomly selecting a probability number from a uniform distribution, where the removal probability exceeds the probability number, and evicting, in response to the removal probability exceeding the probability number, the new cache block from the cache queue.
    Type: Grant
    Filed: January 14, 2011
    Date of Patent: December 3, 2013
    Assignee: Oracle International Corporation
    Inventors: Garret Frederick Swart, David Vengerov
  • Publication number: 20130275277
    Abstract: A system for optimizing shelf space placement for a product receives decision variables and constraints, and executes a Randomized Search (“RS”) using the decision variables and constraints until an RS solution is below a pre-determined improvement threshold. The system then solves a Mixed-Integer Linear Program (“MILP”) problem using the decision variables and constraints, and using the RS solution as a starting point, to generate a MILP solution. The system repeats the RS executing and MILP solving as long as the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration. The system then, based on the final MILP solution, outputs a shelf position and a number of facings for the product.
    Type: Application
    Filed: November 9, 2012
    Publication date: October 17, 2013
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Kresimir MIHIC, Andrew VAKHUTINSKY, David VENGEROV
  • Patent number: 8533719
    Abstract: The disclosed embodiments provide a system that facilitates scheduling threads in a multi-threaded processor with multiple processor cores. During operation, the system executes a first thread in a processor core that is associated with a shared cache. During this execution, the system measures one or more metrics to characterize the first thread. Then, the system uses the characterization of the first thread and a characterization for a second, second thread to predict a performance impact that would occur if the second thread were to simultaneously execute in a second processor core that is also associated with the cache. If the predicted performance impact indicates that executing the second thread on the second processor core will improve performance for the multi-threaded processor, the system executes the second thread on the second processor core.
    Type: Grant
    Filed: April 5, 2010
    Date of Patent: September 10, 2013
    Assignee: Oracle International Corporation
    Inventors: Alexandra Fedorova, David Vengerov, Kishore Kumar Pusukuri
  • Patent number: 8533026
    Abstract: A method for maximizing revenue generated from a plurality of service level agreements (SLAs) that includes receiving a first subset of the plurality of SLAs for executing a first plurality of jobs, wherein each SLA in the first subset specifies a first maximum requested delay that is greater than an initial minimum offered delay, and wherein a price of each SLA in the first subset is defined by the maximum requested delay and a price/delay function, calculating a first expected revenue from executing the first subset, and optimizing a second subset of the plurality of SLAs by replacing the initial minimum offered delay on the initial price/delay function with a new minimum offered delay based on the expected revenue, wherein each SLA in the second subset specifies a second maximum requested delay that is greater than the new minimum offered delay.
    Type: Grant
    Filed: October 17, 2006
    Date of Patent: September 10, 2013
    Assignee: Oracle America, Inc.
    Inventors: David Vengerov, Ilya Gluhovsky
  • Publication number: 20130166353
    Abstract: A price optimization system determines the pricing of a plurality of items. The system receives an initial price vector for the items and an objective function, and assigns the initial price vector as a current price vector. The system determines a first new price vector by randomly choosing a first set of allowed prices for the items, and assigning the first set of allowed prices as the current price vector when the objective function is improved. The system then determines a second new price vector by randomly choosing a second set of allowed prices for the items and assigning the second set of allowed prices as the current price vector when the objective function does not decrease by more than a predetermined value. The system sequentially repeats this functionality until a terminating criteria is reached and then it determines the pricing.
    Type: Application
    Filed: December 21, 2011
    Publication date: June 27, 2013
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Kresimir MIHIC, David VENGEROV, Andrew VAKHUTINSKY
  • Patent number: 8468041
    Abstract: One embodiment of the present invention provides a system that allocates resources to projects in a computer system. During operation, the system determines a current demand by a project for a resource, and a current allocation of the resource to the project. The system also uses a computational model to compute an expected long-term utility of the project for the resource. Next, the system trades the resource between the project and other projects in the computer system to optimize expected long-term utilities. During this process, the system uses a reinforcement learning technique to update parameters of the computational model for the expected long-term utility of the project based on performance feedback.
    Type: Grant
    Filed: December 22, 2004
    Date of Patent: June 18, 2013
    Assignee: Oracle America, Inc.
    Inventor: David Vengerov
  • Patent number: 8356061
    Abstract: Some embodiments of the present invention provide a system that executes a garbage collector in a computing system. During operation, the system obtains a throughput model for the garbage collector and estimates a set of characteristics associated with the garbage collector. Next, the system applies the characteristics to the throughput model to estimate a throughput of the garbage collector. The system then determines a level of performance for the garbage collector based on the estimated throughput. Finally, the system adjusts a tunable parameter for the garbage collector based on the level of performance to increase the throughput of the garbage collector.
    Type: Grant
    Filed: June 23, 2008
    Date of Patent: January 15, 2013
    Assignee: Oracle America, Inc.
    Inventor: David Vengerov
  • Patent number: 8276143
    Abstract: Disclosed herein is a system and method for dynamic scheduling of application tasks in a distributed task-based system. The system and method employ a learning mechanism that observes and predicts overall application task costs across a networked system, taking into account how the states or loads of the applications are likely to change over time. The application task costs are defined in economic terms. The system and method allows continuous optimization of application response times as perceived by application users.
    Type: Grant
    Filed: March 10, 2008
    Date of Patent: September 25, 2012
    Assignee: Oracle America, Inc.
    Inventors: David Vengerov, Seth Proctor
  • Patent number: 8166269
    Abstract: Methods and apparatus are provided for adaptively triggering garbage collection. During relatively steady or decreasing rates of allocation of free memory, a threshold for triggering garbage collection is dynamically and adaptively determined on the basis of memory drops (i.e., decreases in free memory) during garbage collection. If a significant increase in the rate of allocation of memory is observed (e.g., two consecutive measurements that exceed a mean rate plus two standard deviations), the threshold is modified based on a memory drop previously observed in conjunction with the current memory allocation rate, or a memory drop estimated to be possible for the current allocation rate.
    Type: Grant
    Filed: November 5, 2009
    Date of Patent: April 24, 2012
    Assignee: Oracle America, Inc.
    Inventor: David Vengerov