Location-aware instant search
Location-aware instant search
复制标题
DOI：
10.1145/2396761.2396812
复制
发表时间：
2012-10
期刊：
影响因子：
--
通讯作者：
R. Zhong;Ju Fan;Guoliang Li;K. Tan;Lizhu Zhou
中科院分区：
文献类型：
--
作者：
R. Zhong;Ju Fan;Guoliang Li;K. Tan;Lizhu Zhou
基于位置的服务（LB）最近已被移动用户广泛接受。现有的基于LBS的系统要求用户输入完整的关键字。但是，对于移动用户来说，很难在移动设备上输入完整的关键字。为了减轻此问题，在本文中，我们研究了位置吸引的即时搜索问题，该问题将用户返回用户在用户键入询问字母时的位置吸引答案。主要的挑战是实现高互动速度。为了应对这一挑战，在本文中，我们提出了一种新颖的索引结构，即前缀 - 区域树（称为PR-Tree），以有效地支持位置感知的即时搜索。 PR-Tree是一种基于树的索引结构，它无缝集成文本描述和空间信息以索引空间数据。使用PR-Tree，我们开发了有效的算法来支持单个前缀查询和多关键字查询。实验表明，我们的方法可以达到高性能，并且明显优于最先进的方法。
Location-Based Services (LBS) have been widely accepted by mobile users recently. Existing LBS-based systems require users to type in complete keywords. However for mobile users it is rather difficult to type in complete keywords on mobile devices. To alleviate this problem, in this paper we study the location-aware instant search problem, which returns users location-aware answers as users type in queries letter by letter. The main challenge is to achieve high interactive speed. To address this challenge, in this paper we propose a novel index structure, prefix-region tree (called PR-Tree), to efficiently support location-aware instant search. PR-Tree is a tree-based index structure which seamlessly integrates the textual description and spatial information to index the spatial data. Using the PR-Tree, we develop efficient algorithms to support single prefix queries and multi-keyword queries. Experiments show that our method achieves high performance and significantly outperforms state-of-the-art methods.