The development of spatio-temporal database systems is primarily motivated by applications which track and present mobile objects. In this paper, solutions for establishing the moving object database based on GPS/GIS ...The development of spatio-temporal database systems is primarily motivated by applications which track and present mobile objects. In this paper, solutions for establishing the moving object database based on GPS/GIS environment are presented, and a data modeling of moving object is given by using Temporal logical to extent the query language, finally the application model in cargo delivery system is shown.展开更多
In this paper we propose four dimensional (4D) operators, which can be used to deal with sequential changes of topological relationships between 4D moving objects and we call them 4D development operators. In contrast...In this paper we propose four dimensional (4D) operators, which can be used to deal with sequential changes of topological relationships between 4D moving objects and we call them 4D development operators. In contrast to the existing operators, we can apply the operators to real applications on 4D moving objects. We also propose a new approach to define them. The approach is based on a dimension separated method, which considers x y coordinates and z coordinates separately. In order to show the applicability of our operators, we show the algorithms for the proposed operators and development graph between 4D moving objects.展开更多
With the rapid advance of wireless communication, tracking the positions of the moving objects is becoming increasingly feasible and necessary. Because a large number of people use mobile phones, we must handle a larg...With the rapid advance of wireless communication, tracking the positions of the moving objects is becoming increasingly feasible and necessary. Because a large number of people use mobile phones, we must handle a large moving object database as well as the following problems. How can we provide the customers with high quality service, that means, how can we deal with so many enquiries within as less time as possible? Because of the large number of data, the gap between CPU speed and the size of main memory has increasing considerably. One way to reduce the time to handle enquiries is to reduce the I/O number between the buffer and the secondary storage.An effective clustering of the objects can minimize the I/O cost between them. In this paper, according to the characteristic of the moving object database, we analyze the objects in buffer, according to their mappings in the two dimension coordinate, and then develop a density based clustering method to effectively reorganize the clusters. This new mechanism leads to the less cost of the I/O operation and the more efficient response to enquiries.展开更多
Emerging technologies of wireless and mobile communication enable people to accumulate a large volume of time-stamped locations,which appear in the form of a continuous moving object trajectory.How to accurately predi...Emerging technologies of wireless and mobile communication enable people to accumulate a large volume of time-stamped locations,which appear in the form of a continuous moving object trajectory.How to accurately predict the uncertain mobility of objects becomes an important and challenging problem.Existing algorithms for trajectory prediction in moving objects databases mainly focus on identifying frequent trajectory patterns,and do not take account of the effect of essential dynamic environmental factors.In this study,a general schema for predicting uncertain trajectories of moving objects with dynamic environment awareness is presented,and the key techniques in trajectory prediction arc addressed in detail.In order to accurately predict the trajectories,a trajectory prediction algorithm based on continuous time Bayesian networks（CTBNs） is improved and applied,which takes dynamic environmental factors into full consideration.Experiments conducted on synthetic trajectory data verify the effectiveness of the improved algorithm,which also guarantees the time performance as well.展开更多
To incorporate indeterminacy in spatio-temporal database systems, grey modeling method is used for the calculations of the discrete models of indeterminate two dimension continuously moving objects. The Grey Model GM...To incorporate indeterminacy in spatio-temporal database systems, grey modeling method is used for the calculations of the discrete models of indeterminate two dimension continuously moving objects. The Grey Model GM（ 1,1 ） model generated from the snapshot sequence reduces the randomness of discrete snapshot and generates the holistic measure of object＇s movements. Comparisons to traditional linear models show that when information is limited this model can be used in the interpolation and near future prediction of uncertain continuously moving spatio-temporal objects.展开更多
Moving object database (MOD) engine is the foundation of Location-Based Service (LBS) information systems. Continuous queries are important in spatial-temporal reasoning of a MOD. The communication costs were the bott...Moving object database (MOD) engine is the foundation of Location-Based Service (LBS) information systems. Continuous queries are important in spatial-temporal reasoning of a MOD. The communication costs were the bottleneck for improving query efficiency until the rectangular safe region algorithm partly solved this problem. However, this algorithm can be further improved, as we demonstrate with the dynamic interval based continuous queries algorithm on moving objects. Two components, circular safe region and dynamic intervals were adopted by our algorithm. Theoretical proof and experimental results show that our algorithm substantially outperforms the traditional periodic monitoring and the rectangular safe region algorithm in terms of monitoring accuracy, reducing communication costs and server CPU time. Moreover, in our algorithm, the mobile terminals do not need to have any computational ability.展开更多
Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future ...Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future trajectories of the objects. In this paper, we propose an original data access method, the ANR-tree, which supports predictive queries. We focus on real life environments, where the objects move within constrained networks, such as vehicles on roads. We introduce a simulation-based prediction model based on graphs of cellular automata, which makes full use of the network constraints and the stochastic traffic behavior. Our technique differs strongly from the linear prediction model, which has low prediction accuracy and requires frequent updates when applied to real traffic with velocity changing frequently. The data structure extends the R-tree with adaptive units which group neighbor objects moving in the similar moving patterns. The predicted movement of the adaptive unit is not given by a single trajectory, but instead by two trajectory bounds based on different assumptions on the traffic conditions and obtained from the simulation. Our experiments, carried on two different datasets, show that the ANR-tree is essentially one order of magnitude more efficient than the TPR-tree, and is much more scalable.展开更多
In recent years, management of moving objects has emerged as an active topic of spatial access methods. Various data structures （indexes） have been proposed to handle queries of moving points, for example, the well-...In recent years, management of moving objects has emerged as an active topic of spatial access methods. Various data structures （indexes） have been proposed to handle queries of moving points, for example, the well-known B^x-tree uses a novel mapping mechanism to reduce the index update costs. However, almost all the existing indexes for predictive queries are not applicable in certain circumstances when the update frequencies of moving objects become highly variable and when the system needs to balance the performance of updates and queries. In this paper, we introduce two kinds of novel indexes, named B^y-tree and αB^y-tree. By associating a prediction life period with every moving object, the proposed indexes are applicable in the environments with highly variable update frequencies. In addition, the αB^y-tree can balance the performance of updates and queries depending on a balance parameter. Experimental results show that the B^y-tree and αB^y-tree outperform the B^x-tree in various conditions.展开更多
Spatio-temporal databases aim at appropriately managing moving objects so as to support various types of queries. While much research has been conducted on developing query processing techniques, less effort has been ...Spatio-temporal databases aim at appropriately managing moving objects so as to support various types of queries. While much research has been conducted on developing query processing techniques, less effort has been made to address the issue of when and how to update location information of moving objects. Previous work shifts the workload of processing updates to each object which usually has limited CPU and battery capacities. This results in a tremendous processing overhead for each moving object. In this paper, we focus on designing efficient update strategies for two important types of moving objects, free-moving objects(FMOs) and network-constrained objects(NCOs), which are classified based on object movement models. For FMOs, we develop a novel update strategy, namely the FMO update strategy(FMOUS), to explicitly indicate a time point at which the object needs to update location information. As each object knows in advance when to update(meaning that it does not have to continuously check), the processing overhead can be greatly reduced. In addition, the FMO update procedure(FMOUP) is designed to efficiently process the updates issued from moving objects. Similarly, for NCOs, we propose the NCO update strategy(NCOUS) and the NCO update procedure(NCOUP) to inform each object when and how to update location information. Extensive experiments are conducted to demonstrate the effectiveness and efficiency of the proposed update strategies.展开更多
Skyline query is important in the circumstances that require the support of decision making. The existing work on skyline queries is based mainly on the assumption that the datasets are static. Querying skylines over ...Skyline query is important in the circumstances that require the support of decision making. The existing work on skyline queries is based mainly on the assumption that the datasets are static. Querying skylines over moving objects, however, is also important and requires more attention. In this paper, we propose a framework, namely PRISMO, for processing predictive skyline queries over moving objects that not only contain spatio-temporal information, but also include non-spatial dimensions, such as other dynamic and static attributes. We present two schemes, RBBS （branch-and-bound skyline with rescanning and repacking） and TPBBS （time-parameterized branch- and-bound skyline）, each with two alternative methods, to handle predictive skyline computation. The basic TPRBS is further extended to TPBBSE （TPBBS with expansion） to enhance the performance of memory space consumption and CPU time. Our schemes are flexible and thus can process point, range, and subspace predictive skyline queries. Extensive experiments show that our proposed schemes can handle predictive skyline queries effectively, and that TPBBS significantly outperforms RBBS.展开更多
基金Supported by the National Science Research Project (No.2001BA205A18)
文摘The development of spatio-temporal database systems is primarily motivated by applications which track and present mobile objects. In this paper, solutions for establishing the moving object database based on GPS/GIS environment are presented, and a data modeling of moving object is given by using Temporal logical to extent the query language, finally the application model in cargo delivery system is shown.
基金This work is Supported by U niversity IT Research Center Projectand KOSEF RRC Projectin Korea
文摘In this paper we propose four dimensional (4D) operators, which can be used to deal with sequential changes of topological relationships between 4D moving objects and we call them 4D development operators. In contrast to the existing operators, we can apply the operators to real applications on 4D moving objects. We also propose a new approach to define them. The approach is based on a dimension separated method, which considers x y coordinates and z coordinates separately. In order to show the applicability of our operators, we show the algorithms for the proposed operators and development graph between 4D moving objects.
基金This work is supported by University IT Research Center Project in KOREA.
文摘With the rapid advance of wireless communication, tracking the positions of the moving objects is becoming increasingly feasible and necessary. Because a large number of people use mobile phones, we must handle a large moving object database as well as the following problems. How can we provide the customers with high quality service, that means, how can we deal with so many enquiries within as less time as possible? Because of the large number of data, the gap between CPU speed and the size of main memory has increasing considerably. One way to reduce the time to handle enquiries is to reduce the I/O number between the buffer and the secondary storage.An effective clustering of the objects can minimize the I/O cost between them. In this paper, according to the characteristic of the moving object database, we analyze the objects in buffer, according to their mappings in the two dimension coordinate, and then develop a density based clustering method to effectively reorganize the clusters. This new mechanism leads to the less cost of the I/O operation and the more efficient response to enquiries.
基金supported by the National Natural Science Foundation of China (Nos.61100045,61165013,61003142,60902023,and 61171096)the China Postdoctoral Science Foundation (Nos.20090461346,201104697)+3 种基金the Youth Foundation for Humanities and Social Sciences of Ministry of Education of China (No.10YJCZH117)the Fundamental Research Funds for the Central Universities (Nos.SWJTU09CX035,SWJTU11ZT08)Zhejiang Provincial Natural Science Foundation of China (Nos.Y1100589,Y1080123)the Natural Science Foundation of Ningbo,China (No.2011A610175)
文摘Emerging technologies of wireless and mobile communication enable people to accumulate a large volume of time-stamped locations,which appear in the form of a continuous moving object trajectory.How to accurately predict the uncertain mobility of objects becomes an important and challenging problem.Existing algorithms for trajectory prediction in moving objects databases mainly focus on identifying frequent trajectory patterns,and do not take account of the effect of essential dynamic environmental factors.In this study,a general schema for predicting uncertain trajectories of moving objects with dynamic environment awareness is presented,and the key techniques in trajectory prediction arc addressed in detail.In order to accurately predict the trajectories,a trajectory prediction algorithm based on continuous time Bayesian networks（CTBNs） is improved and applied,which takes dynamic environmental factors into full consideration.Experiments conducted on synthetic trajectory data verify the effectiveness of the improved algorithm,which also guarantees the time performance as well.
文摘To incorporate indeterminacy in spatio-temporal database systems, grey modeling method is used for the calculations of the discrete models of indeterminate two dimension continuously moving objects. The Grey Model GM（ 1,1 ） model generated from the snapshot sequence reduces the randomness of discrete snapshot and generates the holistic measure of object＇s movements. Comparisons to traditional linear models show that when information is limited this model can be used in the interpolation and near future prediction of uncertain continuously moving spatio-temporal objects.
文摘Moving object database (MOD) engine is the foundation of Location-Based Service (LBS) information systems. Continuous queries are important in spatial-temporal reasoning of a MOD. The communication costs were the bottleneck for improving query efficiency until the rectangular safe region algorithm partly solved this problem. However, this algorithm can be further improved, as we demonstrate with the dynamic interval based continuous queries algorithm on moving objects. Two components, circular safe region and dynamic intervals were adopted by our algorithm. Theoretical proof and experimental results show that our algorithm substantially outperforms the traditional periodic monitoring and the rectangular safe region algorithm in terms of monitoring accuracy, reducing communication costs and server CPU time. Moreover, in our algorithm, the mobile terminals do not need to have any computational ability.
基金Partly supported by the National Natural Science Foundation of China （Grant No. 60573091）, the Key Project of Ministry of Education of China （Grant No. 03044）, Program for New Century Excellent Talents in University （NCET）, Program for Creative Ph.D. Thesis in University. Acknowledgments The authors would like to thank Hai-Xun Wang from IBM T. J. Watson Research, Karine Zeitouni from PRISM, Versailles Saint- Quentin University in France and Stephane Grumbach from CNRS, LIAMA China for many helpful advices.
文摘Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future trajectories of the objects. In this paper, we propose an original data access method, the ANR-tree, which supports predictive queries. We focus on real life environments, where the objects move within constrained networks, such as vehicles on roads. We introduce a simulation-based prediction model based on graphs of cellular automata, which makes full use of the network constraints and the stochastic traffic behavior. Our technique differs strongly from the linear prediction model, which has low prediction accuracy and requires frequent updates when applied to real traffic with velocity changing frequently. The data structure extends the R-tree with adaptive units which group neighbor objects moving in the similar moving patterns. The predicted movement of the adaptive unit is not given by a single trajectory, but instead by two trajectory bounds based on different assumptions on the traffic conditions and obtained from the simulation. Our experiments, carried on two different datasets, show that the ANR-tree is essentially one order of magnitude more efficient than the TPR-tree, and is much more scalable.
基金supported in part by Program for Changjiang Scholars and Innovative Research Team in University (Grant No. IRT0652)the National Natural Science Foundation of China (Grant No. 60603044).
文摘In recent years, management of moving objects has emerged as an active topic of spatial access methods. Various data structures （indexes） have been proposed to handle queries of moving points, for example, the well-known B^x-tree uses a novel mapping mechanism to reduce the index update costs. However, almost all the existing indexes for predictive queries are not applicable in certain circumstances when the update frequencies of moving objects become highly variable and when the system needs to balance the performance of updates and queries. In this paper, we introduce two kinds of novel indexes, named B^y-tree and αB^y-tree. By associating a prediction life period with every moving object, the proposed indexes are applicable in the environments with highly variable update frequencies. In addition, the αB^y-tree can balance the performance of updates and queries depending on a balance parameter. Experimental results show that the B^y-tree and αB^y-tree outperform the B^x-tree in various conditions.
基金supported by the National Science Council of Taiwan(Nos.NSC-102-2119-M-244-001 and MOST-103-2119-M-244-001)
文摘Spatio-temporal databases aim at appropriately managing moving objects so as to support various types of queries. While much research has been conducted on developing query processing techniques, less effort has been made to address the issue of when and how to update location information of moving objects. Previous work shifts the workload of processing updates to each object which usually has limited CPU and battery capacities. This results in a tremendous processing overhead for each moving object. In this paper, we focus on designing efficient update strategies for two important types of moving objects, free-moving objects(FMOs) and network-constrained objects(NCOs), which are classified based on object movement models. For FMOs, we develop a novel update strategy, namely the FMO update strategy(FMOUS), to explicitly indicate a time point at which the object needs to update location information. As each object knows in advance when to update(meaning that it does not have to continuously check), the processing overhead can be greatly reduced. In addition, the FMO update procedure(FMOUP) is designed to efficiently process the updates issued from moving objects. Similarly, for NCOs, we propose the NCO update strategy(NCOUS) and the NCO update procedure(NCOUP) to inform each object when and how to update location information. Extensive experiments are conducted to demonstrate the effectiveness and efficiency of the proposed update strategies.
基金supported by the National Natural Science Foundation of China (Nos. 60603044 and 60803003)the Program for Changjiang Scholars and Innovative Research Team in University(No. IRT0652)
文摘Skyline query is important in the circumstances that require the support of decision making. The existing work on skyline queries is based mainly on the assumption that the datasets are static. Querying skylines over moving objects, however, is also important and requires more attention. In this paper, we propose a framework, namely PRISMO, for processing predictive skyline queries over moving objects that not only contain spatio-temporal information, but also include non-spatial dimensions, such as other dynamic and static attributes. We present two schemes, RBBS （branch-and-bound skyline with rescanning and repacking） and TPBBS （time-parameterized branch- and-bound skyline）, each with two alternative methods, to handle predictive skyline computation. The basic TPRBS is further extended to TPBBSE （TPBBS with expansion） to enhance the performance of memory space consumption and CPU time. Our schemes are flexible and thus can process point, range, and subspace predictive skyline queries. Extensive experiments show that our proposed schemes can handle predictive skyline queries effectively, and that TPBBS significantly outperforms RBBS.
