Please use this identifier to cite or link to this item:
|Title:||Cooperative scalable moving continuous query processing||Authors:||Li, X.
moving continuous query
|Issue Date:||2012||Citation:||Li, X., Karras, P., Shi, L., Tan, K.-L., Jensen, C.S. (2012). Cooperative scalable moving continuous query processing. Proceedings - 2012 IEEE 13th International Conference on Mobile Data Management, MDM 2012 : 69-78. ScholarBank@NUS Repository. https://doi.org/10.1109/MDM.2012.20||Abstract:||A range of applications call for a mobile client to continuously monitor others in close proximity. Past research on such problems has covered two extremes: It has offered totally centralized solutions, where a server takes care of all queries, and totally distributed solutions, in which there is no central authority at all. Unfortunately, none of these two solutions scales to intensive moving object tracking applications, where each client poses a query. In this paper, we formulate the moving continuous query (MCQ) problem and propose a balanced model where servers cooperatively take care of the global view and handle the majority of the workload. Meanwhile, moving clients, having basic memory and computation resources, handle small portions of the workload. This model is further enhanced by dynamic region allocation and grid size adjustment mechanisms that reduce the communication and computation cost for both servers and clients. An experimental study demonstrates that our approaches offer better scalability than competitors. © 2012 IEEE.||Source Title:||Proceedings - 2012 IEEE 13th International Conference on Mobile Data Management, MDM 2012||URI:||http://scholarbank.nus.edu.sg/handle/10635/41973||ISBN:||9780769547138||DOI:||10.1109/MDM.2012.20|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2021
checked on Dec 2, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.