Micro Focus Lcc

Entit Software LLC

Hewlett-packard Development Company, L.p.

Malu G Castellanos

Meichun Hsu

Qiming Chen

Rui Liu

Jeff Lefevre

A system and method for a text search of a database, including converting a text search expression to a query plan and implementing the text search as the query plan on the database. The implementing of the text search includes a one-pass indexing as a single scan of an inverse index table associated with the database.

Text search of database with one-pass indexing

In one example in accordance with the present disclosure, a method may include separating a list of keywords into a set of word tokens and a set of wildcard tokens. The method may also include removing each wildcard token in the set of wildcard tokens that is inferred by at least one word token in the set of word tokens and removing each wildcard token in the set of wildcard tokens that is inferred by at least one other wildcard token in the set of wildcard tokens. The method may also include executing a search query comprising a new list of keywords that includes each wildcard token not removed from the set of wildcard tokens.

Removing wildcard tokens from a set of wildcard tokens for a search query

A system includes a database client, and a distributed database comprising database nodes. The distributed database may receive a database query from the client, determine that the query comprises a range of hash values of a table partition stored by a node of the distributed database, and determine that the range of hash values is not stored by other nodes of the distributed database. Responsive to determining that the range of hash values of the query is stored by the node and not by the other nodes, the database may generate an optimized distributed execution plan that includes the node that stores the range of hash values and excludes the nodes that do not include the range of hash values.

Queries based on ranges of hash values

A system and method for a text search of a database. A text search expression is converted to a query plan having multiple search tokens. A one-pass indexing of an invested word index filters the inverted word index based on a search condition and identifies the applicable documents having the multiple search tokens.

Text search of database with one-pass indexing including filtering

In one example in accordance with the present disclosure, a method for dynamic lexer object construction includes receiving a grammar rule including a variable and a Boolean function to be performed on a character sequence using the variable. The method includes receiving the character sequence and a value corresponding to the character sequence and constructing a lexer object that includes the value as the variable used by the Boolean function. The method includes parsing the character sequence using the lexer object.

Dynamic lexer object construction

A technique includes in a relational database query engine, receiving a query associated with a relational data structure. The received query includes a database graph query. The technique includes using the relational database query engine to integrate a result acquired from the graph database engine into a result provided by the relational database query engine to the received query.

Searching relational and graph databases

A method for categorizing documents is disclosed. The words composing the documents are tagged according to their parts of speech. A first group of features is selected corresponding to one of the parts of speech. The documents are grouped into clusters according to their semantic affinity to the first set of features and to each other. The clusters are refined into a hierarchy of progressively refined clusters, the features of which are selected based on corresponding parts of speech.

Growing community of inventors

Sunnyvale, CA, United States of America

Malu G Castellanos