Location-dependent spatial query containment

被引:2
作者
Lee, Ken C. K. [1 ]
Unger, Brandon [2 ]
Zheng, Baihua [3 ]
Lee, Wang-Chien [4 ]
机构
[1] Univ Massachusetts Dartmouth, Dept Comp & Informat Sci, N Dartmouth, MA 02747 USA
[2] Microsoft Corp, Redmond, WA 98052 USA
[3] Singapore Management Univ, Sch Informat Syst, Singapore, Singapore
[4] Penn State Univ, Dept Comp Sci & Engn, University Pk, PA 16802 USA
基金
美国国家科学基金会;
关键词
Location-Dependent Spatial Query; Query containment; Containment scope; MOBILE OBJECTS; NEAREST;
D O I
10.1016/j.datak.2011.06.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nowadays, location-related information is highly accessible to mobile users via issuing Location-Dependent Spatial Queries (LDSQs) with respect to their locations wirelessly to Location-Based Service (LBS) servers. Due to the limited mobile device battery energy, scarce wireless bandwidth, and heavy LBS server workload, the number of LDSQs submitted over wireless channels to LBS servers for evaluation should be minimized as appropriate. In this paper, we exploit query containment techniques for LDSQs (called LDSQ containment) to enable mobile clients to determine whether the result of a new LDSQ Q' is completely covered by that of another LDSQ Q previously answered by a server (denoted by Q' subset of Q) and to answer Q' locally if Q' subset of Q. Thus, many LDSQs can be reduced from server evaluation. To support LDSQ containment, we propose a notion of containment scope, which represents a spatial area corresponding to an LDSQ result wherein all semantically matched LDSQs are answerable with the result. Through a comprehensive simulation, our proposed approach significantly outperforms existing techniques. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:842 / 865
页数:24
相关论文
共 44 条
  • [1] *ABIRESEARCH, MOB LOC BAS SERV RES
  • [2] [Anonymous], 1995, P 1995 ACM SIGMOD IN, DOI DOI 10.1145/223784.223794
  • [3] [Anonymous], 1998, COMPUTATIONAL GEOMET
  • [4] *ARM, SA 1100 MICR PROD BR
  • [5] Nearest and reverse nearest neighbor queries for moving objects
    Benetis, Rimantas
    Jensen, Christian S.
    Karciauskas, Gytis
    Saltenis, Simonas
    [J]. VLDB JOURNAL, 2006, 15 (03) : 229 - U1
  • [6] BERCHTOLD S, 2001, P 8 INT C DAT THEOR, P435
  • [7] CALVANESE D, 2008, ACM T COMPUT LOG, V9, P1
  • [8] Calvanese D., 2003, P 22 ACM S PRINC DAT, P56
  • [9] An Adaptive Updating Protocol for Reducing Moving Object Database Workload
    Chen, Su
    Ooi, Beng Chin
    Zhang, Zhenjie
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 3 (01): : 735 - 746
  • [10] Dar S, 1996, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P330