Continuous Top-k Queries in Social Networks

被引：0

作者：

Alkhouli, Abdulhafiz ^{[1
]}

Vodislav, Dan ^{[1
]}

Borzic, Boris ^{[1
]}

机构：

[1] Univ Cergy Pontoise, CNRS, ETIS ENSEA, Cergy, France

来源：

ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2016 CONFERENCES | 2016年 / 10033卷

关键词：

Information streams; Social networks; Continuous top-k query processing; Publish/subscribe systems;

D O I：

10.1007/978-3-319-48472-3_2

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Information streams provide today a prevalent way of publishing and consuming content on the Web, especially due to the great success of social networks. Top-k queries over the streams of interest allow limiting results to the most relevant content, while continuous processing of such queries is the most effective approach in large scale systems. However, current systems fail in combining continuous top-k processing with rich scoring models including social network criteria. We present here the SANTA algorithm, able to handle scoring functions including content similarity, but also social network criteria and events in a continuous processing of top-k queries. We propose a variant (SANTA+) that accelerates the processing of interaction events in social networks. We compare SANTA/SANTA+ with an extension of a state-of-the-art algorithm and report a rich experimental study of our approach.

引用

页码：24 / 42

页数：19