A Spatial Skyline Query for a Group of Users Having Different Positions

We consider a problem of skyline query of a spatial database. Assume that members of a multidisciplinary task force team located at different offices want to put together in a restaurant to hold a lunch-on meeting. In this situation, we should select a good restaurant whose location is convenient for each member. Skyline query is helpful for finding a good restaurant. We can compute a set of skyline restaurants based on non-spatial attributes such as price and rating by using conventional skyline queries. However, conventional skyline queries do not consider distance from each user, which must be important for selecting a restaurant in the example. If users' locations are different, the comparison of restaurant's location is complicated. For example, if one restaurant is very close to one user, it may be far from another user. In this paper, we consider a spatial skyline query for a group of users having different positions. The proposed method selects a set of spatial objects whose location for the group is not dominated by another spatial objects.

[1]  Jan Chomicki,et al.  Skyline with presorting , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[2]  Ken C. K. Lee,et al.  Location-Dependent Skyline Query , 2008, The Ninth International Conference on Mobile Data Management (mdm 2008).

[3]  Yoshiharu Ishikawa,et al.  Skyline queries based on user locations and preferences for making location-based recommendations , 2009, LBSN '09.

[4]  Christian Böhm,et al.  A cost model for nearest neighbor search in high-dimensional data space , 1997, PODS.

[5]  Yunjun Gao,et al.  Direction-based spatial skylines , 2010, MobiDE '10.

[6]  Maytham Safar,et al.  Optimized skyline queries on road networks using nearest neighbors , 2011, Personal and Ubiquitous Computing.

[7]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[8]  Kyriakos Mouratidis,et al.  Aggregate nearest neighbor queries in spatial databases , 2005, TODS.

[9]  Cyrus Shahabi,et al.  VoR-tree , 2010, Proc. VLDB Endow..

[10]  Seung-won Hwang,et al.  Spatial Skyline Queries: An Efficient Geometric Algorithm , 2009, SSTD.

[11]  Jarek Gryz,et al.  Maximal Vector Computation in Large Data Sets , 2005, VLDB.

[12]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

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

[14]  Anthony K. H. Tung,et al.  Finding k-dominant skylines in high dimensional space , 2006, SIGMOD Conference.

[15]  Heng Tao Shen,et al.  Multi-source Skyline Query Processing in Road Networks , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[16]  Bernhard Seeger,et al.  An optimal and progressive algorithm for skyline queries , 2003, SIGMOD '03.

[17]  Christian S. Jensen,et al.  In-Route Skyline Querying for Location-Based Services , 2004, W2GIS.

[18]  Beng Chin Ooi,et al.  Efficient Progressive Skyline Computation , 2001, VLDB.

[19]  Yuan-Ko Huang,et al.  Continuous distance-based skyline queries in road networks , 2012, Inf. Syst..

[20]  Xuemin Lin,et al.  Selecting Stars: The k Most Representative Skyline Operator , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[21]  Cyrus Shahabi,et al.  The spatial skyline queries , 2006, VLDB.

[22]  Anthony K. H. Tung,et al.  On High Dimensional Skylines , 2006, EDBT.

[23]  Donald Kossmann,et al.  Shooting Stars in the Sky: An Online Algorithm for Skyline Queries , 2002, VLDB.

[24]  Jonathan Goldstein,et al.  When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.