A continuous reverse skyline query processing scheme for multimedia data sharing in mobile environments

Recently, various query processing schemes in mobile environments have been studied. Particularly, a reverse skyline query that is the variation of a skyline query has been receiving much attention these days for multimedia data. However, the existing reverse skyline query processing schemes did not consider the mobility of devices. In this paper, we propose a continuous reverse skyline query processing scheme that considers the mobility of mobile devices. The proposed scheme removes the devices that do not affect a query by using a pruning method and continuously monitors the areas of candidate devices to update the query result incrementally.

[1]  Prasad Deshpande,et al.  Efficient reverse skyline retrieval with arbitrary non-metric similarity measures , 2011, EDBT/ICDT '11.

[2]  Ling Zhu,et al.  Efficient Computation of Reverse Skyline on Data Stream , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.

[3]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[4]  Xiang Lian,et al.  Monochromatic and bichromatic reverse skyline search over uncertain databases , 2008, SIGMOD Conference.

[5]  Ken Chen,et al.  Continuous Probabilistic Skyline Queries for Uncertain Moving Objects in Road Network , 2010, 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010).

[6]  Jaesoo Yoo,et al.  An efficient method for processing reverse skyline queries , 2010, 2010 Global Mobile Congress.

[7]  H. Buchner.  The Grid File : An Adaptable , Symmetric Multikey File Structure , 2001 .

[8]  Ihab F. Ilyas,et al.  A survey of top-k query processing techniques in relational database systems , 2008, CSUR.

[9]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[10]  Bernhard Seeger,et al.  Progressive skyline computation in database systems , 2005, TODS.

[11]  Anthony K. H. Tung,et al.  DADA: a data cube for dominant relationship analysis , 2006, SIGMOD Conference.

[12]  Nadeem Javaid,et al.  iAMCTD: Improved Adaptive Mobility of Courier Nodes in Threshold-Optimized DBR Protocol for Underwater Wireless Sensor Networks , 2014, Int. J. Distributed Sens. Networks.

[13]  Beng Chin Ooi,et al.  ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects , 2008, SIGMOD Conference.

[14]  Nectaria Tryfona,et al.  Modeling, storing and mining moving object databases , 2004, Proceedings. International Database Engineering and Applications Symposium, 2004. IDEAS '04..

[15]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.

[16]  Ge Yu,et al.  Continuous visible k nearest neighbor query on moving objects , 2014, Inf. Syst..

[17]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[18]  Jianliang Xu,et al.  Data Management in Location-Dependent Information Services , 2002, IEEE Pervasive Comput..

[19]  Nick Roussopoulos,et al.  K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.

[20]  Roger Zimmermann,et al.  Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks , 2011, IEEE Transactions on Knowledge and Data Engineering.

[21]  Bernhard Seeger,et al.  Efficient Computation of Reverse Skyline Queries , 2007, VLDB.

[22]  Bernhard Seeger,et al.  Continuous queries on trajectories of moving objects , 2012, IDEAS '12.