K-truss community most favorites query based on top-t

• Published in: World wide web (Bussum) Vol. 25; no. 2; pp. 949 - 969
• Main Authors: Yang, Zhibang, Li, Xiaoxue, Zhang, Xu, Luo, Wensheng, Li, Kenli
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.03.2022; Springer Nature B.V
• Subjects: Algorithms; Computer Science; Database Management; Information Systems Applications (incl.Internet); Operating Systems; Queries; Query processing; Social networks; Special Issue on Large Scale Graph Data Analytics; Trusses; Top; Query processing; truss community
• ISSN: 1386-145X; 1573-1413
• DOI: 10.1007/s11280-021-00947-7

Top- t queries, which return t results with the highest scores according to the user’s preferences, have been extensively studied. However, many studies often fail to take into account the social relationships among users, and close social relationships usually guarantee the consistency of users’ preferences. Many real-world applications, such as community-based product recommendation services, require such queries. In this paper, we propose a new problem: the k -truss community most favorites querying problem based on user top- t favorites. Specifically, both the k -truss community and the corresponding most favorite object are retrieved. We first present the baseline solution to the problem. The main idea is to find the same object in the top- t favorites of the users in the social network and build the k -truss community for these users with the same preferences. Furthermore, we propose a reverse query algorithm to speed up the processing of the k − t CMF querying problem by filtering users in the social network. The experiment results on both real and synthetic datasets significantly demonstrate that the proposed solutions are efficient and scalable.