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 10 of 10 for “"graph database management systems"”.

  1. Robust Recursive Query Parallelization in Graph Database Management Systems

    … path queries are a core feature set of modern graph database management systems (GDBMS). Since these queries tend to be computationally expensive and may suffer from high execution time, they require efficient parallel processing using multiple cores to achieve good performance. Existing work …

    waterloo Repository record for Robust Recursive Query Parallelization in Graph Database Management Systems (opens in a new tab)

  2. A+ Indexes: Highly Flexible Adjacency Lists in Graph Database Management Systems

    … most fundamental storage structure in existing graph database management systems (GDBMSs) to index input graphs. Adjacency lists are universally linked-list like per-vertex structures that allow access to a set of edges that are all adjacent to a vertex. In several systems, adjacency lists can …

    waterloo Repository record for A+ Indexes: Highly Flexible Adjacency Lists in Graph Database Management Systems (opens in a new tab)

  3. Integrating Column-Oriented Storage and Query Processing Techniques into Graph Database Management Systems

    … these techniques in the context of contemporary graph database management systems (GDBMSs). GDBMSs support a new set of analytics workloads, such as fraud detection in financial transaction networks or recommendations in social networks, that are also read-heavy but have fundamentally different …

    waterloo Repository record for Integrating Column-Oriented Storage and Query Processing Techniques into Graph Database Management Systems (opens in a new tab)

  4. DPQP: A D-representation-based Pipelined Factorized Query Processor for Graph Database Management Systems

    Factorized databases utilize factorized data representations during query processing to obtain more compact final query results and faster runtimes for queries with many-to-many joins. We revisit this technique in the context of graph database management systems (GDBMSs) whose common workloads are …

    waterloo Repository record for DPQP: A D-representation-based Pipelined Factorized Query Processor for Graph Database Management Systems (opens in a new tab)

  5. Grafų duomenų bazių valdymo sistemos /

    Graph Database Management Systems.

    vilnius Repository record for Grafų duomenų bazių valdymo sistemos / (opens in a new tab)

  6. Cardinality Estimation in Streaming Graph Data Management Systems

    Graph processing has become an increasingly popular paradigm for data management systems. Concurrently, there is a pronounced demand for specialized systems dedicated to streaming processing that are essential to address the continual flow of data and the inherent dynamism in streaming data. Yet, …

    waterloo Repository record for Cardinality Estimation in Streaming Graph Data Management Systems (opens in a new tab)

  7. Systems and Algorithms for Dynamic Graph Processing

    Data generated from human and systems interactions could be naturally represented as graph data. Several emerging applications rely on graph data, such as the semantic web, social networks, bioinformatics, finance, and trading among others. These applications require graph querying capabilities …

    waterloo Repository record for Systems and Algorithms for Dynamic Graph Processing (opens in a new tab)

  8. Benchmarking Graph Databases with Cyclone Benchmark

    <p>Recent years have seen advances in graph databases and graph database management systems (GDBMS). In a typical graph data model, a node represents an entity and an edge represents a relationship between two nodes. Nodes and edges typically have associated properties (attributes) and are assigned …

    iastate Repository record for Benchmarking Graph Databases with Cyclone Benchmark (opens in a new tab)

  9. Design Foundations of Graph Databases

    The property graph model and graph database management systems such as Neo4j have become increasingly popular. Naturally, questions around graph data modelling best practices arise. Graph databases are perceived as very intuitive and our research will provide evidence to showcase their benefits. …

    auckland-ms Repository record for Design Foundations of Graph Databases (opens in a new tab)

  10. Locality Optimizations and Analysis for Storage Hierarchies of Graph Databases

    Graph database management systems (GDBMSs) are increasingly used to support traversal-heavy workloads. Graph queries often follow data-dependent paths through the graph, producing irregular or non-sequential accesses that do not align with the storage hierarchy, from data layout on disk to …

    waterloo Repository record for Locality Optimizations and Analysis for Storage Hierarchies of Graph Databases (opens in a new tab)