Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: k-closest pair query is a useful type of query in many practical applications involving spatial data for decision making. The traditional techniques to handle k-closest pair queries generally assume that the objects are static. ,  study the problem of k-closest pair monitoring (kCPM) over moving objects. Aiming at reducing communication cost for location updates beten the clients and the server, our proposed kCPM approach achieves high monitoring accuracy with less CPU utilization compared to existing periodical location update schemes.
['Manli Zhu', 'Dik Lun Lee', 'Jun Zhang']
I am writing a research paper on a idea k-Closest Pair Query Monitoring Over Moving Objects
[{"from": "human", "value": "I am writing a research paper on a idea k-Closest Pair Query Monitoring Over Moving Objects"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: k-closest pair query is a useful type of query in many practical applications involving spatial data for decision making. The traditional techniques to handle k-closest pair queries generally assume that the objects are static. ,  study the problem of k-closest pair monitoring (kCPM) over moving objects. Aiming at reducing communication cost for location updates beten the clients and the server, our proposed kCPM approach achieves high monitoring accuracy with less CPU utilization compared to existing periodical location update schemes."}]