• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.79-86
• /
• 2009

The tuple of constraint database consists of constraint logical formula and it could process the presentation and query of the constraint database simply. Query operation processing shall include the constraint formula between related tuple such as selection, union, intersection of spatial data through the constraint database. However, this could produce the increasing of duplicated or unnecessary data. Hence, it will drive up the cost as per quality. This paper identified problems regarding query processing result in the constraint database. Also this paper suggested the tuple minimization summary method for result relation and analyzed the effects for efficient query processing. We were able to identify that the effectiveness of the query processing was enhanced by eliminating unnecessary constraint formula of constraint relation using the tuple minimization method.

• Journal of the Korean Home Economics Association
• /
• v.46 no.9
• /
• pp.125-135
• /
• 2008

The purpose of this study was to examine the effects of young children's age and information processing style in understanding spatial coordinates. For sampling the subjects of this study, Korean version K-ABC Intelligence Test(Moon, Soo-Back, 1997)was conducted with 165 children aged 5-6 who were attending I and G kindergarten in D city. From this pool 30 children who possessed sequential processing style and 30 children who possessed simultaneous processing style were sampled. In order to analyze the understanding of spatial coordinates, a test tool was formulated according to methodology of Blades & Spencer(1989) which was modified. Acquired data was subjected to descriptive and comparative statistical analysis. The following conclusions were arrived at: Firstly, there was significant difference between 5-year-olds and 6-year-olds in understanding spatial coordinates. The 6-year-old group got statistically higher grades than the 5-year-old group in locating a point on the coordinate plane and reading the coordinate numbers. Secondly, there was significant difference between children's information processing style in understanding spatial coordinate. Children with high simultaneous-low sequential processing showed higher performance in locating a point on the coordinate plane and reading coordinate numbers than children with high sequential-low simultaneous processing. Thirdly, after verifying statistical significance of interactivity between young children's age and children's processing strength, there was significant interactive effects in both tasks.

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.53-60
• /
• 2018

This study describes a spatial web object retrieval system using Spark, an in - memory based distributed processing system. Development of social networks has created massive amounts of spatial web objects, and retrieval and analysis of data is difficult by using exist spatial web object retrieval systems. Recently, development of distributed processing systems supports the ability to analyze and retrieve large amounts of data quickly. Therefore, a method is promoted to search a large-capacity spatial web object by using the distributed processing system. Data is processed in block units, and one of these blocks is converted to RDD and processed in Spark. Regarding the discussed method, we propose a system in which each RDD consists of spatial web object index for the included data, dividing the entire spatial region into non-overlapping spatial regions, and allocating one divided region to one RDD. We propose a system that can efficiently use the distributed processing system by dividing space and increasing efficiency of searching the divided space. Additionally by comparing QP-tree with R-tree, we confirm that the proposed system is better for searching the spatial web objects; QP-tree builds index with both spatial and words information while R-tree build index only with spatial information.

• Spatial Information Research
• /
• v.20 no.3
• /
• pp.67-81
• /
• 2012

Due to the recent advancement of cloud computing, the research on database outsourcing has been actively done. Moreover, the number of users who utilize Location-based Services(LBS) has been increasing with the development in w ireless communication technology and mobile devices. Therefore, LBS providers attempt to outsource their spatial database to service provider, in order to reduce costs for data storage and management. However, because unauthorized access to sensitive data is possible in spatial database outsourcing, it is necessary to study on the preservation of a user's privacy. Thus, we, in this paper, propose a spatial data encryption scheme to produce outsourced database from an original database. We also propose a k-Nearest Neighbor(k-NN) query processing algorithm that efficiently performs k-NN by using the outsourced database. Finally, we show from performance analysis that our algorithm outperforms the existing one.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.162-169
• /
• 2009

