1 citations · 2 across the 27 of their papers we have counts for
10 papers · 1 filter
Algebraic Subgraph Counting
Qiuyu Guo, Jianye Yang, Wenjie Zhang +3
Subgraph isomorphism counting is a fundamental problem in graph analytics, which aims to find the number of subgraph isomorphisms of a query graph in a data graph. The candidate tr…
Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
Yuanhang Yu, Dawei Cheng, Ying Zhang +3
Nearest neighbor search on high-dimensional vectors is fundamental in modern AI and database systems. In many real-world applications, queries involve constraints on multiple numer…
Accelerating Historical K-Core Search in Temporal Graphs
Zhuo Ma, Dong Wen, Kaiyu Chen +3
We study the temporal k-core component search (TCCS), which outputs the k-core containing the query vertex in the snapshot over an arbitrary query time window in a temporal graph.…
Accelerating K-Core Computation in Temporal Graphs
Zhuo Ma, Dong Wen, Hanchen Wang +3
We address the problem of enumerating all temporal k-cores given a query time range and a temporal graph, which suffers from poor efficiency and scalability in the state-of-the-art…
Efficient Dynamic Attributed Graph Generation
Fan Li, Xiaoyang Wang, Dawei Cheng +3
Data generation is a fundamental research problem in data management due to its diverse use cases, ranging from testing database engines to data-specific applications. However, rea…
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
Yanping Wu, Renjie Sun, Xiaoyang Wang +4
Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, whic…