• Title/Summary/Keyword: Uniform Grid Index

Search Result 5, Processing Time 0.024 seconds

A Study on Spatial Data Integration using Graph Database: Focusing on Real Estate (그래프 데이터베이스를 활용한 공간 데이터 통합 방안 연구: 부동산 분야를 중심으로)

  • Ju-Young KIM;Seula PARK;Ki-Yun YU
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.26 no.3
    • /
    • pp.12-36
    • /
    • 2023
  • Graph databases, which store different types of data and their relationships modeled as a graph, can be effective in managing and analyzing real estate spatial data linked by complex relationships. However, they are not widely used due to the limited spatial functionalities of graph databases. In this study, we propose a uniform grid-based real estate spatial data management approach using a graph database to respond to various real estate-related spatial questions. By analyzing the real estate community to identify relevant data and utilizing national point numbers as unit grids, we construct a graph schema that linking diverse real estate data, and create a test database. After building a test database, we tested basic topological relationships and spatial functions using the Jackpine benchmark, and further conducted query tests based on various scenarios to verify the appropriateness of the proposed method. The results show that the proposed method successfully executed 25 out of 29 spatial topological relationships and spatial functions, and achieved about 97% accuracy for the 25 functions and 15 scenarios. The significance of this study lies in proposing an efficient data integration method that can respond to real estate-related spatial questions, considering the limited spatial operation capabilities of graph databases. However, there are limitations such as the creation of incorrect spatial topological relationships due to the use of grid-based indexes and inefficiency of queries due to list comparisons, which need to be improved in follow-up studies.

Numerical investigation of water-entry characteristics of high-speed parallel projectiles

  • Lu, Lin;Wang, Chen;Li, Qiang;Sahoo, Prasanta K.
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.13 no.1
    • /
    • pp.450-465
    • /
    • 2021
  • In this study, an attempt has been made to investigate the water-entry characteristics of the high-speed parallel projectile numerically. The shear stress transport k-𝜔 turbulence model and the Zwart-Gerber-Belamri cavitation model based on the Reynolds-Averaged Navier-Stokes method were used. The grid independent inspection and grid convergence index is carried out and verified. The influences of the parallel water-entry on flow filed characteristics, trajectory stability and drag reduction performance for different values of initial water-entry speed (𝜈0 = 280 m/s, 340 m/s, 400 m/s) and clearance between the parallel projectiles (Lp = 0.5D, 1.0D, 2.0D, 3.0D) are presented and analyzed in detail. Under the condition of the parallel water-entry, it can be found that due to the intense interference between the parallel projectiles, the distribution of cavity is non-uniform and part of the projectile is exposed to water, resulting in the destruction of the cavity structure and the decline of trajectory stability. In addition, the parallel projectile suffers more severe lateral force that separates the two projectiles. The drag reduction performance is impacted and the velocity attenuation is accelerated as the clearance between the parallel projectiles reduces.

Population Allocation at the Building level for Micro-level Urban Simulation: A Case of Jeonju, Korea

  • Kim, Dohyung;Cho, Dongin
    • Asian Journal of Innovation and Policy
    • /
    • v.9 no.2
    • /
    • pp.223-239
    • /
    • 2020
  • It is important for urban planners and policy makers to understand complex, diverse urban demands and social structure, but this is not easy due to lack of data that represents the dynamics of residents at micro-geographical level. This paper explores how to create population data at at a micro-level by allocating population data to building. It attempted to allocate population data stored in a grid layer (100 meters by 100 meters) into a building footprint layer that represents the appearance of physical buildings. For the allocation, this paper describes a systemic approach that classifies grid cells into five prototypical patterns based on the composition of residential building types in a grid cell. This approach enhances allocation accuracy by accommodating heterogeneity of urban space rather than relying on the assumption of uniform spatial homogeneity of populations within an aerial unit. Unlike the methods that disaggregate population data to the parcel, this approach is more applicable to Asian cities where large multifamily residential parcels are common. However, it should be noted that this paper does not demonstrate the validity of the allocated population since there is a lack of the actual data available to be compared with the current estimated population. In the case of water and electricity, the data is already attached to an individual address, and hence, it can be considered to the purpose of the validation for the allocation. By doing so, it will be possible to identify innovative methods that create a population distribution dataset representing the comprehensive and dynamic nature of the population at the micro geographical level.

Range Query Processing of Distributed Moving Object Databases using Scheduling Technique (스케쥴링 기법을 이용한 분산 이동 객체 데이타베이스의 범위 질의 처리)

  • Jeon, Se-Gil;Hwang, Jae-Il;Nah, Youn-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.2 s.12
    • /
    • pp.51-62
    • /
    • 2004
  • Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

  • PDF

An Efficient Range Query Processing of Distributed Moving Object (분산 이동 객체 데이터베이스의 효율적인 범위 질의 처리)

  • Jeon, Se-Gil;Woo, Chan-Il
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.42 no.1
    • /
    • pp.35-40
    • /
    • 2005
  • Recently, the location based service for moving customers is becoming one of the most important service in mobile communication area and for moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries and to improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structure, which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.