Home | Links | Contact Us | More About Intellectual Property | Bookmark
Search patents:
Home Databases Reduced-memory-row-hash-match-scan-join-for-a-partitioned-database-system

 Method, system, and article of manufacture for transferring structured data between different data stores
OF THE PREFERRED EMBODIMENTS In the following description, reference is made to the accompanying ...


 Method and apparatus for reformatting of content for display on interactive television
The present invention addresses the needs of the interactive television environment discussed above....


 Method and system for accessing a collection of images in a database
OF THE PREFERRED EMBODIMENTS FIGS. 1, 2 and 3 are flowcharts illustrating the steps carried out ...


 Method and apparatus for evaluating relevancy of messages to users
In one aspect, a system is provided for evaluating the relevancy of an incoming message to a ...


 System and method for implementing a transaction log
The present invention satisfies the above-described needs by using a chronological list ...


 Method and apparatus for transforming data
Systems implementing the invention provide users with a set of tools for transforming data from ...


 Providing access to user interface elements of legacy application programs
An architecture is provided that enables an accessibility aid to directly access and manipulate ...


 Translation of object queries involving inheritence
Join expressions, expressed in terms of objects, are translated into a relational database join ...


 Method for accessing a memory unit in which sequences of notes are stored, corresponding memory unit and corresponding program
According to an aspect of the present invention, there is provided a simple method for accessing a ...


 Development system with application browser user interface
The present invention is embodied in a component-based, rapid application development (RAD) Java ...


 Reduced memory row hash match scan join for a partitioned database system

Details
Inventors: Sinclair, Paul Laurence; Chiang, Kuorong;
Assignee: NCR Corporation (Dayton, OH)
Primary Examiner: Kindred; Alford
Assistant Examiner:
Attorney, Agent or Firm: Baker Botts LLP

A method, computer system, and computer program are claimed for selecting rows from first and second tables each having rows containing values in columns. In at least the first table, the rows are divided into partitions at least one of which is populated by one or more rows. The method, computer system, and computer program include (a) defining a subset of the populated partitions of the first table that excludes at least one populated partition of the first table, (b) creating a file context, which stores at least location data for a row and a first value associated with the row, for each populated partition in the subset of the populated partitions of the first table, (c) determining the lowest first value stored by the file contexts for the first table, (d) identifying rows with a particular first value by at least reading the file contexts of the first table, and (e) repeating a through d until the subsets of the populated partitions of the first table have included all the populated partitions of the first table.

DETAILED DESCRIPTION The partitioned table storage technique disclosed herein has particular application, but is not limited, to large databases that might contain many millions or billions of records managed by a database system ("DBS") 100, such as a Teradata Active Data Warehousing System available from NCR Corporation.
FIG.
1 shows a sample architecture for one node 105.
sub.
1 of the DBS 100.
The DBS node 105.
sub.
1 includes one or more processing modules 110.
sub.
1 .
.
.
N, connected by a network 115, that manage the storage and retrieval of data in data-storage facilities 120.
sub.
1 .
.
.
N.
Each of the processing modules 110.
sub.
1 .
.
.
N may be one or more physical processors or each may be a virtual processor, with one or more virtual processors running on one or more physical processors.
For the case in which one or more virtual processors are running on a single physical processor, the single physical processor swaps between the set of N virtual processors.
For the case in which N virtual processors are running on an M-processor node, the node's operating system schedules the N virtual processors to run on its set of M physical processors.
If there are 4 virtual processors and 4 physical processors, then typically each virtual processor would run on its own physical processor.
If there are 8 virtual processors and 4 physical processors, the operating system would schedule the 8 virtual processors against the 4 physical processors, in which case swapping of the virtual processors would occur.
Each of the processing modules 110.
sub.
1 .
.
.
N manages a portion of a database that is stored in a corresponding one of the data-storage facilities 120.
sub.
1 .
.
.
N.
Each of the data-storage facilities 120.
sub.
1 .
.
.
N includes one or more disk drives.
The DBS may include multiple nodes 105.
sub.
2 .
.
.
N in addition to the illustrated node 105.
sub.
1, connected by extending the network 115.
The system stores data in one or more tables in the data-storage facilities 120.
sub.
1 .
.
.
N.
The rows 125



Related patents
  Method and apparatus for partitioning data for storage in a database
In the following description, numerous details are set forth to provide an understanding of the present invention. However, it will be understood by those skilled in ...
  Apparatus for generating sales probability
The present invention is a method and apparatus for generating accurate sales probabilities. The apparatus, a sales probability generator, comprises a general purpose ...
  Method for managing concurrent access to virtual memory data structures
Broadly speaking, the present invention fills these needs by providing methods for managing concurrent access to the kernel data structures for a virtual page in memory. ...
  Pledge-based resource allocation system
A pledge-based resource allocation system for a client/server environment is provided. In this system, resources, such as database objects, are allocated to clients for ...
  Performance of table insertion by using multiple tables or multiple threads
To overcome the limitations in the prior art described above, and to overcome other limitations that will become apparent upon reading and understanding the present ...
  Replaceable classes and virtual constructors for object-oriented programming languages
In view of the foregoing, the present invention provides a new approach and language extension to object-oriented programming that uses replaceable classes and virtual ...
  String predicate selectivity estimation
Exemplary Operating Environment FIG. 1 and the following discussion are intended to provide a brief, general description of a suitable computing environment in which ...
  Dynamic generation of user interface components
An embodiment of the invention is discussed in detail below. While specific implementations of the invention are discussed, it should be understood that this is done ...
  System for allocating resources in a computer system
Problems associated with the manual installation and configuration of adapter boards and peripheral devices for computers are solved by the principles of the present ...
  High speed data transfer between mainframe storage systems
The present invention relates to a method and associated systems for transferring data between mainframe storage devices. While the invention is suitable for remote dual ...

0.014

Archive: All patents - Links

Copyright (c)2006 Eipa-patents.org - All rights reserved