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 13 of 13 for “"graph data management"”.

  1. HISTORICAL GRAPH DATA MANAGEMENT

    … patterns, visualizing the evolution of graph properties, or even simply comparing them across time, has proven to add significant value in reasoning over networks. However, because of the lack of underlying data management support, much of the work on large-scale graph analytics to date …

    maryland Repository record for HISTORICAL GRAPH DATA MANAGEMENT (opens in a new tab)

  2. On Consistent and Efficient Graph Data Management

    … describes techniques to store and process large graphs in modern datacenters with high performance and strong consistency guarantees. Graph-structured data is ubiquitous: social networks, content networks, cryptocurrency transaction histories, and business analytics routinely store and manipulate …

    cornell Repository record for On Consistent and Efficient Graph Data Management (opens in a new tab)

  3. 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)

  4. G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases

    Structured data such as graphs and networks have posed significant challenges to fundamental aspects of data management including efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important …

    ku Repository record for G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases (opens in a new tab)

  5. Graph Processing in Main-Memory Column Stores

    … applications leverage the advantages of a graph data model, such as the offered schema flexibility and an explicit representation of relationships between entities. As a consequence, companies are confronted with the challenge of storing, manipulating, and querying terabytes of graph data …

    qucosa-diss

  6. Indexing and Learning approaches for reachability in temporal and labeled graphs

    Graphs have become essential in modeling dynamic and semantically rich real-world systems, such as financial transaction networks and knowledge based networks. Reachability queries plays a central role in analyzing these systems by determining whether one entity can influence or access another …

    unsw Repository record for Indexing and Learning approaches for reachability in temporal and labeled graphs (opens in a new tab)

  7. Sequence queries on temporal graphs

    Graphs that evolve over time are called temporal graphs. They can be used to describe and represent real-world networks, including transportation networks, social networks, and communication networks, with higher fidelity and accuracy. However, research is still limited on how to manage large scale …

    bu Repository record for Sequence queries on temporal graphs (opens in a new tab)

  8. 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)

  9. Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens

    … that is solved in the query optimizers of database management systems when generating efficient query plans. This problem arises both in systems that manage relational data as well those that manage graph-structured data where systems need to estimate the cardinalities of subgraphs in their …

    waterloo Repository record for Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens (opens in a new tab)

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

  11. Real-time analytics on large dynamic graphs

    … fast-paced and interconnected digital world, the data generated by an increasing number of applications is being modeled as dynamic graphs. The graph structure encodes relationships among data items, while the structural changes to the graphs as well as the continuous stream of information …

    maryland Repository record for Real-time analytics on large dynamic graphs (opens in a new tab)

  12. Enabling Graph Analysis Over Relational Databases

    … underlying entities or objects described by a dataset. These relationships form networks (graphs), the analysis of which has been shown to provide tremendous value in areas ranging from retail to many scientific domains. This value is obtained by using various methodologies from network …

    maryland Repository record for Enabling Graph Analysis Over Relational Databases (opens in a new tab)