Sentence examples for patterns queries from inspiring English sources

"The user needs to monitor the device – expected traffic patterns, queries, expected operation – and manage the entire lifecycle of the application or device.

RDF knowledge graphs are typically searched using triple-pattern queries.

As remarked earlier, such pattern queries are intractable and expensive.

Non-redundant patterns correspond to minimal tree pattern queries [1] in tree databases.

Consider graph pattern queries Q defined in terms of subgraph isomorphism.

(2) We focus on graph pattern queries, beyond set regular expressions [50] and rules of [98].

We next provide more insight into bounded evaluation of graph pattern queries.

As remarked earlier, these algorithms are already available for graph pattern queries (Sect. 3.1 and [27]).

With this complexity bound, an algorithm for deciding the bounded evaluability of graph pattern queries is given in [15].

(1) Under a couple of hundreds of access constraints, more than 60% of pattern queries are boundedly evaluable.

Our framework extends both the searched knowledge graph and triple-pattern queries with keywords to allow users to form a wider range of queries.