3 citations · 5 across the 7 of their papers we have counts for
5 papers · 1 filter
Efficient Maximum Fair Clique Search over Large Networks
Qi Zhang, Rong-Hua Li, Zifan Zheng +3
Mining cohesive subgraphs in attributed graphs is an essential problem in the domain of graph data analysis. The integration of fairness considerations significantly fuels interest…
Efficient Top-k Ego-Betweenness Search
Qi Zhang, Rong-Hua Li, Minjia Pan +3
Betweenness centrality, measured by the number of times a vertex occurs on all shortest paths of a graph, has been recognized as a key indicator for the importance of a vertex in t…
Multi-attributed Community Search in Road-social Networks
Fangda Guo, Ye Yuan, Guoren Wang +2
Given a location-based social network, how to find the communities that are highly relevant to query users and have top overall scores in multiple attributes according to user pref…
Cracking In-Memory Database Index A Case Study for Adaptive Radix Tree Index
Gang Wu, Yidong Song, Guodong Zhao +5
Indexes provide a method to access data in databases quickly. It can improve the response speed of subsequent queries by building a complete index in advance. However, it also lead…
A Comparative Study of Consistent Snapshot Algorithms for Main-Memory Database Systems
Liang Li, Guoren Wang, Gang Wu +3
In-memory databases (IMDBs) are gaining increasing popularity in big data applications, where clients commit updates intensively. Specifically, it is necessary for IMDBs to have ef…