Ranking answering in social networks

Author

Yang, Qing ; Zhou, Ping ; Zhang, Huibing ; Zhang, Jingwei

Author_Institution

Sch. of Comput. & Control, Guilin Univ. of Electron. Technol., Guilin, China

fYear

2010

fDate

22-24 Oct. 2010

Firstpage

683

Lastpage

686

Abstract

Users in social networks can follow and be followed to establish all kinds of cliques. Users´ rankings in followed numbers show their popularities, which is an important measurement for social network analysis. In order to give a fast answering for ranking queries, we proposed four methods, ISH, HDD, BBT and SMH. ISH uses inverted sequential hash, HDD is a combination of blocking and hierarchy, BBT utilizes blocking and B- tree technologies, SMH analyzes the sparse of data in large number space, and adapts sequential storage for low values and multi-hashing storage for high values. Our experiments present their different performance in query time and memory consuming.

Keywords

data analysis; file organisation; query processing; social networking (online); trees (mathematics); B tree technology; BBT; HDD; ISH; SMH; multihashing storage; ranking queries; sequential hash; social network; Artificial neural networks; Computational modeling; Irrigation; Presses; followed number; followed ranking; multi-hashing; ranking query;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computing and Integrated Systems (ICISS), 2010 International Conference on

Conference_Location

Guilin

Print_ISBN

978-1-4244-6834-8

Type

conf

DOI

10.1109/ICISS.2010.5655510

Filename

5655510