A Framework for Generating Network-Based Moving Objects
Geoinformatica
Supporting ad-hoc ranking aggregates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Supporting top-K join queries in relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
On Monitoring the top-k Unsafe Places
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
| Hi-index | 0.00 |
With the wide usage of location tracking system, continuously mining relationships among moving objects over their location changes is possible and also important to many real applications. This paper shows a novel continuous location-based query, called continuous relational top-k query, or CRTQ, which continuously monitors the k moving objects with the most significant relations with other objects by user-defined relational group and score functions. Although this kind of query can be implemented as a special case of the top-k join query using SQL, this straight-forward way is too expensive to be applicable widely. This paper also discusses the properties of this novel query, which leads to the flexibility of the query and also the difficulty for a generalized solution. An efficient algorithm is proposed for a special type of CRTQ over spatial data set with closeness grouping function and monotone increasing score function. Finally the main contributions of this showcase and also our future research plans are discussed.