An efficient data dissemination scheme for nearest neighbour query processing

被引:0
|
作者
Park, K [1 ]
机构
[1] Korea Univ, Dept Comp Sci & Engn, Seoul 136701, South Korea
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Location dependent information services (LDISs) produce answers to queries according to the location of the client issuing the query. In LDIS, techniques such as caching, prefetching and broadcasting are effective approaches to reducing the wireless bandwidth requirement and query response time. However, the client's mobility may lead to inconsistency problems. In this paper, we introduce the broadcast-based LDIS scheme (BBS) for the mobile computing environment. In the BBS, broadcasted data items are sorted sequentially based on their location and the server broadcasts the location dependent data (LDD) along with an index segment. Then, we present a data prefetching scheme and OBC (Object Boundary Circle), in order to reduce the query response time. The performance of the proposed scheme is investigated in relation to various environmental variables, such as the distributions of the data items, the average speed of the clients and the size of the service area.
引用
收藏
页码:181 / 195
页数:15
相关论文
共 50 条
  • [1] An efficient data dissemination scheme for spatial query processing
    Park, Kwangjin
    Choo, Hyunseung
    Hwang, Chong-Sun
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2007, 22 (01): : 131 - 134
  • [2] An Efficient Data Dissemination Scheme for Spatial Query Processing
    Kwangjin Park
    Hyunseung Choo
    Chong-Sun Hwang
    [J]. Journal of Computer Science and Technology, 2007, 22 : 131 - 134
  • [3] Energy-efficient data dissemination schemes for nearest neighbor query processing
    Park, Kwangjin
    Choo, Hyunseung
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2007, 56 (06) : 754 - 768
  • [4] K Nearest Neighbour Query Processing in Wireless Sensor and Robot Networks
    Xie, Wei
    Li, Xu
    Narasimhan, Venkat
    Nayak, Amiya
    [J]. AD-HOC, MOBILE, AND WIRELESS NETWORKS, ADHOC-NOW 2014, 2014, 8487 : 251 - +
  • [5] Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data
    Bernecker, Thomas
    Emrich, Tobias
    Kriegel, Hans-Peter
    Renz, Matthias
    Zankl, Stefan
    Zuefle, Andreas
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 4 (10): : 669 - 680
  • [6] Efficient Processing of Probabilistic Group Nearest Neighbor Query on Uncertain Data
    Li, Jiajia
    Wang, Botao
    Wang, Guoren
    Bi, Xin
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2014, PT I, 2014, 8421 : 436 - 450
  • [7] An efficient privacy-preserving data query and dissemination scheme in vehicular cloud
    Hu, Peng
    Wang, Yongli
    Xiao, Gang
    Zhou, Junlong
    Gong, Bei
    Wang, Yongjian
    [J]. PERVASIVE AND MOBILE COMPUTING, 2020, 65
  • [8] Efficient Aggregate Farthest Neighbour Query Processing on Road Networks
    Wang, Haozhou
    Zheng, Kai
    Su, Han
    Wang, Jiping
    Sadiq, Shazia
    Zhou, Xiaofang
    [J]. DATABASES THEORY AND APPLICATIONS, ADC 2014, 2014, 8506 : 13 - 25
  • [9] A k-nearest Neighbour Query Processing Strategy Using the mqr-tree
    Osborn, Wendy
    [J]. ADVANCES IN NETWORK-BASED INFORMATION SYSTEMS, NBIS-2017, 2018, 7 : 566 - 577
  • [10] An efficient continuous k-nearest neighbor query processing scheme for multimedia data sharing and transmission in location based services
    Kyoungsoo Bok
    Yonghun Park
    Jaesoo Yoo
    [J]. Multimedia Tools and Applications, 2019, 78 : 5403 - 5426