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 9 of 9 for “"Streaming Graphs"”.

  1. Mining Butterflies in Streaming Graphs

    … counting and concept drift detection over a streaming graph. A data-driven heuristic is used to architect the systems. To this end, initially, the growth patterns of bipartite streaming graphs are mined and the emergence principles of streaming motifs are discovered. Next, the discovered …

    waterloo Repository record for Mining Butterflies in Streaming Graphs (opens in a new tab)

  2. Querying Structural Diversity in Streaming Graphs

    … of a vertex for any query time windows in streaming graphs. Existing studies are limited to static graphs which fail to capture vertices' structural diversities in snapshots evolving over time. We design an elegant index structure to significantly reduce the index size compared to the basic …

    unsw Repository record for Querying Structural Diversity in Streaming Graphs (opens in a new tab)

  3. Models and Algorithms for Persistent Queries over Streaming Graphs

    … to model and represent interaction data as graphs in a broad range of domains such as online social networks, protein interaction data, and e-commerce applications. A number of emerging applications require continuous processing and querying of interaction data that evolves at a high rate, …

    waterloo Repository record for Models and Algorithms for Persistent Queries over Streaming Graphs (opens in a new tab)

  4. Triangle count estimation and label prediction over uncertain streaming graphs

    … approximating triangle counts in edge uncertain streaming graphs and a Graph Neural Network (GNN)-based method for dynamic label prediction in attribute uncertain stream- ing graphs. Both methods demonstrate robust performance in handling dynamic and uncertain data, thus opening new avenues for …

    waterloo Repository record for Triangle count estimation and label prediction over uncertain streaming graphs (opens in a new tab)

  5. Approximating 4-cliques in streaming graphs: the power of dual sampling

    … is a combinatorial explosion; even moderate graphs with a few million edges could have clique counts in the order of many billions. When dealing with such big data, it becomes critical to not just analyze it, rather analyze it very efficiently. While randomized algorithms are known for …

    uvic Repository record for Approximating 4-cliques in streaming graphs: the power of dual sampling (opens in a new tab)

  6. Cardinality Estimation in Streaming Graph Data Management Systems

    … 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, the lack of a standardized, general-purpose query framework specifically for streaming graphs is a notable gap in …

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

  7. Connectivity Query Processing in Temporal Graphs

    The connectivity query in undirected graphs aims to determine if there exists a path connecting two query vertices, which is a fundamental task in both graph theory and real graph-driven tasks. The temporal graph has a time label for each edge and is commonly used to capture the interactions …

    unsw Repository record for Connectivity Query Processing in Temporal Graphs (opens in a new tab)

  8. Τεχνικές επεξεργασίας κατανεμημένων γράφων και ρευμάτων γράφων

    … networks are routinely represented using graphs. The volume of graph data produced in today’s interlinked world allows for realizing numerous fascinating applications but also posses important challenges. Consider for example the friendship graph of a social networking site and the …

    greece Repository record for Τεχνικές επεξεργασίας κατανεμημένων γράφων και ρευμάτων γράφων (opens in a new tab)