• Title/Summary/Keyword: spatial database

Search Result 1,133, Processing Time 0.029 seconds

Spatial View Materialization Technique by using R-Tree Reconstruction (R-tree 재구성 방법을 이용한 공간 뷰 실체화 기법)

  • Jeong, Bo-Heung;Bae, Hae-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.8D no.4
    • /
    • pp.377-386
    • /
    • 2001
  • In spatial database system, spatial view is supported for efficient access method to spatial database and is managed by materialization and non-materialization technique. In non-materialization technique, repeated execution on the same query makes problems such as the bottle-neck effect of server-side and overloads on a network. In materialization technique, view maintenance technique is very difficult and maintenance cost is too high when the base table has been changed. In this paper, the SVMT (Spatial View Materialization Technique) is proposed by using R-tree re-construction. The SVMT is a technique which constructs a spatial index according to the distribution ratio of objects in spatial view. This ratio is computed by using a SVHR (Spatial View Height in R-tree) and SVOC (Spatial View Object Count). If the ratio is higher than the average, a spatial view is materialized and the R-tree index is re-used. In this case, the root node of this index is exchanged a node which has a MBR (Minimum Boundary Rectangle) value that can contains the whole region of spatial view at a minimum size. Otherwise, a spatial view is materialized and the R-tree is re-constructed. In this technique, the information of spatial view is managed by using a SVIT (Spatial View Information Table) and is stored on the record of this table. The proposed technique increases the speed of response time through fast query processing on a materialized view and eliminates additional costs occurred from repeatable query modification on the same query. With these advantages, it can greatly minimize the network overloads and the bottle-neck effect on the server.

  • PDF

Design and Implementation of Java-based Spatial Web Database System (자바기반 공간 웹 데이터베이스 시스템의 설계 및 구현)

  • Kim, Sang-Ho;Nam, Kwang-Woo;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.1
    • /
    • pp.1-10
    • /
    • 2004
  • According to the evolution of the Internet and wireless mobile communication technology, techniques for mobile databases and wireless web services are issued for them. Recently, these changes of geographic application environment increase the needs for development of new GIS database system for the web services and embedded system. In this paper, we proposed a Jana-based web database systems that can be used in the web-based GIS and mobile databases. This proposed system has been implemented using the Java to be displayed easily into the portable computing devices and Java-based web application servers and using OpenGIS for web data interoperability. Also, it can efficiently process web-based spatial queries by developing a spatial query processor including schema manager and a spatial object storage module.

Strategic Plan for Building of Spatial Decision Support Service based on National Basic Districts (국가기초구역기반 의사결정지원시스템 구축전략)

  • Kang, Young Ok;Kang, Ae Tti
    • Spatial Information Research
    • /
    • v.21 no.2
    • /
    • pp.85-97
    • /
    • 2013
  • The accumulation of spatial information - people, building, land and businesses- is required to make a rational decision successfully by utilizing the Spatial Decision Support Systems (SDSS). Many foreign countries have utilized the SDSS by defining the minimum unit of spatial area and implementing the spatial database based on it. Even though in Korea, National Basic Districts were created for the purpose of utilizing these districts as a basic area, they have not been utilized as a basic area of managing the spatial database due to the lack of attributes data. Therefore, the goal of this research is to suggest the strategies of building Spatial Decision Support Systems through the accumulation of the spatial data based on National Basic Districts. We propose the strategies in three different fields - legal system, database and application, services. We expect that the role of National Basic Districts w ill be strengthened by executing our strategies as a minimum spatial unit of Korea.

Efficient Parallel Spatial Join Processing Method in a Shared-Nothing Database Cluster System (비공유 공간 클러스터 환경에서 효율적인 병렬 공간 조인 처리 기법)

  • Chung, Warn-Ill;Lee, Chung-Ho;Bae, Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.591-602
    • /
    • 2003
  • Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

An Efficient Algorithm for Mining Frequent Sequences In Spatiotemporal Data

  • Vhan Vu Thi Hong;Chi Cheong-Hee;Ryu Keun-Ho
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2005.11a
    • /
    • pp.61-66
    • /
    • 2005
  • Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

  • PDF

Maintaining Integrity Constraints in Spatiotemporal Databases

  • Moon Kyung Do;Woo SungKu;Kim ByungCheol;Ryu KeunHo
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.726-729
    • /
    • 2004
  • Spatiotemporal phenomena are ubiquitous aspects of real world. In the spatial and temporal databases, integrity constraints maintain the semantics of specific application domain and relationship between domains when proceed update in the database. Efficient maintenance of data integrity has become a critical problem, since testing the validity of a large number of constraints in a large database and after each transaction is an expensive task. Especially, in spatiotemporal domain, data is more complex than traditional domains and very active. Additionally, it is not considered that unified frameworks deal with both spatial and temporal properties to handle integrity constraints. Therefore, there need a model to maintain integrity constraints in the unified frameworks and enforcement and management techniques in order to preserve consistence.

  • PDF

