Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
Data structures for mobile data
Journal of Algorithms
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Multiple aggregations over data streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Semantics and evaluation techniques for window aggregates in data streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Processing Moving Queries over Moving Objects Using Motion-Adaptive Indexes
IEEE Transactions on Knowledge and Data Engineering
State-slice: new paradigm of multi-query optimization of window-based stream queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Influence zone: Efficiently processing reverse k nearest neighbors queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
| Hi-index | 0.00 |
A traditional query returns a set of objects that satisfy user defined criteria at the time query was issued. The results are based on the values of objects at query time and may be affected by outliers. Intuitively, an object better meets the user's needs if it persistently satisfies the criteria, i.e., it satisfies the criteria for majority of the time in the past T time units. In this paper, we propose a measure named loyalty that reflects how persistently an object satisfies the criteria. Formally, the loyalty of an object is the total time (in past T time units) it satisfies the query criteria. In this paper, we study top-k loyalty queries over sliding windows that continuously report k objects with the highest loyalties. Each object issues an update when it starts satisfying the criteria or when it stops satisfying the criteria. We show that the lower bound cost of updating the results of a top-k loyalty query is O(logN), for each object update, where N is the number of updates issued in last T time units. We conduct a detailed complexity analysis and show that our proposed algorithm is optimal. Moreover, effective pruning techniques are proposed to improve the efficiency. We experimentally verify the effectiveness of the proposed approach by comparing it with a classic sweep line algorithm.