Results 221 to 230 of about 4,762 (250)

Efficient Compilation of Regular Path Queries

Datenbank-Spektrum, 2020
Ad hoc code generation is a state-of-the-art processing paradigm for database execution engines. It minimizes resource consumption by generating specialized code, tailored and streamlined for the single query at hand. In this work, we apply ad hoc code generation to regular path queries (RPQs), an advanced query type in declarative graph query ...
Frank Tetzel, Wolfgang Lehner, Romans Kasperovics   +2 more
openaire   +1 more source

Universal Regular Path Queries

Higher-Order and Symbolic Computation, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
De Moor, O, Lacey, David, Van Wyk, E
openaire   +3 more sources

Reasoning on regular path queries

ACM SIGMOD Record, 2003
Current information systems are required to deal with more complex data with respect to traditional relational data. The database community has already proposed abstractions for these kinds of data, in particular in terms of semistructured data models.
Diego Calvanese, DE GIACOMO, Giuseppe, LENZERINI, Maurizio, Moshe Y. Vardi   +3 more
openaire   +2 more sources

Expressiveness and static analysis of extended conjunctive regular path queries [PDF]

Journal of Computer and System Sciences, 2013
We study the expressiveness and the complexity of static analysis of extended conjunctive regular path queries (ECRPQs), introduced by Barceló et al. (2010) [3].
Dominik D Freydenberger
exaly   +2 more sources

Solving Regular Path Queries

2002
Regular path queries are a way of declaratively specifying program analyses as a kind of regular expressions that are matched against paths in graph representations of programs. These and similar queries are useful for other path analysis problems as well.
Yanhong A. Liu, Fuxiang Yu
openaire   +1 more source

Answering regular path queries through exemplars

Proceedings of the VLDB Endowment, 2021
Regular simple path query (RPQ) is one of the fundamental operators in graph analytics. In an RPQ, the input is a graph, a source node and a regular expression. The goal is to identify all nodes that are connected to the source through a simple path whose label sequence satisfies the given regular expression. The regular expression acts as
Komal Chauhan, Kartik Jain, Sayan Ranu, Srikanta Bedathur, Amitabha Bagchi   +4 more
openaire   +1 more source

Multiple-Query Optimization of Regular Path Queries

2017 IEEE 33rd International Conference on Data Engineering (ICDE), 2017
Graph databases have become increasingly important with the rise of social networks, and with the growth of the Semantic Web and characterization of biological networks. Regular path queries (RPQs) are a way to explore path patterns in graphs which have become a standard method to explore graph databases.
openaire   +1 more source

View-based query processing for regular path queries with inverse

Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00, 2000
View-based query processing is the problem of computing the answer to a query based on a set of materialized views, rather than on the raw data in the database. The problem comes in two different forms, called query rewriting and query answering, respectively.
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi   +3 more
openaire   +1 more source

Universal provenance for regular path queries

Proceedings of the 14th International Workshop on the Theory and Practice of Provenance, 2022
Gösta Grahne, Tianyi Liu, Nematollaah Shiri   +2 more
openaire   +1 more source

PAIRPQ: An Efficient Path Index for Regular Path Queries on Knowledge Graphs

Lecture Notes in Computer Science, 2021
Baozhu Liu, Xiaofei Wang, Pengkai Liu
exaly