Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 17th International Conference on Data Engineering
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Continuous Skyline Queries for Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Branch-and-bound processing of ranked queries
Information Systems
Continuous monitoring of skyline query over highly dynamic moving objects
MobiDE '07 Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access
Bandwidth-constrained distributed skyline computation
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
On processing location based top-k queries in the wireless broadcasting system
Proceedings of the 2010 ACM Symposium on Applied Computing
Identifying the most influential data objects with reverse top-k queries
Proceedings of the VLDB Endowment
An optimal strategy for monitoring top-k queries in streaming windows
Proceedings of the 14th International Conference on Extending Database Technology
Distributed top-k query processing by exploiting skyline summaries
Distributed and Parallel Databases
Efficient processing of top-k join queries by attribute domain refinement
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Branch-and-bound algorithm for reverse top-k queries
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Discovering influential data objects over time
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
In typical mobile applications, mobile users seek points of interest in their vicinity (e.g., nearby restaurants) that best match their preferences. We assume a set of points of interest described by a combination of static and dynamic attributes, and a set of mobile users mi, each associated with a weighting vector wi, which expresses mi's preferences over the aforementioned attribute set. The best points of interest for each mobile user correspond to the results of a top-k query, defined by the weighting vector wi, which is performed over the combined set of static and dynamic attributes. The dynamic attribute is the current distance between the mobile user and the point of interest. Under these assumptions, the potential customers of a given point of interest q are the mobile users whose weighting vectors wi belong to the reverse top-k set of q. In this paper, we define the distance-based reverse top-k query suitable for mobile environments. The problem we target is given a query point q, how to efficiently monitor q's distance-based reverse top-k result set. To address this problem, we introduce novel algorithms that enable efficient monitoring of distance-based reverse top-k result sets over mobile devices. Our experimental evaluation demonstrates the efficiency of our techniques for a wide variety of diverse setups.