Please use this identifier to cite or link to this item:
|Title:||Continuous skyline queries for moving objects||Authors:||HUANG ZHIYONG
|Keywords:||Continuous query processing
Moving object databases
|Issue Date:||2006||Citation:||HUANG ZHIYONG, Lu, H., Ooi, B.C., Tung, A.K.H. (2006). Continuous skyline queries for moving objects. IEEE Transactions on Knowledge and Data Engineering 18 (12) : 1645-1658. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2006.185||Abstract:||The literature on skyline algorithms has so far dealt mainly with queries of static query points over static data sets. With the increasing number of mobile service applications and users, however, the need for continuous skyline query processing has become more pressing. A continuous skyline query involves not only static dimensions, but also the dynamic one. In this paper, we examine the spatiotemporal coherence of the problem and propose a continuous skyline query processing strategy for moving query points. First, we distinguish the data points that are permanently in the skyline and use them to derive a search bound. Second, we investigate the connection between the spatial positions of data points and their dominance relationship, which provides an indication of where to find changes in the skyline and how to maintain the skyline continuously. Based on the analysis, we propose a kinetic-based data structure and an efficient skyline query processing algorithm. We concisely analyze the space and time costs of the proposed method and conduct an extensive experiment to evaluate the method. To the best of our knowledge, this is the first work on continuous skyline query processing. © 2006 IEEE.||Source Title:||IEEE Transactions on Knowledge and Data Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/39395||ISSN:||10414347||DOI:||10.1109/TKDE.2006.185|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2019
checked on May 23, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.