Patents by Inventor Barry Zane

Barry Zane 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).

  • Publication number: 20080046438
    Abstract: A database appliance in which two or more internetworked data storage units are used to coordinate the storage and retrieval of database records. One or more central database processing units are also associated with the data storage units. A network infrastructure provides the ability for the central database processors and storage processors to communicate as network nodes, with the network infrastructure using a communication protocol. A software application for executing database operations executes in a distributed fashion with portions of the database application executing on at least one central database processor and other portions executing on the data storage processors. At least a portion of the database application is implemented within and/or coordinated by a communication process that is executing the communication protocol.
    Type: Application
    Filed: September 11, 2007
    Publication date: February 21, 2008
    Inventors: Foster Hinshaw, Steven Almy, David Utter, Barry Zane
  • Publication number: 20060129542
    Abstract: A system from processing database queries allows for cost and locale based distribution for execution of database queries. The database queries are executed on execution engines that provide flexible configuration and overlapping functionality. The system reduces various costs, including elapsed time, required to perform database queries. The system provides processing of a database query using a database catalog comprising database table locality information, record locality information and execution engine information. A query optimizer receives the query and accesses the database catalog to create a query execution plan comprising locality-based database operations. A central database operation processor providing a first execution engine executes the query execution plan by performing at least a portion of the locality-based database operations and distributing at least a portion of the locality-based database operations as a subplan.
    Type: Application
    Filed: January 13, 2006
    Publication date: June 15, 2006
    Inventors: Foster Hinshaw, John Metzger, Barry Zane
  • Publication number: 20050097103
    Abstract: A usage model and the underlying technology used to provide sequence analysis as part of a relational database system. Included components include the semantic and syntactic integration of the sequence analysis with an existing query language, the storage methods for the sequence data, and the design of a multipart execution scheme that runs the sequence analysis as part of a potentially larger database query, especially using parallel execution techniques.
    Type: Application
    Filed: September 17, 2004
    Publication date: May 5, 2005
    Applicant: Netezza Corporation
    Inventors: Barry Zane, Sanjay Dixit, Venkannababu Tammisetti
  • Publication number: 20050091238
    Abstract: A usage model and the underlying technology used to provide sequence analysis as part of a relational database system. Included components include the semantic and syntactic integration of the sequence analysis with an existing query language, the storage methods for the sequence data, and the design of a multipart execution scheme that runs the sequence analysis as part of a potentially larger database join, especially using parallel execution techniques.
    Type: Application
    Filed: September 17, 2004
    Publication date: April 28, 2005
    Applicant: Netezza Corporation
    Inventors: Barry Zane, Sanjay Dixit, Venkannababu Tammisetti
  • Publication number: 20050027701
    Abstract: This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. The present invention provides a method for generating executable machine code for query execution plans, that is adaptive to dynamic runtime conditions, that is compiled just in time for execution and most importantly, that avoids the bounds checking, pointer indirection, materialization and other similar kinds of overhead that are typical in interpretive runtime execution engines.
    Type: Application
    Filed: July 7, 2004
    Publication date: February 3, 2005
    Applicant: Netezza Corporation
    Inventors: Barry Zane, James Ballard, Foster Hinshaw, Dana Kirkpatrick, Premanand Yerabothu
  • Publication number: 20050028134
    Abstract: This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. In one preferred embodiment, the method begins by receiving a subject query, and then forming an execution plan corresponding to the subject query. The execution plan will typically have a sequence of component snippets or pieces and corresponding processes for implementing the pieces. For at least one piece in the plan, the process then (a) generates source code using different code generation techniques as a function of expected runtime processing machine types; and then (b) compiles the generated source code to form machine executable code for implementing the subject query. As a result, the query executed directly as machine executable code thereby avoiding runtime interpretation of the pieces in the execution plan.
    Type: Application
    Filed: July 7, 2004
    Publication date: February 3, 2005
    Applicant: Netezza Corporation
    Inventors: Barry Zane, James Ballard, Foster Hinshaw, Premanand Yerabothu
  • Publication number: 20050022051
    Abstract: A disk is segmented into a first data segment and a secondary data segment. The secondary data segment stores a logical mirror of the first data segment of another disk. Upon detecting a failure, the logical mirror of data stored in the first data segment of the failed disk is accessible from the secondary data segment of a non-failed disk. The first data segment can be rebuilt quickly on another disk from the logical mirror stored in the secondary data segment. During regenerating, accesses to the first data segment on the disk containing the logical mirror are handled by its own logical mirror, which is not involved in the regenerating process.
    Type: Application
    Filed: July 6, 2004
    Publication date: January 27, 2005
    Applicant: Netezza Corporation
    Inventors: Barry Zane, Foster Hinshaw, Philip MacDonald, John Metzger
  • Publication number: 20050010564
    Abstract: A large information space is divided into many smaller information extents. These extents are annotated with statistics about the information they contain. When a search for information includes a restriction based on value, the desired value ranges can be compared to the value ranges of each extent. If the desired value range lies outside the range of the extent, then the extent cannot hold the desired value and does not need to be included in the search.
    Type: Application
    Filed: May 18, 2004
    Publication date: January 13, 2005
    Applicant: Netezza Corporation
    Inventors: John Metzger, Barry Zane, Foster Hinshaw
  • Patent number: 5692847
    Abstract: The improved loose leaf ring binder assembly includes a binder having a central vertical back portion connected to laterally extending wings or side portions which form the front and back covers of the binder. The assembly also includes a vertically extending spine connected to the front surface of the back portion. The spine is in the form of a hollow tube having closed upper and lower ends and containing a spaced pair of vertical rods. The inner ends of half rings are connected to the rods at spaced intervals along the length thereof. The half rings extend laterally outwardly from the rods through openings on opposite sides of the tube. The free ends of the half rings on one side of the tube are adapted to mate with half rings from the opposite side of the tube to form complete rings to releasably hold loose perforated sheets in place in the binder.
    Type: Grant
    Filed: March 19, 1996
    Date of Patent: December 2, 1997
    Inventors: Barry Zane, Claus Hofmann
  • Patent number: 5503486
    Abstract: The improved notebook and notebook cover assembly of the present invention includes a notebook, preferably of a loose-leaf type, and a sub-assembly which includes front and rear notebook covers, an edge binder interconnecting the two covers and foldable back upon itself, and a notebook connector releasably interconnecting the notebook only to the covers. Due to the edge binder the covers are movable between a first position wherein the front cover overlies and protects the notebook and a second position wherein the front cover is behind and flat against the rear cover, thus fully exposing the notebook and supporting it in a flat position for easy viewing and writing therein. The edge binder can have a longitudinal fold line along the length of the center line of the central portion thereof, or can be divided along that center line into two halves joined together by a hinge, such as a piano hinge or a flexible strip of plastic, cloth, paper or rubber.
    Type: Grant
    Filed: March 7, 1994
    Date of Patent: April 2, 1996
    Inventor: Barry Zane