Top-k temporal keyword query over social media data

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Analytic jobs over social media data typically need to explore data of different periods. However, most existing keyword search work merely use creation time of items as the measurement of their recency. In this paper we propose top-k temporal keyword query that ranks data by their aggregate sum of shared times during the given time window. A query algorithm that can be executed over a general temporal inverted index is provided. The complexity analysis based on the power law distribution reveals the upper bound of accessed items. Furthermore, twotiers structure and piecewise maximum approximation sketch are proposed as refinements. Extensive empirical studies on a reallife dataset show the combination of two refinements achieves remarkable performance improvement under different query settings.

Original languageEnglish
Title of host publicationWeb Technologies and Applications - 18th Asia-Pacific Web Conference, APWeb 2016, Proceedings
EditorsGuanfeng Liu, Feifei Li, Kyuseok Shim, Kai Zheng
PublisherSpringer Verlag
Pages183-195
Number of pages13
ISBN (Print)9783319458137
DOIs
StatePublished - 2016
Event18th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2016 - Suzhou, China
Duration: 23 Sep 201625 Sep 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9931 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2016
Country/TerritoryChina
CitySuzhou
Period23/09/1625/09/16

Keywords

  • Social media
  • Temporal query
  • Top-k query

Fingerprint

Dive into the research topics of 'Top-k temporal keyword query over social media data'. Together they form a unique fingerprint.

Cite this