Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

NETR-Tree: An Eifficient Framework for Social-Based Time-Aware Spatial Keyword Query (1908.09520v2)

Published 26 Aug 2019 in cs.SI and cs.IR

Abstract: The development of global positioning system stimulates the popularity of location-based social network (LBSN) services. With a large volume of data containing locations, texts, check-in information, and social relationships, spatial keyword queries in LBSNs have become increasingly complex. In this paper, we identify and solve the Social-based Time-aware Spatial Keyword Query (STSKQ) that returns the top-k objects by considering geo-spatial score, keywords similarity, visiting time score, and social relationship effect. To tackle STSKQ, we propose a two-layer hybrid index structure called Network Embedding Time-aware R-tree (NETR-Tree). In the user layer, we exploit the network embedding strategy to measure the relationship effect in users' relationship network. In the location layer, we build a Time-aware R-tree (TR-tree) considered spatial objects' spatiotemporal check-in information, and present a corresponding query processing algorithm. Finally, extensive experiments on two different real-life LBSNs demonstrate the effectiveness and efficiency of our methods, compared with existing state-of-the-art methods.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Xiuqi Huang (5 papers)
  2. Yuanning Gao (27 papers)
  3. Xiaofeng Gao (53 papers)
  4. Guihai Chen (74 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.