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 25 for “"Graph pattern"”.

  1. Dense graph pattern mining and visualization

    A graph is an intuitive abstraction that naturally captures data entities as well as the relationships among those entities. It embeds complicated entity relationships more succinctly, compared with the tabular representation in relational databases. With the power of intuition and succinctness, …

    nus Repository record for Dense graph pattern mining and visualization (opens in a new tab) Download file for Dense graph pattern mining and visualization (opens in a new tab)

  2. Graph Pattern Matching on Symmetric Multiprocessor Systems

    Graph-structured data can be found in nearly every aspect of today's world, be it road networks, social networks or the internet itself. From a processing perspective, finding comprehensive patterns in graph-structured data is a core processing primitive in a variety of applications, such as fraud …

    qucosa-diss

  3. Using materialized views for answering graph pattern queries

    <p>Discovering patterns in graphs by evaluating graph pattern queries involving direct (edge-to-edge mapping) and reachability (edge-to-path mapping) relationships under homomorphisms on data graphs has been extensively studied. Previous studies have aimed to reduce the evaluation time of graph …

    njit Repository record for Using materialized views for answering graph pattern queries (opens in a new tab)

  4. Efficient algorithms and system implementations for graph pattern matching

    Graphs are a powerful abstraction for modeling complex relationships in domains ranging from social networks and recommendation systems to fraud detection and biological systems. As real-world graphs grow in size and evolve over time, efficient algorithms for subgraph querying become critical. This …

    colo-mines Repository record for Efficient algorithms and system implementations for graph pattern matching (opens in a new tab) Embargoed until 2027-08-20

  5. Efficient and Scalable Graph Pattern Matching on Massive Graphs

    … decade has witnessed the emergence of massive graph data. Graph is an important data structure containing vertices and edges that can be used to model complex relationships among entities in real-life applications. In this thesis, we study the fundamental problem of graph pattern matching in …

    unsw Repository record for Efficient and Scalable Graph Pattern Matching on Massive Graphs (opens in a new tab)

  6. Accelerating graph pattern mining algorithms on modern graphics processing units

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms

    uiuc Repository record for Accelerating graph pattern mining algorithms on modern graphics processing units (opens in a new tab)

  7. Automating investigative pattern detection using machine learning & graph pattern matching techniques

    … and analysis of latent and emergent behavioral patterns are core tasks in investigative domains such as homeland security, counterterrorism, and crime prevention. Development of behavioral trajectory models associated with radicalization and tracking individuals and groups based on such …

    colostate Repository record for Automating investigative pattern detection using machine learning & graph pattern matching techniques (opens in a new tab)

  8. Sketching as a Tool for Efficient Networked Systems

    … processing systems are deployed to support graph analytics. To fulfill the requirements of handling such large datasets, we build efficient networked systems in a distributed manner most of the time. Ideally, we expect the systems to meet service-level objectives (SLOs) using the least …

    jhu Repository record for Sketching as a Tool for Efficient Networked Systems (opens in a new tab)

  9. EFFICIENT SUBGRAPH MINING AND DISCOVERY ON MASSIVE GRAPHS

    Subgraph finding is critical for analyzing complex networks but faces significant challenges regarding scalability, temporal dynamics, and the integration of node attributes. This thesis addresses these limitations through three novel systems. First, we introduce BLITZ, a high-performance graph …

    nus Repository record for EFFICIENT SUBGRAPH MINING AND DISCOVERY ON MASSIVE GRAPHS (opens in a new tab) Download file for EFFICIENT SUBGRAPH MINING AND DISCOVERY ON MASSIVE GRAPHS (opens in a new tab)

  10. Efficient Algorithms for Graph-Theoretic and Geometric Problems

    … several different algorithmic problems in graph theory and in geometry. The applications of the problems studied range from circuit design optimization to fast matrix multiplication. First, we study a graph-theoretical model of the so called ''firefighter problem''. The objective is to save …

    lund Repository record for Efficient Algorithms for Graph-Theoretic and Geometric Problems (opens in a new tab) Download PDF for Efficient Algorithms for Graph-Theoretic and Geometric Problems (opens in a new tab)

  11. Discovery of Temporal Graph Functional Dependencies

    Temporal graphs play a crucial role in modelling dynamic applications where (node) attribute values change over time. However, in some domains, specific attribute value relationships are expected to remain consistent over a time-interval. For example, in therapeutic drug monitoring, the measurement …

    mcmaster Repository record for Discovery of Temporal Graph Functional Dependencies (opens in a new tab)

  12. On Ranked Approximate Matching Of Large Attributed Graphs

    … database applications entail sophisticated graph based query manipulation, predominantly evident in large-scale scientific applications. To access the information embedded in graphs, efficient graph matching tools and algorithms have become of prime importance. Although the prohibitively …

    wayne-thes Repository record for On Ranked Approximate Matching Of Large Attributed Graphs (opens in a new tab)

  13. Relation Prediction over Biomedical Knowledge Bases for Drug Repositioning

    … first we investigate the predictive power of graph paths connecting entities in the publicly available biomedical knowledge base, SemMedDB (the entities and relations constitute a large knowledge graph as a whole). To that end, we build logistic regression models utilizing semantic graph …

    uky-thes Repository record for Relation Prediction over Biomedical Knowledge Bases for Drug Repositioning (opens in a new tab)

  14. Design of Formal Query Languages and Schemas for Graph Databases

    The industry-wide adoption of graph databases has been hindered due to the lack of a standard query language. Hence projects such as ISO/IEC 39075 have been proposed to integrate features from existing graph query languages, including Cypher, PGQL and G-Core. Integrating existing query languages …

    auckland-tech Repository record for Design of Formal Query Languages and Schemas for Graph Databases (opens in a new tab)

  15. Data Integration on the (Semantic) Web with Rules and Rich Unification

    … from Xcerpt query term simulation, SPARQL graph pattern matching and XPath XML document matching, and shows that all of them can be considered as a form of rich unification. Given a set of mappings between substitution sets of different languages, this abstraction opens up the possibility …

    lmu-germany Repository record for Data Integration on the (Semantic) Web with Rules and Rich Unification (opens in a new tab)

  16. From Best Match Graphs to Gene Trees

    … of best match as well as reciprocal best match graphs (BMGs and RBMGs) that arise at the first step of RBH methods. While BMGs as well as RBMGs with at most three species can be recognized in polynomial time, RBMGs with more than three species have a surprisingly complicated structure and it …

    qucosa-diss

  17. On Pattern Mining in Graph Data to Support Decision-Making

    In recent years graph data models became increasingly important in both research and industry. Their core is a generic data structure of things (vertices) and connections among those things (edges). Rich graph models such as the property graph model promise an extraordinary analytical power because …

    qucosa-diss

  18. Optimizing Parallel Graph Analytics through Advanced Innovative Techniques

    … analyzing and extracting information from large graphs has risen sharply. However, the extensive size and high complexity of some graphs incur a heavy computational cost, making it hard to study them using traditional analytical frameworks. Moreover, many important graph algorithms are difficult …

    texas-state Repository record for Optimizing Parallel Graph Analytics through Advanced Innovative Techniques (opens in a new tab)

  19. Data and knowledge management in cloud computing environment

    … the problem of efficiently evaluating basic graph pattern (BGP) queries over a large amount of linked data (RDF data) in parallel and provide four approaches. In this context, we consider that the data graph has been partitioned into graph segments and the initial query Q is decomposed into a …

    greece Repository record for Data and knowledge management in cloud computing environment (opens in a new tab)

Page 1 of 2