• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3087-3103
• /
• 2022

Nearest neighbor query in location-based services has become a popular application. Aiming at the shortcomings of the privacy protection algorithms of traditional ciphertext nearest neighbor query having the high system overhead because of the usage of the double Hilbert curves and having the inaccurate query results in some special circumstances, a privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve has been proposed. This algorithm uses a single Hilbert curve to transform the two-dimensional coordinates of the points of interest into Hilbert values, and then encrypts them by the order preserving encryption scheme to obtain the one-dimensional ciphertext data which can be compared in numerical size. Then stores the points of interest as elements composed of index value and the ciphertext of the other information about the points of interest on the server-side database. When the user needs to use the nearest neighbor query, firstly calls the approximate nearest neighbor query algorithm proposed in this paper to query on the server-side database, and then obtains the approximate nearest neighbor query results. After that, the accurate nearest neighbor query result can be obtained by calling the precision processing algorithm proposed in this paper. The experimental results show that this privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve is not only feasible, but also optimizes the system overhead and the accuracy of ciphertext nearest neighbor query result.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.39-50
• /
• 2004

GML proposed to offer interoperability of geography information is specifying various dynamic object schema for application in the wireless environment. These GML dynamic object schema supports the expression of moving objects that the position and shape change consecutively over time, so practical use of GML is increased in location-based service that provides various application services based on location information of moving objects. In particular, the conventional query languages about GML have been studied with priority given to the integration of geographic information, the support of spatial operations, and etc. However, it lacks the support for moving objects queries. Therefore, in this paper, we propose the moving objects query language that supports moving objects queries for GML documents by extension of XQuery that is standard in query language. Also, data model, algebra operation and various moving objects operators for the proposed query language are designed, and we apply the proposed query language to tornado government organization system to show that the proposed query language can be used effectively in various location-based service.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.203-209
• /
• 2012

Recently, k-nearest neighbors query methods based on wireless broadcasting environment are actively studied. The advantage of wireless broadcasting environment is the scalability that enables collective query processing for unspecified users connected to the server. However, in case existing k-NN query is applied in wireless broadcasting environment, there can be a disadvantage that backtracking may occur and consequently the query processing time is increasing. In this paper proposes a hierarchical bitmap-based spatial index in order to efficiently process the k-NN queries in wireless broadcasting environment. HBI reduces the bitmap size using such bitmap information and tree structure. As a result, reducing the broadcast cycle can reduce the client's tuning time and query processing time. In addition, since the locations of all the objects can be detected using bitmap information, it is possible to tune to necessary data selectively. For this paper, a test was conducted implementing HBI to k-NN query and the proposed technique was proved to be excellent by a performance evaluation.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.110-116
• /
• 2008

A RFID is an automatic data collection system based on the radio frequency and is the key technology of ubiquitous computing environments. Since the locations of objects attached by RFID tags can be acquired by readers, it is possible to query the locations of tags. To query tags efficiently, the data of RFID tags should be modeled and indexed. However, since the location information of tags, the predicates of queries, are differ from coordinates of moving objects, it is difficult to model tags under the concept of moving objects, In this paper, we propose the location model of tags to represents the trajectories of tags. The location model is composed of the set and graph based approaches.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.79-91
• /
• 2008

Recently, with highly Interest In Location-Based Service(LBS) utilizing location data of moving objects, the GALIS(Gracefully Aging Location Information System) which is a cluster-based distributed computing architecture was proposed as a more efficient location management system of moving objects. In the SLDS(Short-term location Data Subsystem) which Is a subsystem of the GALIS, since the SDP(Short-term Data Processor) Master transmits current location data and queries to every SDP Worker, the SDP Master reassembles and sends query results produced by SDP Workers to the client. However, the services are suspended during the SDP Master under failure and the response time to the client is increased if the load is concentrated on the SDP Master. Therefore, in this paper, the extended SLDS was designed and implemented to solve these problems. Though one SDP Master is under failure, the other can provide the services continually, and so the extended SLDS can guarantee the high reliability of the SLDS. The extended SLDS also can reduce the response time to the client by enabling two SDP Masters to perform the distributed query processing. Finally, we proved high reliability and high availability of the extended SLDS by implementing the current location data storage, query processing, and failure takeover scenarios. We also verified that the extended SLDS is more efficient than the original SLDS through the query processing performance evaluation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.10
• /
• pp.239-244
• /
• 2019

In recent mobile environments, query processing costs have been rapidly increasing as users request large amounts of queries. In addition, the server's performance is increasing for many users to handle high-capacity queries, but the workload is increasing continuously. To solve these problems, we use the wireless broadcasting environment. However, in a existing wireless broadcasting environment, servers have a problem sending all the objects they manage to their clients. Therefore, we propose a new R-Bcast combining the advantages of demand-based and wireless broadcasting. R-Bcast is a technique that protects query information and reduces query processing time. Experiments have proved that R-Bcast is superior to conventional techniques.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.677-680
• /
• 2004

In the mobile environment, according to the movement of the object, the query finds the nearest special object or place from object position. However, because query object moves continuously in the mobile environment, query demand changes according to the direction attribute of query object. Also, in the case of moving of query object and simply the minimum distance value of query result, sometimes we find the result against the query object direction. Especially, in most road condition, as user has to return after reaching U-turn area, user rather spends time and cost. Therefore, in order to solve those problems, in this paper we propose the nearest neighbor method considering moving object position and direction for mobile recommendation system.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.471-482
• /
• 2007

In this paper, we propose an efficient continuous range query processing scheme using a modified grid based query indexing to reduce storage spaces and to accelerate processing time. The proposed method has two major features. First, each query has a bit identifier and each cell in a grid has a bit pattern that consists of the bit identifiers of the queries. The bit patterns present the relationship between cells and queries. Using the bit patterns, we can compute quickly what queries overlap a cell in a grid and reduce the number of unnecessary operations by comparing the bit patterns without comparing the query identifiers when we compute the relation between cells and queries. Second, the management of cells in the grid by groups prevents from wasting the storage space through the increase of the length of the bit pattern and increasing the comparison costs of bit patterns. We show through the performance evaluation that the proposed method outperforms the existing methods.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.628-645
• /
• 2014

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.707-718
• /
• 2007

Recently, much studies for providing mobile users with suitable and useful content services, LBS(Location Based Service) corresponding to the change of users' location, are actively going on. First and foremost, this is basically owing to the progress of location management technologies such as GPS, mobile communication technology and the spread of personal devices like PDA and the cellular phones. Besides, the research scope of LBS has been changed from vehicle tracking and navigation services to intelligent and personalized services considering the changing information of conditions or environment where the users' are located. For example, it inputs the information such as heavy traffic, pollution, and accidents. The query languages which effectively search the stored vehicle and environment information have been studied depending on the increase of the information utilization. However, most of existing moving object query languages are not enough to provide a recommendation service for a user, because they can not be tested and evaluated in real world and did not consider changed environment information. In order to retrieve not only a vehicle location and environment condition but also use them, we suggest a moving object query language for recommendation service and implement a moving object query process system for supporting a query language. It can process a nearest neighbor query for recommendation service which considers various attributes such as a vehicle's location and direction, environment information. It can be applied to location based service application which utilizes the recommended factors based on environmental conditions.