Social Search Queries in Time

Recently, social networks have attracted considerable attention. The huge volume of information contained in them, as well as their dynamic nature, makes the problem of searching social data challenging. In this position paper, to increase the eectiveness of social search queries, we propose exploiting the temporal information available in social networks. In particular, we introduce dierent types of queries aiming at satisfying information needs from dierent perspectives. We present a formal graph and query model augmented with time and outline methods for query processing and timedependent ranking. Finally, we identify several directions for future work.

[1]  Ayman Farahat How effective is targeted advertising? , 2013, ACC.

[2]  Udayan Khurana,et al.  Efficient snapshot retrieval over historical graph data , 2012, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[3]  Evaggelia Pitoura,et al.  On Graph Deltas for Historical Queries , 2013, ArXiv.

[4]  Ayman Farahat,et al.  How effective is targeted advertising? , 2012, 2013 American Control Conference.

[5]  Reynold Cheng,et al.  On querying historical evolving graph sequences , 2011, Proc. VLDB Endow..

[6]  Roi Blanco,et al.  A survey of temporal web search experience , 2013, WWW '13 Companion.

[7]  Omar Alonso,et al.  Temporally-Aware Signals for Social Search , 2012 .

[8]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[9]  Vassilis J. Tsotras,et al.  Temporal Top-k Search in Social Tagging Sites Using Multiple Social Networks , 2010, DASFAA.

[10]  Cong Yu,et al.  Constructing and exploring composite items , 2010, SIGMOD Conference.

[11]  Claudio Gutiérrez,et al.  Introducing Time into RDF , 2007, IEEE Transactions on Knowledge and Data Engineering.