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 20 of 42 for “"Path Queries"”.

  1. Path Queries in Weighted Trees

    … assigned a weight, in order to support various path queries, for which a certain function over the weights of the nodes along a given query path in the tree is computed [3, 14, 22, 26]. In this thesis, we consider the problem of supporting several various path queries over a tree on n weighted …

    waterloo Repository record for Path Queries in Weighted Trees (opens in a new tab)

  2. 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 …

    uvic Repository record for Distributed multi-source regular path queries (opens in a new tab)

  3. Learning hypertrees with shortest path queries

    … for learning discrete structured objects from queries. In this context, we consider the problem of learning a labeled hypergraph from a given family of hypergraphs using shortest path (SP) queries. An SP query specifies two vertices and asks for their distance in the target hypergraph. For …

    regina Repository record for Learning hypertrees with shortest path queries (opens in a new tab)

  4. Shortest Path Queries in Very Large Spatial Databases

    Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more efficient …

    waterloo Repository record for Shortest Path Queries in Very Large Spatial Databases (opens in a new tab)

  5. Optimal Path Queries in Very Large Spatial Databases

    … query problem for a long time. Optimal route queries are categorized as either unconstrained or constrained queries. Many main memory based algorithms have been developed to deal with the optimal route query problem. Among these, Dijkstra's shortest path algorithm is one of the most popular …

    waterloo Repository record for Optimal Path Queries in Very Large Spatial Databases (opens in a new tab)

  6. 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. …

    york Repository record for Optimization of Regular Path Queries in Graph Databases (opens in a new tab)

  7. Efficient processing of XML path queries with not-predicates

    <P>THE EVALUATION OF PATH QUERIES FORMS THE BASIS OF COMPLEX XML QUERY PROCESSING WHICH HAS ATTRACTED A LOT OF RESEARCH ATTENTION. HOWEVER, NONE OF THESE WORKS HAVE EXAMINED THE PROCESSING OF MORE COMPLEX QUERIES THAT CONTAIN NOT-PREDICATES. IN THIS PAPER, WE PRESENT THE FIRST STUDY ON EVALUATING …

    nus Repository record for Efficient processing of XML path queries with not-predicates (opens in a new tab) Download file for Efficient processing of XML path queries with not-predicates (opens in a new tab)

  8. Shortest path queries on polyhedral sufaces and in polygonal domains

    … we present algorithmic solutions to shortest path queries on polyhedral surfaces and in polygonal domains. The research problems addressed in this thesis and shortest path problems in general are fundamental problems in geographic information systems (GIS) and computational geometry.We present …

    carleton Repository record for Shortest path queries on polyhedral sufaces and in polygonal domains (opens in a new tab)

  9. 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 …

    uvic Repository record for Grid-aware evaluation of regular path queries on large Spatial networks (opens in a new tab)

  10. 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 …

    brazil-ufrn Repository record for Improvements on graph path queries: expression, evaluation, and minimum-weight satisfiability (opens in a new tab)

  11. 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. …

    uvic Repository record for Towards practically feasible answering of regular path queries in LAV data integration (opens in a new tab)

  12. Computing Paths in Massive Graphs

    … entities and their relationships. Graph queries play an important role in the processing of graphs, and path queries are one of the most important types of query operations on graphs. A path query attempts to retrieve the path from one vertex to another, and has numerous real-world …

    uts Repository record for Computing Paths in Massive Graphs (opens in a new tab)

  13. Succinct Data Structures for Chordal Graphs

    We study the problem of approximate shortest path queries in chordal graphs and give a n log n + o(n log n) bit data structure to answer the approximate distance query to within an additive constant of 1 in O(1) time. We study the problem of succinctly storing a static chordal graph to answer …

    waterloo Repository record for Succinct Data Structures for Chordal Graphs (opens in a new tab)

  14. Efficient Path Enumeration and Structural Clustering on Massive Graphs

    … analysis, including hop-constrained s-t simple path (HC-s-t path) enumeration, batch HC-s-t path query processing, and graph structural clustering (SCAN). The objective is to develop efficient and scalable distributed algorithms to tackle these challenges, particularly in the context of …

    unsw Repository record for Efficient Path Enumeration and Structural Clustering on Massive Graphs (opens in a new tab)

  15. Design of a Scalable Path Service for the Internet

    … infrastructure, and users understandably want paths with sufficient quality-of-service (QoS) to improve the performance of their applications. As a result, users resort to various “hacks” such as sending traffic through intermediate end-systems, and the providers fight back with mechanisms to …

    uky-thes Repository record for Design of a Scalable Path Service for the Internet (opens in a new tab)

  16. Optimization Techniques for Graph Databases: Challenges and Approaches

    … such as how to evaluate complex graph queries. The evaluation of conjunctive graph queries can face great computational redundancy due to the "many-to-many" joins with the graph, which can degrade the performance drastically. Another challenge is that when running queries in batches, …

    toronto-retro Repository record for Optimization Techniques for Graph Databases: Challenges and Approaches (opens in a new tab)

  17. Compact Routing on Planar Graphs

    … thesis delves into the exploration of shortest path queries in planar graphs, with an emphasis on the utilization of space-efficient data structures. Our investigation primarily targets connected, undirected, static pointer planar graphs, focusing on scenarios where queries predominantly start …

    waterloo Repository record for Compact Routing on Planar Graphs (opens in a new tab)

  18. Searching and mining in enriched geo-spatial data

    … major issues arising in that field, namely path queries using multi-enriched data, trend mining in social media data, and handling uncertainty in geo-spatial data. In all cases, the developed methods have made significant contributions and have appeared in or were accepted into various …

    lmu-germany Repository record for Searching and mining in enriched geo-spatial data (opens in a new tab)

  19. Semantics and efficient evaluation of partial tree-pattern queries on XML

    … web. Usually, XML data are queried using keyword queries or using the standard structured query language XQuery the core of which consists of the navigational query language XPath. In this context, one major challenge is the querying of the data when the structure of the data sources is complex or …

    njit Repository record for Semantics and efficient evaluation of partial tree-pattern queries on XML (opens in a new tab)

Page 1 of 3