<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06097798</id>
  <dt>j</dt>
  <an>06097798</an>
  <augroup>
    <au>Tan, Rong</au>
    <au>Gu, Jun-Zhong</au>
    <au>Lin, Xin</au>
    <au>Cehn, Peng</au>
  </augroup>
  <ti>Range-based approach for multi-object convergence problem.</ti>
  <so>J. Comput. Appl. 31, No. 9, 2389-2394 (2011).</so>
  <py>2011</py>
  <pu>Science Press, Beijing</pu>
  <lagroup>
    <la>ZH</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Location-Based Service (LBS)</ut>
    <ut>context-aware computing</ut>
    <ut>skyline queries</ut>
    <ut>range queries</ut>
    <ut>Voronoi graph</ut>
    <ut>privacy protection</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.3724/SP.J.1087.2011.02389</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper, the concept of multi-object convergence problem was introduced. While some former query techniques could be used to deal with this problem, they are all point-based and unable to protect location privacy. Hence, a range-based spatial Skyline query algorithm named VRSSA was proposed. It utilized the Voronoi graph and supported the spatial anonymity techniques in Location-based Service (LBS). Furthermore, with respect to the changes of query conditions, another two algorithms, Dynamic Point Joining Algorithm (DPJA) and Dynamic Point Deleting Algorithm (DPDA), to dynamically update the query results were proposed so that heavy re-computation could be avoided. The experimental results show that the approaches could efficiently and effectively solve the problem.</ab>
    <rv></rv>
  </abgroup>
</item>