• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.336-339
• /
• 2013

Location-Based services that collect location information for moving object and utilize in real life are being used in many aspects by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive location of moving objects. This paper addresses algorithms that make index structure by using Douglas-Peucker Algorithm and process range query efficiently on moving objects trajectories. Our algorithms are going to make smaller size of index structure and process more efficiently.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.492-504
• /
• 2004

Recently, as growing of interest for LBS(location-based services) techniques, lots of works on moving objects that continuously change their information over time, have been performed briskly. Also, researches for NN(nearest neighbor) query which has often been used in LBS, are progressed variously However, the results of conventional NN Query processing techniques may be invalidated as the query and data objects move. Therefore, they are usually meaningless in moving object management system such as LBS. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet accurate and continuous query processing for moving objects. Our techniques include an Approximate CTNN(ACTNN) technique, which has quick response time, and an Exact CTNN(ECTNN) technique, which makes it possible to search nearest neighbor objects accurately. In order to evaluate the proposed techniques, we experimented with various datasets. Experimental results showed that the ECTNN technique has high accuracy, but has a little low performance for response time. Also the ACTNN technique has low accuracy comparing with the ECTNN, but has quick response time The proposed techniques can be applied to navigation system, traffic control system, distribution information system, etc., and specially are most suitable when both data and query are moving objects and when we already know their trajectory.

• Annual Conference on Human and Language Technology
• /
• 2001.10d
• /
• pp.76-82
• /
• 2001

최근 웹 문서의 규모가 커짐에 따라 높은 정확도를 필요로하는 정보검색시스템이 요구되고 있다. 구 색인은 정확도를 향상시킬 수 있는 방법으로 전통적으로 많이 사용되어 왔으며, 정보검색에서 사용하는 구는 크게 통계적인 구와 구문적인 구로 나눌 수 있다. 한국에서는 주최 복합명사를 처리하거나, 구문적인 구를 이용한 방법들만이 사용되어 왔고, 통계적인 구를 이용한 검색은 연구되지 않았다. 질의에 존재하는 구의 위치관계와 문서에 존재하는 구의 위치관계가 서로 동일하다면 그 문서는 그 질의와 더욱 유사할 것이라 판단하고, 본 논문에서는 통계적인 구에서 구 구성요소간의 위치관계를 고려한 정보검색 시스템을 제안한다. 명사구 이치의 유용한 구를 생성하기 위하여 내용어를 색인했으며 색인어간의 거리와 순서를 고려하여 가중치를 부여하였다. 명사구와 내용어에 기반한 구를 사용한 각각의 실험에서 거리에 따른 가중치를 부여하는 방법이 거리를 무시한 방법에 비해서 효과적이었고 구 구성요소간의 위치관계를 고려하는 것이 성능향상의 주요한 요인임을 알 수 있었다. 또한 명사위주의 질의에서는 내용어보다는 명사만을 색인하는 것이 효과적임을 알 수 있었다.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.9-18
• /
• 2009

Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.63-76
• /
• 2005

Recently, the wireless positioning techniques and mobile computing techniques were developed with rapidly to use location data of moving objects. Also, the demand for LBS(Location Based Services) which uses location data of moving objects is increasing rapidly. In order to support various LBS, a system that can store and retrieve location data of moving objects efficiently is required necessarily. The more the number of moving objects is numerous and the more periodical sampling of locations is frequent, the more location data of moving objects become very large. Hence the system should be able to efficiently manage mass location data, support various spatio-temporal queries for LBS, and solve the uncertainty problem of moving objects. Therefore, in this paper, we presented a hash technique, a clustering technique and a trajectory search technique to manage location data of moving objects efficiently And, we have developed a Mass Moving Object Location Data Management System, which is a disk-based system, that can store and retrieve location data of mass moving objects efficiently and support the query for spatio-temporal data and the past location data with uncertainty. By analying the performance of the Mass Moving Object Locations Management system and the SQL-Server, we can find that the performance of our system for storing and retrieving location data of moving objects was about 5% and 300% better than the SQL-Server, repectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.271-273
• /
• 1998

본 논문에서는 최근 발달된 컴퓨터 버전의 이미지 처리 기법들을 활용하여 이미지의 기본 속성(primary features)을 정의하고 이미지 검색에서의 효용성을 실험을 통하여 분석한 결과를 제시한다. 기본 속성으로는 색상, 질감, 모자익, 위치정보등을 선정하여 샘플 이미지들에 대한 속성값들을 데이터베이스로 저장하고 시각 질의들을 처리하는 검색 시스템 원형을 구현하여 실험하였다. 정의된 4가지 기본적 속성 중 색상, 질감, 모자익을 이용하는 내용 기반 검색이 기존 시스템과 비교하여 검색 적중률이 향상됨을 보였다. 제안된 이미지의 기본 속성들을 이용하면 실제 이미지 데이터베이스에 대한 질의 처리에 활용할 수 있는 인덱스를 구성할 수 있을 것이다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.3
• /
• pp.35-47
• /
• 2004

Telematics and LBS is one of rapidly emerged technology domains. In order to efficiently construct them, moving object technology which manages huge volume of real-time location data is required. Especially, the query which obtains special sorts of information closely related to the detailed applications is required in order to effectively retrieve and analyze the location data for moving object in logistics domain. It has also complex query structure comparing to the conventional database query. The approach using the standard database query language, like SQL, can be considered as an effective alternative choice. In this paper, we not only propose a new query language, entitled as MOQL based on SQL, for the query processing of the vehicle monitoring and control in e-Logistics but also design and implement the query processor.

• 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 Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.77-89
• /
• 2005

Recently, application area on the Location Based System(LBS) is increasing because of development of mobile-communication and GPS technique. Previous studies on the index of moving objects are classified as either index for past trajectories or current/future positions. It is necessary to develop a unified index because many applications need to process queries about both past trajectories and current/future positions at the same time. In this paper, the past trajectories of moving objects are represented as line segments and the current and future positions are represented as the function of time. We propose a new index called PCR-tree(Past, Current R-tree) for unification of past, current and future positions. Nodes of the index have bounding boxes that enclose all position data and entries in the nodes are accessed with only one interface. We implement the proposed index and show a feasibility of processing the queries about temporal-spatial domain with the query tool which we develop.

• The KIPS Transactions:PartD
• /
• v.14D no.3 s.113
• /
• pp.273-284
• /
• 2007

RFID middleware systems collect and filter the RFID streaming data gathered continuously by numerous readers in order to process requests from applications. These requests are called continuous queries because they are kept on executing during certain periods. To enhance the performance of the middleware, it is required to build an index to process the continuous queries efficiently. Several approaches of building an index on not data records but queries, called Query Index, are proposed and widely used for evaluating continuous queries over streaming data. The EPCglobal proposed an Event Cycle Specification (ECSpec) model, which is a standard query interface for RFID applications. Continuous queries based on ECSpec consist of a large number of segments for representing the query conditions. The problem with using any of the existing query indexes on these continuous queries is that it takes a long time to build the index because it is necessary to insert a large number of segments into the index. To solve this problem, we propose an Aggregate Transformation that converts a group of segments into a compressed data which is representative of the segments. We compare the performance of a transformed index with the existing query indexes.