Results 211 to 220 of about 4,762 (250)

Pattern matching with Elastic-Degenerate strings and Elastic-Founder graphs. [PDF]

Algorithms Mol Biol
Ascone R, Bernardini G, Conte A, Equi M, Gabory E, Grossi R, Pisanti N.   +6 more
europepmc   +1 more source

Enhancing supermarket robot interaction: an equitable multi-level LLM conversational interface for handling diverse customer intents. [PDF]

Front Robot AI
Nandkumar C, Peternel L.
europepmc   +1 more source

CMRA-DETR: a lightweight and high-accuracy detection framework for MRI-based brain tumor identification. [PDF]

Front Med (Lausanne)
Weng C, Huang B, Chen J, Hu W, Huang Z, Weng P, Zhao H, Zheng M.   +7 more
europepmc   +1 more source

Parametric regular path queries

ACM SIGPLAN Notices, 2004
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds of queries: existential queries, which specify properties about individual paths, and universal queries, which specify properties about all paths.
Yanhong A Liu, Liuyanhong A
exaly   +5 more sources

Regular Path Queries on Massive Graphs

Proceedings of the 28th International Conference on Scientific and Statistical Database Management, 2016
Regular Path Queries (RPQs) represent a powerful tool for querying graph databases and are of particular interest, because they form the building blocks of other query languages, and because they can be used in many theoretical or practical contexts for different purposes.In this paper we present a novel system for processing regular path queries on ...
Maurizio Nolé, Carlo Sartiani
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Dichotomies for Evaluating Simple Regular Path Queries

ACM Transactions on Database Systems, 2019
Regular path queries (RPQs) are a central component of graph databases. We investigate decision and enumeration problems concerning the evaluation of RPQs under several semantics that have recently been considered: arbitrary paths, shortest paths, paths without node repetitions (simple paths), and paths without edge repetitions (trails).
Martenswim
exaly   +3 more sources

Fault-tolerant computation of distributed regular path queries

Theoretical Computer Science, 2009
Regular path queries are the building blocks of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path ...
Alex Thomo
exaly   +2 more sources

Preferential Regular Path Queries

Fundamenta Informaticae, 2008
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down the intrinsic importance of matching a symbol against a (semistructured) database edge label.
Gösta Grahne, Alex Thomo, William W. Wadge   +2 more
openaire   +3 more sources