Development of GIS based Marine Mineral Resource Information System for Managing Marine Exploration Data (GIS 기반의 해양탐사자료 관리를 위한 해양광물자원정보시스템 설계 및 구축)

  • Kim, Dong-Il;Kim, Kye-Hyun;Park, Yong-Hyun
    • Spatial Information Research
    • /
    • v.19 no.6
    • /
    • pp.19-28
    • /
    • 2011
  • Recently, the interests of marine mineral resources has been increasing from the depletion of land resources around the world and many countries are involving in marine exploration work. South Korea is also currently performing exploration work to estimate the marine mineral resources around the Korean Peninsula. However, massive amounts of marine exploration data accumulated from the long-term exploration work have not been systematically managed. The data have been managed by the file based system instead of commercial database. The aim of this study is to construct GIS-based Marine Mineral Resource Information System using a spatial database for the core sediments of the marine exploration data. For constructing such DB system, GIS-based data items were classified, and a database was designed using relational database model. The database was constructed using commercial DBMS(Database Management System), Oracle. Also, necessary functions of the system were defined for the effective use of database based on users' requirement analysis. The GIS-based Marine Mineral Resource Information System has enabled to support the systematic management of the marine exploration data. Furthermore, it is expected that this spatial database will be useful in estimating the reserves of the mineral resources and provide valuable information for economic evaluation. In the future, the application of advanced techniques of spatial analysis and 3-dimensional display function will be required.

A study on Storage Management for Large Spatial Objects in Geographic Database Systems (지리 정보 데이타베이스에서 대용량의 공간 객체를 위한 저장 관리 시스템에 관한 연구)

  • 황병연;김병욱
    • Spatial Information Research
    • /
    • v.5 no.1
    • /
    • pp.1-10
    • /
    • 1997
  • In this paper, we classify existing spatial indexing schemes for spatial objects in geographic database systems into seven classes. Also, we propose a new spatial indexing scheme called MAX(Multi-Attribute indeXing scheme). The search, insert, delete algorithms for the proposed indexmg scheme are described in detail. It is expected that the performance of the proposed indexing scheme is better than the existing indexing schemes under the some conditions. The proposed indexing scheme, MAX, can be easily implemented on existing built-in B-trees in most storage managers in the sense tha.t the structure of MAX is like that of B-tree.

  • PDF

APPLICATION AND CROSS-VALIDATION OF SPATIAL LOGISTIC MULTIPLE REGRESSION FOR LANDSLIDE SUSCEPTIBILITY ANALYSIS

  • LEE SARO
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.302-305
    • /
    • 2004
  • The aim of this study is to apply and crossvalidate a spatial logistic multiple-regression model at Boun, Korea, using a Geographic Information System (GIS). Landslide locations in the Boun area were identified by interpretation of aerial photographs and field surveys. Maps of the topography, soil type, forest cover, geology, and land-use were constructed from a spatial database. The factors that influence landslide occurrence, such as slope, aspect, and curvature of topography, were calculated from the topographic database. Texture, material, drainage, and effective soil thickness were extracted from the soil database, and type, diameter, and density of forest were extracted from the forest database. Lithology was extracted from the geological database and land-use was classified from the Landsat TM image satellite image. Landslide susceptibility was analyzed using landslide-occurrence factors by logistic multiple-regression methods. For validation and cross-validation, the result of the analysis was applied both to the study area, Boun, and another area, Youngin, Korea. The validation and cross-validation results showed satisfactory agreement between the susceptibility map and the existing data with respect to landslide locations. The GIS was used to analyze the vast amount of data efficiently, and statistical programs were used to maintain specificity and accuracy.

  • PDF

Database Modeling and Environmental Information for a Radioactive Waste Repository Site

  • Park S. M.;Rhee C. G.;Park J. B.;Lee H. J.;Kim Chang Lak
    • Nuclear Engineering and Technology
    • /
    • v.36 no.3
    • /
    • pp.263-275
    • /
    • 2004
  • For the safe management of nuclear facilities, including a radioactive waste repository, data about the facility site and the surrounding environment must be collected and managed systematically. This is particularly true for a radwaste repository, which has to be institutionally controlled for a long period after closure. The objectives of this study are (1) to establish a systematical management plan for information about a radwaste repository site and its environment, and (2) to design a database management program for this information, based on the Relative Database Management System (RDBMS). The spatial data are designed by the geodatabase, which is a new object, based on the RDBMS, to manage spatial information related to the database. To meet this requirement, a new program called 'Site Information and Total Environmental data management System (SITES)' is being developed. The scope that produced from the first step of the present study for development of the SITES is introduced. The database is designed to combine spatial and attribute data, and is designed for the establishment of the Geographic Information System (GIS). The hardware and software systems are designed with consideration given to the total data management of the items within the radioactive environment.