2 citations · 4 across the 11 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2025
TIMEST: Temporal Information Motif Estimator Using Sampling Trees
Yunjie Pan, Omkar Bhalerao, C. Seshadhri +1
The mining of pattern subgraphs, known as motifs, is a core task in the field of graph mining. Edges in real-world networks often have timestamps, so there is a need for temporal m…
cs.DB2025
Vortex: Overcoming Memory Capacity Limitations in GPU-Accelerated Large-Scale Data Analytics
Yichao Yuan, Advait Iyer, Lin Ma +1
Despite the high computational throughput of GPUs, limited memory capacity and bandwidth-limited CPU-GPU communication via PCIe links remain significant bottlenecks for acceleratin…
cs.DB2023
Demystifying Graph Sparsification Algorithms in Graph Properties Preservation
Yuhan Chen, Haojie Ye, Sanketh Vedula +4
Graph sparsification is a technique that approximates a given graph by a sparse graph with a subset of vertices and/or edges. The goal of an effective sparsification algorithm is t…