Continuous Range Query Processing over Moving Objects
نویسندگان
چکیده
منابع مشابه
Distributed Continuous Range Query Processing on Moving Objects
Recent work on continuous queries has focused on processing queries in very large, mobile environments. In this paper, we propose a system leveraging the computing capacities of mobile devices for continuous range query processing. In our design, continuous range queries are mainly processed on the mobile device side, which is able to achieve real-time updates with minimum server load. Our work...
متن کاملContinuous Reverse Skyline Query Processing over Moving Objects in LBS
As the variant of a skyline query, a reverse skyline query has been studied. However, the existing methods for processing a reverse skyline query have the limitation of service domains and require the high costs of computation to provide various location-based services. In this paper, we propose a new reverse skyline query processing method that efficiently processes a query over the moving obj...
متن کاملContinuous Range Query Processing for Network Constrained Mobile Objects
In contrast to regular queries that are evaluated only once, a continuous query remains active over a period of time and has to be continuously evaluated to provide up to date results. We propose a method for continuous range query processing for different types of queries, characterized by mobility of objects and/or queries which follow paths in an underlying spatial network. The method assume...
متن کاملMoving Range Queries over RFID Monitored Objects
As a promising technology for monitoring and tracing the product flows and human activities, Radio Frequency Identification (RFID) has received much attention within database community. Moving range query over RFID data streams is one of the most important spatio-temporal queries to support valuable information analysis. However, the uncertainty of the monitored object location challenges the q...
متن کاملContinuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points in P and their closest medoid. Finding the optimal k medoids is NP hard, and existing algorithms aim at approximate answers, i.e., they compute medoids that achieve a small, yet not minimal, average distance. Similarl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2008
ISSN: 0916-8532,1745-1361
DOI: 10.1093/ietisy/e91-d.11.2727