com.datastax.dse.driver.api.core.graph.predicates

Interface Search

public interface Search

Method Summary

Modifier and Type	Method and Description
static P<Object>	fuzzy(String query, int distance) Supports fuzzy searches based on the Damerau-Levenshtein Distance, or Edit Distance algorithm (case sensitive).
static P<Object>	phrase(String query, int distance) Supports finding words which are a within a specific distance away (case insensitive).
static P<Object>	prefix(String value) Search for a specific prefix at the beginning of the text property targeted (case sensitive).
static P<Object>	regex(String value) Search for this regular expression inside the text property targeted (case sensitive).
static P<Object>	token(String value) Search any instance of a certain token within the text property targeted (case insensitive).
static P<Object>	tokenFuzzy(String query, int distance) Supports fuzzy searches based on the Damerau-Levenshtein Distance, or Edit Distance algorithm after having tokenized the data stored (case insensitive).
static P<Object>	tokenPrefix(String value) Search any instance of a certain token prefix within the text property targeted (case insensitive).
static P<Object>	tokenRegex(String value) Search any instance of the provided regular expression for the targeted property (case insensitive).

Method Detail

token

static P<Object> token(String value)

Search any instance of a certain token within the text property targeted (case insensitive).

Returns:

a predicate to apply in a GraphTraversal.

tokenPrefix

static P<Object> tokenPrefix(String value)

Search any instance of a certain token prefix within the text property targeted (case insensitive).

Returns:

a predicate to apply in a GraphTraversal.

tokenRegex

static P<Object> tokenRegex(String value)

Search any instance of the provided regular expression for the targeted property (case insensitive).

Returns:

a predicate to apply in a GraphTraversal.

prefix

static P<Object> prefix(String value)

Search for a specific prefix at the beginning of the text property targeted (case sensitive).

Returns:

a predicate to apply in a GraphTraversal.

regex

static P<Object> regex(String value)

Search for this regular expression inside the text property targeted (case sensitive).

Returns:

a predicate to apply in a GraphTraversal.

phrase

static P<Object> phrase(String query,
                        int distance)

Supports finding words which are a within a specific distance away (case insensitive).

Example: the search expression is phrase("Hello world", 2)

• the inserted value "Hello world" is found
• the inserted value "Hello wild world" is found
• the inserted value "Hello big wild world" is found
• the inserted value "Hello the big wild world" is not found
• the inserted value "Goodbye world" is not found.

Parameters:

query - the string to look for in the value

distance - the number of terms allowed between two correct terms to find a value.

Returns:

a predicate to apply in a GraphTraversal.

fuzzy

static P<Object> fuzzy(String query,
                       int distance)

Supports fuzzy searches based on the Damerau-Levenshtein Distance, or Edit Distance algorithm (case sensitive).

Example: the search expression is fuzzy("david", 1)

• the inserted value "david" is found
• the inserted value "dawid" is found
• the inserted value "davids" is found
• the inserted value "dewid" is not found

Parameters:

query - the string to look for in the value

distance - the number of "uncertainties" allowed for the Levenshtein algorithm.

Returns:

a predicate to apply in a GraphTraversal.

tokenFuzzy

static P<Object> tokenFuzzy(String query,
                            int distance)

Supports fuzzy searches based on the Damerau-Levenshtein Distance, or Edit Distance algorithm after having tokenized the data stored (case insensitive).

Example: the search expression is tokenFuzzy("david", 1)

• the inserted value "david" is found
• the inserted value "dawid" is found
• the inserted value "hello-dawid" is found
• the inserted value "dewid" is not found

Parameters:

query - the string to look for in the value

distance - the number of "uncertainties" allowed for the Levenshtein algorithm.

Returns:

a predicate to apply in a GraphTraversal.