Patents by Inventor Jonathan M. Baccash

Jonathan M. Baccash 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: 8019751
    Abstract: The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.
    Type: Grant
    Filed: June 23, 2008
    Date of Patent: September 13, 2011
    Assignee: Oracle International Corporation
    Inventors: Jonathan M. Baccash, Igor Nazarenko, Uri Rodny, Ambuj Shatdal
  • Publication number: 20110004413
    Abstract: Embodiments for calling variations in a sample polynucleotide sequence compared to a reference polynucleotide sequence are provided. Aspects of the embodiments include executing an application on at least one computer that locates local areas in the reference polynucleotide sequence where a likelihood exists that one or more bases of the sample polynucleotide sequence are changed from corresponding bases in the reference polynucleotide sequence, where the likelihood is determined at least in part based on mapped mated reads of the sample polynucleotide sequence; generating at least one sequence hypothesis for each of the local areas, and optimizing the at least one sequence hypothesis for at least a portion of the local areas to find one or more optimized sequence hypotheses of high probability for the local areas; and analyzing the optimized sequence hypotheses to identify a series of variation calls in the sample polynucleotide sequence.
    Type: Application
    Filed: April 29, 2010
    Publication date: January 6, 2011
    Applicant: COMPLETE GENOMICS, INC.
    Inventors: Paolo Carnevali, Jonathan M. Baccash, Igor Nazarenko, Aaron L. Halpern, Geoffrey Nilsen, Bruce Martin, Radoje Drmanac
  • Patent number: 7467127
    Abstract: Selection of certain views of a multidimensional database to materialize may be accomplished using an efficient and effective solution. A set of all potential views may be stored in a structure. A path in the structure may then be traversed in an indicated direction through the structure, the path including two or more potential views and beginning at an indicated view. Then two or more immaterialized views in the path may be compared to each other to determine which immaterialized view is the optimum choice for maximizing benefit if selected to be materialized. Then the traversing and comparing may be continually iterated through, each iteration utilizing an indicated direction different than the last, each iteration also utilizing an indicated view set at the optimum choice determined by the last iteration, the iterating continuing until it converges on a single view. That single view may then be selected for materialization.
    Type: Grant
    Filed: June 7, 2004
    Date of Patent: December 16, 2008
    Assignee: Hyperion Solutions Corporation
    Inventors: Jonathan M. Baccash, Igor Nazarenko, Uri Rodny, Ambuj Shatdal
  • Publication number: 20080270365
    Abstract: The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.
    Type: Application
    Filed: June 23, 2008
    Publication date: October 30, 2008
    Inventors: Jonathan M. Baccash, Igor Nazarenko, Uri Rodny, Ambui Shatdal
  • Patent number: 7392242
    Abstract: The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting tuple is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.
    Type: Grant
    Filed: June 7, 2004
    Date of Patent: June 24, 2008
    Assignee: Hyperion Solutions Corporation
    Inventors: Jonathan M. Baccash, Igor Nazarenko, Uri Rodny, Ambuj Shatdal