Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"Regular Path"”.
-
Distributed multi-source regular path queries
Regular path queries are the building block 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 queries. In this thesis we present a …
-
Optimization of Regular Path Queries in Graph Databases
Regular path queries offer a powerful navigational mechanism in graph databases. Recently, there has been renewed interest in such queries in the context of the Semantic Web. The extension of SPARQL in version 1.1 with property paths offers a type of regular path query for RDF graph databases. …
-
Grid-aware evaluation of regular path queries on large Spatial networks
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. RPQs are the basic building block of almost all the query languages for graph databases, providing the user with a nice and simple way …
-
Towards practically feasible answering of regular path queries in LAV data integration
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have recently received great attention in the context of semistructured data, which are data whose structure is irregular, partially known, or subject to frequent changes. …
-
Improvements on graph path queries: expression, evaluation, and minimum-weight satisfiability
We deal with three problems related to graph path queries. Most current graph query languages support regular path queries. However, some applications such as source-code analysis and genetics require context-free path queries. Context-free path queries use context-free languages. There is no …
-
Variations on PIGS: Non-standard approaches for imaginary-time path integrals
… We show that using the simple estimator with the regular Path Integral Ground State (PIGS) distribution is not effective, but a superior estimator exists so long as one has access to other configuration sectors. To this end, we implement the ability to explore different sectors in the Molecular …
-
Query processing using views in semistructured databases
… from the views for the purpose of optimizing regular path queries, which are the building block of all the query languages for semistructured data.
-
Database-Inspired Reasoning Problems in Description Logics With Path Expressions
… such as positive conjunctive two-way regular path queries being employed as a fundamental querying formalism. The most expressive exemplars of description logics feature advanced constructors for roles and path expressions. Among the most powerful knowledge representation formalisms on …
-
Decentralized Social Data Sharing
… for efficient query processing. We show that Regular Path Queries, a useful class of graph queries, can still be processed on the shared data: although in the worst case such queries are intractable, we propose a cost estimation technique to identify tractable queries from partial knowledge of …
-
Automata methods and techniques for graph-structured data
… on GSD in a distributed environment. We focus on regular path queries (RPQs) – given by regular expressions matching paths in graph-data. RPQs are the building blocks of almost any mechanism for querying GSD. We present a fault-tolerant, message-efficient, and truly distributed algorithm for …
-
Evaluation and Enumeration of Regular Simple Path and Trail Queries
Regular path queries (RPQs) are an essential component of graph query languages. Such queries consider a regular expression r and a directed edge-labeled graph G and search for paths in G for which the sequence of labels is in the language of r. In order to avoid having to consider infinitely many …
-
On managing visibility of resources in social networking sites
… they are identified by the owner nodes and regular path expressions. The users can issue queries for discovering resources, e.g., “Find all lawnmowers in my three degree network that are visible to me”. The evaluation process needs to check all candidate resources to see if they are visible …