Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
