Continuous Top-k Queries in Social Networks
| Autor: | Abdulhafiz Alkhouli, Dan Vodislav, Boris Borzic |
|---|---|
| Přispěvatelé: | Equipes Traitement de l'Information et Systèmes (ETIS - UMR 8051), Ecole Nationale Supérieure de l'Electronique et de ses Applications (ENSEA)-Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY) |
| Rok vydání: | 2016 |
| Předmět: |
social networks
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB] Social network Computer science business.industry 02 engineering and technology Extension (predicate logic) Limiting computer.software_genre publish/subscribe systems 020204 information systems Similarity (psychology) 0202 electrical engineering electronic engineering information engineering information streams 020201 artificial intelligence & image processing Data mining Scale (map) business continuous top-k query processing computer |
| Zdroj: | On the Move to Meaningful Internet Systems: OTM 2016 Conferences ISBN: 9783319484716 OTM Conferences Lecture Notes in Computer Science 10033 CoopIS 2016 CoopIS 2016, 2016, Rhodes, Greece. pp.24-42, ⟨10.1007/978-3-319-48472-3_2⟩ |
| DOI: | 10.1007/978-3-319-48472-3_2 |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|