The real-time traffic data is generated continuous and unbounded stream data type while intelligent transport system (ITS) needs to provide various and high quality services by combining with spatial information. Traditional database techniques in ITS has shortage for processing dynamic real-time stream data and static spatial data simultaneously. In this paper, we design and implement an advanced traffic monitoring system (ATMS) with the integration of existed data stream management system (DSMS) and spatial DBMS using IntraMap. Besides, the developed ATMS can deal with the stream data of DSMS, the trajectory data of relational DBMS, and the spatial data of SDBMS concurrently. The implemented ATMS supports historical and one time query, continuous query and combined query. Application programmer can develop various intelligent services such as moving trajectory tracking, k-nearest neighbor (KNN) query and dynamic intelligent navigation by using components of the ATMS.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.2 s.4
• /
• pp.85-88
• /
• 2000

GPS/GIS Related Information Technology evolves drastically and a great quantity of spatial information is available to users who require highly qualitative spatial information services. Hence the development of GIS tools that can improve position accuracy and maintenance efficiency is required. To meet various requirements from users. we developed a GPS data processing component based on OLE/COM by utilizing GDK which is a unique domestic GIS product. Also we developed an application package that includes the GPS data processing component to implement GPS into GIS. The development of GPS data processing component will contribute toward the expansion of component-wise GIS softwares.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1083-1097
• /
• 1998

The conventional geographic information systems(GIS) is a software which handles spatial and aspatial information of objects in the real world. The system can not support users time-varying information because it manipulates their snapshot data in the spatial database. Also even though it supports time-varying information, it is very limited and hs many difficulties in presenting and processing queries. This paper therefore describes an integrated spatiotemporal data model using loosely-coupled approach which is extended a time dimension for the previous spatial database and which handles time-varying historical information of spatial objects. Conclusionally this paper not only designed a data structure for spatiotemporal database, but also implemented spatial comparison operations varying over time.

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

In ubiquitous spatial computing environments, GeoSensor generates sensor data streams including spatial information as well as various conventional sensor data from RFID, WSN, Web CAM, Digital Camera, CCTV, and Telematics units. This GeoSensor enables the revitalization of various ubiquitous USN technologies and services on geographic information. In order to service the u-GIS applications based on GeoSensors, it is indispensable to efficiently process sensor data streams from GeoSensors of a wide area. In this paper, we propose a GeoSensor data stream processing system for u-GIS computing over real-time stream data from GeoSensors with geographic information. The proposed system provides efficient gathering, storing, and continuous query processing of GeoSensor data stream, and also makes it possible to develop diverse u-GIS applications meet each user requirements effectively.

• Journal of Korea Multimedia Society
• /
• v.22 no.12
• /
• pp.1466-1480
• /
• 2019

This paper addresses the efficient processing of all-farthest-neighbors (AFN) queries in spatial network databases. Given a set of data points P={p₁,p₂,…,p_|p|} in a spatial network, where the distance between two data points p and s, denoted by dist (p,s), is the length of the shortest path between them, an AFN query is defined as follows: find the farthest neighbor ω(p)∈P of each data point p such that dist(p,ω(p)) ≥ dist(p,s) for all s∈P. In this paper, we propose a shared execution algorithm called FAST (for All-Farthest-neighbors Search in spatial neTworks). Extensive experiments on real-world roadmaps confirm the efficiency and scalability of the FAST algorithm, while demonstrating a speedup of up to two orders of magnitude over a conventional solution.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1395-1409
• /
• 2006

A spatial data warehouse has spatial data cube composed of multi-dimensional data for efficient OLAP(On-Line Analytical Processing) operations. A spatial data cube supporting concept hierarchies holds huge amount of data so that many researches have studied a incremental update method for minimum modification of a spatial data cube. The Cube, however, compressed by eliminating prefix and suffix redundancy has coalescing paths that cause update inconsistencies for some updates can affect the aggregate value of coalesced cell that has no relationship with the update. In this paper, we propose incremental batch update method of a spatial data cube. The proposed method uses duplicated nodes and extended node structure to avoid update inconsistencies. If any collision is detected during update procedure, the shared node is duplicated and the duplicate is updated. As a result, compressed spatial data cube that includes concept hierarchies can be updated incrementally with no inconsistency. In performance evaluation, we show the proposed method is more efficient than other naive update methods.