Patent FR529006A successfully refreshed from Google Patents.
EP0855656A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method and system for query processing in a relational database
Assignee: International Business Machines Corp
•
Filing: 1998-01-20
•
Granted: —
•
Expires: 2018-01-20
Abstract
Abstract A method and system is presented for constructing and applying a query processing tree to a relational database. The method/system comprises an automated approach for building a vector block of records using data in multiple input records derived from the relational database and then applying at least one vector operator of the query processing tree to the vector block of records. The approach can also include creating the query processing tree to have multiple vector operators. When applying the query processing tree, multiple vector blocks of records may be employed at the same vector operator or different vector operators. A vector descriptor control block associated with a vector block of records is employed to transfer control of the vector block of records from a first vector operator to a second vector operator in the query processing tree. The at least one vector operator in the query processing tree can comprise a table scan operator, a predicate operator, a sort operator, an aggregation operator, a join operator or a math operator.
Inventors
- 👤 Ramesh Chandra Agarwal
- 👤 Anant Deep Jhingran
- 👤 Timothy Ray Malkemus
- 👤 Sriram Kolijivadi Padmanabhan
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-29 01:22
CPC Classifications
G; G06; G06F; G06F17/00; G06F16/00; G06F16/20; G06F16/24; G06F16/245; G06F16/2453; G06F16/24534; G06F16/24539; G06F16/2452; G06F16/24526; G06F16/2455; G06F16/24553; G06F16/24561
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
52 words
A method for applying a query processing tree to a relational
database, said method comprising: (a) building a vector block of records using data in multiple input
records derived from the relational database; and (b) applying at least one vector operator of the query processing
tree to the vector block of records.
Claim 2
Dependent Claim
84 words
The method of claim 1, wherein the at least one vector operator
comprises multiple vector operators, including a first vector operator
and a second vector operator, and wherein said method further comprises
applying the first vector operator of the query processing tree to the
vector block of records, passing control of the vector block of records
from the first vector operator to the second vector operator, and then
applying the second vector operator of the query processing tree to the
vector block of records.
Claim 3
Dependent Claim
23 words
The method of claim 1 or 2, wherein said vector block of records
building step (a) is accomplished by said first vector operator.
Claim 4
Dependent Claim
70 words
The method of claim 2, wherein said building of the vector block
of records includes employing a vector descriptor as a control block for
accessing the vector block of records, and wherein said passing control
of the vector block of records from the first vector operator to the
second vector operator comprises passing access to the vector descriptor
control block from the first vector operator to the second vector
operator.
Claim 5
Dependent Claim
40 words
The method of claim 4, wherein said building step (a) comprises
building a vector block of records to have multiple vector records, and
building at least one output record for the multiple vector records of
the vector block or records.
Claim 6
Dependent Claim
39 words
The method of claim 5, wherein the vector block of records of said
building step (a) includes a column for a pointer to the at least one
output record and multiple columns containing data from the multiple
input records.
Claim 7
Independent Claim
20 words
The method of any of claims 1 to 6, further comprising
preallocating memory at compile time for the vector block.
Claim 8
Independent Claim
40 words
The method of any of claims 1 to 7 wherein the at least one vector
operator comprises at least one of a scan operator, a predicate
operator, a sort operator, an aggregation operator, a join operator and
a math operator.
Claim 9
Independent Claim
27 words
The method of any of claims 1 to 8 further comprising
accomplishing said steps (a) & (b) at any point in processing of the
query processing tree.
Claim 10
Independent Claim
82 words
The method of any of claims 1 to 9 wherein said building step (a)
comprises building n additional vector blocks of records, wherein n > 1,
using data from multiple input records derived from the relational
database, and wherein said at least one vector operator of said applying
step (b) comprises multiple vector operators, each vector operator of
said multiple vector operators being applied to at least one of the
vector block of records and the n additional vector blocks of records.
Claim 11
Independent Claim
44 words
A method for processing a relational database, said method
comprising: (a) creating a query processing tree with at least one vector
operator; and (b) applying the at least one vector operator to a vector block of
records derived from data in the relational database.
Claim 12
Independent Claim
67 words
A method for processing a query tree in a relational database,
said method comprising: (a) applying a first vector operator of the query tree to a vector
block of records derived from data in the relational database; and (b) subsequent to said applying step (a), applying a second vector
operator of the query tree to the vector block of records derived from
data in the relational database.
Claim 13
Independent Claim
55 words
A system for applying a query processing tree to a relational
database, said system comprising: means for building a vector block of records using data from in
multiple input records derived from the relational database; and means for applying at least one vector operator of the query
processing tree to the vector block or records.
Claim 14
Dependent Claim
60 words
The system of claim 13, wherein said vector block of records
comprises multiple columns, at least one column of said multiple columns
containing pointers to output records for vector records of the vector
block of records, and wherein said means for building further comprises
means for building the output records for the vector records of the
vector block of records.
Claim 15
Dependent Claim
95 words
A computer program product comprising a computer usable medium
having computer readable program code means therein for use in applying
a query processing tree to a relational database, said computer
readable program code means in said computer program product comprising: computer readable program code means for causing a computer to
effect building of a vector block of records using data from multiple
input records derived from the relational database; and computer readable program code means for effecting applying of at
least one vector operator of the query processing tree to the vector
block of records.
Claim 16
Dependent Claim
108 words
The computer readable program code means of claim 15, wherein the
at least one vector operator comprises multiple vector operators,
including a first vector operator and a second vector operator, and
wherein said computer readable program code means for effecting applying
of the at least one vector operator comprises computer readable program
code means for effecting applying of the first vector operator of the
query processing tree to the vector block of records, passing control of
the vector block of records from the first vector operator to the
second vector operator, and applying the second vector operator of the
query processing tree to the vector block of records.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.