Results 21 to 30 of about 4,762 (250)
Sensors, 2019 Exploring large, unknown, and unstructured environments is challenging for Unmanned Aerial Vehicles (UAVs), but they are valuable tools to inspect large structures safely and efficiently.
Margarida Faria +4 more
doaj +1 more source
Answering regular path queries on workflow provenance [PDF]
2015 IEEE 31st International Conference on Data Engineering, 2015 This paper proposes a novel approach for efficiently evaluating regular path queries over provenance graphs of workflows that may include recursion. The approach assumes that an execution g of a workflow G is labeled with query-agnostic reachability labels using an existing technique.
Xiaocheng Huang +4 more
openaire +2 more sources
Path querying on acyclic graphs using Boolean grammars
Труды Института системного программирования РАН, 2019 Graph data models are widely used in different areas of computer science such as bioinformatics, graph databases, social networks and static code analysis. One of the problems in graph data analysis is querying for specific paths.
Ekaterina Nikolaevna Shemetova +1 more
doaj +1 more source
Answering regular path queries using views [PDF]
Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073), 2002 Query answering using views amounts to computing the answer to a query having information only on the extension of a set of views. This problem is relevant in several fields, such as information integration, data warehousing, query optimization, mobile computing, and maintaining physical data independence.
CALVANESE D. +3 more
openaire +2 more sources
Regular Path Queries on Large Graphs [PDF]
, 2012 The significance of regular path queries (RPQs) on graph-like data structures has grown steadily over the past decade. RPQs are, often in restricted forms, part of graph-oriented query languages such as XQuery/XPath and SPARQL, and have applications in areas such as semantic, social, and biomedical networks.
André Koschmieder, Ulf Leser
openaire +1 more source
TASWEET : optimizing disjunctive regular path queries in graph databases [PDF]
, 2017 Regular path queries (RPQs) have quickly become a staple to explore graph databases. SPARQL 1.1 includes prop- erty paths, and so now encompasses RPQs as a fragment. Despite the extreme utility of RPQs, it can be exceedingly difficult for even experts to
Orlando, Salvatore +10 more
core +2 more sources
Preferentially Annotated Regular Path Queries [PDF]
, 2006 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 +2 more
openaire +1 more source
Path Queries on Compressed XML
, 2003 Central to any XML query language is a path language such as XPath which operates on the tree structure of the XML document. We demonstrate in this paper that the tree structure can be effectively compressed and manipulated using techniques derived from ...
Buneman, Peter; id_orcid +5 more
core +1 more source
Enumeration Problems for Regular Path Queries
CoRR, 2017 Evaluation of regular path queries (RPQs) is a central problem in graph databases. We investigate the corresponding enumeration problem, that is, given a graph and an RPQ, enumerate all paths in the graph that match the RPQ. We consider several versions of this problem, corresponding to different semantics of RPQs that have recently been considered ...
Wim Martens, Tina Trautner
openaire +2 more sources
Performance Guarantees for Distributed Reachability Queries [PDF]
, 2012 In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs.
Wang, Xin +2 more
core