The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
This invention describes how existing vector feature (VF) machines, such as the IBM 3090VF, can be used for achieving enhanced query processing performance against relational data bases.
English (United States)
This text was extracted from a PDF file.
This is the abbreviated version, containing approximately
52% of the total text.
Page 1 of 2
Query Processing With Existing Vector Feature Machines
This invention describes how existing vector feature (VF) machines, such as
the IBM 3090VF, can be used for achieving enhanced query processing
performance against relational data bases.
In relational data base products, such as SQL/DS and Database 2, data is
stored and retrieved as relations which are commonly viewed as tables. The
tables are comprised of ordered n-tuples of mixed character string and numerical
values belonging to the various domains of the relation. The domains of a
relational table are reflected in its columns, which have names. The n-tuples
make up its rows. Relational tables may also be viewed, from a computational
point of view, as arrays. For query processing purposes, it is useful to view a
relation as an array. The rows and columns of such an array can be treated as
vectors of values to be used as arguments in logical and mathematical
operations. The problem with relational tables is that they are typically ragged
and irregular in computer memory space due to the varying lengths of their
character string and numerical values and are, therefore, not suitable for normal
vector processing. The "stride" parameter which specifies the spacing between
adjacent values of a vector of values has no direct applicability to these irregular
The central idea of this invention is to show how a different storage model for
relational arrays, one that is easily convertible to the familiar form for viewing
purposes, can be used to exploit existing VF machines. The suggested
replacement model consists of a combination of numerical arrays and single-
column arrays of character string domain values stored separately, one such
single-column array for each domain. The numerical arrays are formed by
replacing each character string value in the original mixed arrays by an integer
value. The integer which replaces the character string value is essentially a
pointer which corresponds to the position of the character string value in a single-