• 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.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.400-407
• /
• 2011

Various air indexing and data scheduling schemes for wireless broadcast of spatial data have been developed for energy efficient query processing. The existing schemes are not effective when the clients' data access patterns are skewed to some items. It is because the schemes are based on flat broadcast that does not take the popularity of the data items into consideration. In this paper, thus, we propose a data scheduling scheme letting the popular items appear more frequently on the channel, and grid-based distributed index for non-flat broadcast (GDIN) for window query processing. The proposed GDIN allows quick and energy efficient processing of window query, matching the clients' linear channel access pattern and letting the clients access only the queried data items. The simulation results show that the proposed GDIN significantly outperforms the existing schemes in terms of access time, tuning time, and energy efficiency.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_2
• /
• pp.601-609
• /
• 2013

Standard lots, which are used to assess values of individual lots in Korea, have been criticized for their improper distribution. However, there has been very little evaluation for the spatial distribution of standard lots, and an evaluation method has never been developed. In order to overcome this situation, we attempt to assess the appropriateness of the spatial distribution of standard lots using the L-index and Monte Carlo simulation. The L-index is a well-known indicator of the complete spatial randomness (CSR) of points in spatial statistics. If the L-index of standard lots is similar to that of individual lots, the former is considered to be randomly distributed according to the latter. By analyzing L-indices of two study areas, Gangnam and Seongdong, we find a statistically significant difference in Gangnam area and a relatively small difference in Seongdong area. We confirm that the spatial distribution of standard lots is not CSR and that the L-index is useful as an evaluation method. These results suggest that the standard lot selection and management guidelines need to be modified to apply the spatial distribution of individual lots to the standard lot selection process.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.853-855
• /
• 2008

This paper presents an energy-efficient spatial join algorithm for multiple sensor networks employing a spatial semijoin strategy. For optimization of the algorithm, we propose a GR-tree index and a grid-ID-based spatial approximation method, which are unique to sensor networks. The GR-tree is a distributed spatial index over the sensor nodes, which efficiently prunes away the nodes that will not participate in a spatial join result. The grid-ID-based approximation provides great reduction in communication cost by approximating many spatial objects in simpler forms. Our experiments demonstrate that the algorithm outperforms existing methods in reducing energy consumption at the nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.999-1021
• /
• 2023

Differential spatial modulation uses the antenna index to transmit information, which improves the spectral efficiency, and completely bypasses any channel side information in the recommended setting. A generalized distributed multiple turbo coded-cooperative differential spatial modulation based on distributed multiple turbo code is put forward and its performances in Rayleigh fading channels is analyzed. The generalized distributed multiple turbo coded-cooperative differential spatial modulation scheme is a coded-cooperation communication scheme, in which we proposed a new joint parallel iterative decoding method. Moreover, the code matched interleaver is considered to be the best choice for the generalized multiple turbo coded-cooperative differential spatial modulation schemes, which is the key factor of turbo code. Monte Carlo simulated results show that the proposed cooperative differential spatial modulation scheme is better than the corresponding non-cooperative scheme over Rayleigh fading channels in multiple input and output communication system under the same conditions. In addition, the simulation results show that the code matched interleaver scheme gets a better diversity gain as compared to the random interleaver.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.203-208
• /
• 2010

This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.

• Journal of the Korean Geographical Society
• /
• v.42 no.4
• /
• pp.616-631
• /
• 2007

Residential differentiation is an academic theme which has been given enormous attention in urban studies. This is due to the fact that residential segregation can be seen as one of the best indicators for socio-spatial dialectics occurring on urban space. Measuring how one population group is differentiated from the other group in terms of residential space has been a focal point in the residential segregation studies. The index of dissimilarity has been the most extensively used one. Despite its popularity, however, it has been accused of inability to capture the degree of spatial clustering that unevenly distributed population groups usually display. Further, the spatial indices of segregation which have been introduced to edify the problems of the index of dissimilarity also have some drawbacks: significance testing methods have never been provided; recent advances in spatial statistics have not been extensively exploited. Thus, the main purpose of the research is to devise a spatial separation measure which is expected to gauge not only how unevenly two population groups are distributed over urban space, but also how much the uneven distributions are spatially clustered (spatial dependence). The main results are as follows. First, a new measure is developed by integrating spatial association measures and spatial chi-square statistics. A significance testing method based on the generalized randomization test is also provided. Second, a case study of residential differentiation among groups by educational attainment in major Korean metropolitan cities clearly shows the applicability of the analytical framework presented in the paper.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.569-584
• /
• 2016

In this paper, we present a spatial knowledge extractor implemented in Hadoop MapReduce parallel, distributed computing environment. From a large spatial dataset, this knowledge extractor automatically derives a qualitative spatial knowledge base, which consists of both topological and directional relations on pairs of two spatial objects. By using R-tree index and range queries over a distributed spatial data file on HDFS, the MapReduce-enabled spatial knowledge extractor, MRSPAKE, can produce a web-scale spatial knowledge base in highly efficient way. In experiments with the well-known open spatial dataset, Open Street Map (OSM), the proposed web-scale spatial knowledge extractor, MRSPAKE, showed high performance and scalability.

• Journal of Life Science
• /
• v.33 no.3
• /
• pp.227-233
• /
• 2023

The purpose of this paper was to describe a statistical analysis for the spatial distribution of geographical distances of Erythronium japonicum at Mt. Geumjeong in Korea. The spatial pattern of E. japonicum was analyzed according to the nearest neighbor rule, population aggregation under different plot sizes by dispersion indices, and spatial autocorrelation. Most natural plots of E. japonicum were uniformly distributed in the forest community. Disturbed plots were aggregately distributed within 5 m × 5 m of one another. Neighboring patches of E. japonicum were predominantly 7.5~10 m apart on average. If the natural populations of E. japonicum were disturbed by human activities, then the aggregation occurred in a shorter distance than the 7.5~10 m distance scale. The Morisita index (IM) is related to the patchiness index (PAI) that showed the 2.5 m × 5 m plot had an overly steep slope at the west and south areas when the area was smaller than 5 m × 5 m. When the patch size was one 2.5 m × 5 m quadrat at the west distributed area of Mt. Geumjeong, the cluster was determined by both species characteristics and environmental factors. The comparison of Moran's I values to a logistic regression indicated that individuals in E. japonicum populations at Mt. Geumjeong could be explained by isolation by distance.

• Journal of Life Science
• /
• v.24 no.8
• /
• pp.813-819
• /
• 2014

The spatial distribution of geographical distances at five natural populations of Camellia japonica in Busan, Korea was studied. The four plots (Mollundae, Gadeok-do, Du-do, and Jwiseum) of C. japonica were uniformly distributed in the forest community and only one plot (Amnam-dong) was aggregately distributed in the forest community. Morisita index is related to the patchiness index showed that the plot $20m{\times}50m$ had an overly steep slope when the area was larger than $20m{\times}20m$, which indicated that the degree of aggregation increased significantly with increasing quadrat sizes, while the patchiness indices did not change from the plot $5m{\times}10m$ to $10m{\times}10m$. The spatial structure was quantified by Moran's I, a coefficient of spatial autocorrelation. Ten of the significant values (76.9%) were positive, indicating similarity among individuals in the first 4 distance classes (80 m), i.e., pairs of individuals with dissimilarity characteristics can separate by more than 100 m.