Learn More
Location Based Services (LBSs) have recently attracted much attention due to the advancement of GPS facilitates. In LBS, the private and confidential information of user may disclose to others since LBS need a user’s location. To protect the privacy of users, many cloaking algorithms have been proposed to hide user’s actual location. The(More)
Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks, like FNR-tree and MON-tree. But, because both FNR-tree and MON-tree store the moving object's(More)
In Location-Based Services (LBSs), users send location-based queries to LBS servers along with their exact locations, but the location information of the users can be misused by adversaries. In this regard, there must be a mechanism which can deal with the privacy protection of the users. In this paper, we propose a cloaking method considering both(More)
In Location-Based Services (LBSs), users send location-based queries to LBS servers along with their exact locations, but the location information of the users can be misused by adversaries. For this, a mechanism to deal with the users’ privacy protection is required. In this paper, we propose a new cloaking algorithm for privacy protection in LBSs.(More)
Because moving objects usually moves on spatial networks, efficient trajectory index structures are required to gain good retrieval performance on their trajectories. However, there has been little research on trajectory index structure for spatial networks, like road networks. In this paper, we propose an efficient trajectory index structure for moving(More)
In this paper, we propose a content-based retrieval system using moving objects’ trajectories video data. For this, we first present a spatio-temporal representation scheme which can efficiently deal with a single moving object as well as multiple moving objects. Secondly, we describe an efficient similar sub-trajectory retrieval scheme based on a new(More)
In this paper, we propose new query processing algorithms for typical spatial queries in SNDB, such as range search and k nearest neighbors (k-NN) search. Our two query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using a materialization-based(More)
As the development of IT and scientific technology, very large amounts of knowledge data are continuously being created and the big data era can be said to have arrived. Therefore, RDF store inserting and inquiring into knowledge bases has to be scaled up in order to deal with such large sources of data. To this end, we propose a scalable distributed RDF(More)