• Title/Summary/Keyword: spatial data processing

Search Result 984, Processing Time 0.032 seconds

Spectrum Sensing and Data Transmission in a Cognitive Relay Network Considering Spatial False Alarms

  • Tishita, Tasnina A.;Akhter, Sumiya;Islam, Md. Imdadul;Amin, M. Ruhul
    • Journal of Information Processing Systems
    • /
    • v.10 no.3
    • /
    • pp.459-470
    • /
    • 2014
  • In this paper, the average probability of the symbol error rate (SER) and throughput are studied in the presence of joint spectrum sensing and data transmission in a cognitive relay network, which is in the environment of an optimal power allocation strategy. In this investigation, the main component in calculating the secondary throughput is the inclusion of the spatial false alarms, in addition to the conventional false alarms. It has been shown that there exists an optimal secondary power amplification factor at which the probability of SER has a minimum value, whereas the throughput has a maximum value. We performed a Monte-Carlo simulation to validate the analytical results.

An Integration Algorithm of X-tree and kd-tree for Efficient Retrieval of Spatial Database (공간 데이터베이스의 효율적인 검색을 위한 X-트리와 kd-트리의 병합 알고리즘)

  • Yoo, Jang-Woo;Shin, Young-Jin;Jung, Soon-Key
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3469-3476
    • /
    • 1999
  • In spatial database based on spatial data structures, instead of one-dimensional indexing structure, new indexing structure which corresponds to multi-dimensional features of spatial objects is required. In order to meet those requirements, in this paper we proposed new indexing structure for efficient retrieval of spatial database by carrying through the feature analysis of conventional multi-dimensional indexing structures. To improve the sequential search method of supernodes in the conventional X-tree and to reduce the retrieval time in case of generating the huge supernode, we proposed a indexing structure integrating the kd-tree based on point index structure into the X-tree. We implemented the proposed indexing structure and analyzed its retrieval time according to the dimension and distribution of experimental data.

  • PDF

GPS Software Development for Calculation of Cadastral Control Points (지적기준점 성과계산을 위한 GPS 소프트웨어 개발)

  • 우인제;이종기;김병국;이민석
    • Spatial Information Research
    • /
    • v.12 no.1
    • /
    • pp.101-110
    • /
    • 2004
  • Research that establish new cadastral survey model that use GPS to introduce GPS observation technique in cadastral survey and research that develop connection technologies are now abuzz. The purpose of this research is to keep in step in such trend and grasp present condition and performance of surveying connection to common use GPS data processing software, and analyze data processing algorithm, and develop suitable GPS data processing software in our real condition regarding GPS data processing and result of control point calculation. This research studies analysis common use software and error occurrence by data processing method that college and company have. Also, It analyzes algorithm that is applied to existing GPS data processing software. After that we study algorithm that is most suitable with cadastral survey and then develop cadastral survey calculation software for new cadastral control points.

  • PDF

A Spatial Hash Strip Join Algorithm for Effective Handling of Skewed Data (편중 데이타의 효율적인 처리를 위한 공간 해쉬 스트립 조인 알고리즘)

  • Shim Young-Bok;Lee Jong-Yun
    • Journal of KIISE:Databases
    • /
    • v.32 no.5
    • /
    • pp.536-546
    • /
    • 2005
  • In this paper, we focus on the filtering step of candidate objects for spatial join operations on the input tables that none of the inputs is indexed. Over the last decade, several spatial Join algorithms for the input tables with index have been extensively studied. Those algorithms show excellent performance over most spatial data, while little research on solving the performance degradation in the presence of skewed data has been attempted. Therefore, we propose a spatial hash strip join(SHSJ) algorithm that can refine the problem of skewed data in the conventional spatial hash Join(SHJ) algorithm. The basic idea is similar to the conventional SHJ algorithm, but the differences are that bucket capacities are not limited while allocating data into buckets and SSSJ algorithm is applied to bucket join operations. Finally, as a result of experiment using Tiger/line data set, the performance of the spatial hash strip join operation was improved over existing SHJ algorithm and SSSJ algorithm.

Load Shedding Method based on Grid Hash to Improve Accuracy of Spatial Sliding Window Aggregate Queries (공간 슬라이딩 윈도우 집계질의의 정확도 향상을 위한 그리드 해쉬 기반의 부하제한 기법)

  • Baek, Sung-Ha;Lee, Dong-Wook;Kim, Gyoung-Bae;Chung, Weon-Il;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.89-98
    • /
    • 2009
  • As data stream is entered into system continuously and the memory space is limited, the data exceeding the memory size cannot be processed. In order to solve the problem, load shedding methods which drop a part of data to prevent exceeding the storage space have been researched. Generally, a traditional load shedding method uses random sampling with optimized rate according to data deviation. The method samples data not to distinguish those used in spatial query because the method uses only a random sampling with optimized rate according to data deviation. Therefore, the accuracy of query was reduced in u-GIS environment including spatial query. In this paper, we researched a new load shedding method improving accuracy of the query in u-GIS environment which runs spatial query and aspatial query simultaneously. The method uses a new sampling method that samples data having low probability used in query. Therefore proposed method improves spatial query accuracy and query processing speed as applying spatial filtering operation to sampling operator.

  • PDF

The Processing of Spatial Joins using a Bit-map Approximation (비트맵 근사 표현을 이용한 효율적인 공간 조인)

  • 홍남희;김희수
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.2
    • /
    • pp.157-164
    • /
    • 2001
  • This paper studies on the processing of spatial joins. The spatial join operation is divided into filters and refinement steps in general. The processing of spatial joins can be greatly improved by the use of filters that reduce the polygons in order to find the intersecting ones. As a result, three possible sets of answers are identified: the positive one, the negative one and the inconclusive one. To identify all the interesting pairs of polygons with inconclusive answers, it is necessary to have access to the representation of polygons so that an exact geometry test can take place. We introduce a bit-map approximation technique to drastically reduce the computation required by the refinement step during refinement processing. Bit-map representation are used for the description of the internal, the external and the boundary regions of the polygon objects. The proposed scheme increases the chance of trivial acceptance and rejection of data objects, and reduces unnecessary disk accesses in query processing. It has been shown that the reference to the object data file can be cut down by as much as 60%.

  • PDF

Pre-aggregation Index Method Based on the Spatial Hierarchy in the Spatial Data Warehouse (공간 데이터 웨어하우스에서 공간 데이터의 개념계층기반 사전집계 색인 기법)

  • Jeon, Byung-Yun;Lee, Dong-Wook;You, Byeong-Seob;Kim, Gyoung-Bae;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1421-1434
    • /
    • 2006
  • Spatial data warehouses provide analytical information for decision supports using SOLAP (Spatial On-Line Analytical Processing) operations. Many researches have been studied to reduce analysis cost of SOLAP operations using pre-aggregation methods. These methods use the index composed of fixed size nodes for supporting the concept hierarchy. Therefore, these methods have many unused entries in sparse data area. Also, it is impossible to support the concept hierarchy in dense data area. In this paper, we propose a dynamic pre-aggregation index method based on the spatial hierarchy. The proposed method uses the level of the index for supporting the concept hierarchy. In sparse data area, if sibling nodes have a few used entries, those entries are integrated in a node and the parent entries share the node. In dense data area, if a node has many objects, the node is connected with linked list of several nodes and data is stored in linked nodes. Therefore, the proposed method saves the space of unused entries by integrating nodes. Moreover it can support the concept hierarchy because a node is not divided by linked nodes. Experimental result shows that the proposed method saves both space and aggregation search cost with the similar building cost of other methods.

  • PDF

A Study on Semantic Web for Multi-dimensional Data (다차원 데이터를 위한 시멘틱 웹 연구)

  • Kim, Jeong-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.121-127
    • /
    • 2017
  • Recently, it has been actively Semantic Web studies for 2-dimensional data of the spatial data. 2-dimensional Semantic Web, are fused existing Geospatial Web and the Semantic Web, and integrate with the efficient cooperation of the vast non-spatial information on a variety of geospatial information and general Web, it is possible to provide it is a Web services technology of intelligent geographic information. However, in the research for multi-dimensional data processing, and in those who are missing overall, relevant standards also not been enacted. Therefore, in this paper, by applying a variety of base of the theory and technology related to this to take place the Ontology processing technology, multi-dimensional data processing is possible ontology, question, and suggested the contents of the reasoning. Also, we tried to apply what you have proposed respectively to the multi-dimensional query virtual scenario necessary.

Image Data Processing by Lee Weighted Hadamard Transform (이 웨이티드 아다마르 변환을 이용한 영상신호 처리에 관한 연구)

  • 이문호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.10 no.2
    • /
    • pp.93-103
    • /
    • 1985
  • The digital signal processing technique by bandwidth compression has been grown up ragidly owing to integrated circuit developments. In this project, we have proposed the Lee Weighted Hadamard (LWH) transform which retains the main properties of Hadamard matirx. The LWH matrix was weighted in the center of the spatial domain. The human visual of the mid spatial are emphasized more than the low and high spatial frequencies. The fast algorithms of the LWH transform has been studied for hardware realization. The result of this project are availabel to airplane photograph, X-Ray, CATV and the artificial satellite of the digital image processing.

  • PDF

Design and Implementation of a Data Management System for Mobile Spatio-Temporal Query (모바일 시공간 질의을 위한 데이타 관리 시스템의 설계 및 구현)

  • Lee, Ki-Young;Lim, Myung-Jae;Kim, Joung-Joon;Kim, Kyu-Ho;Kim, Jeong-Lae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.109-113
    • /
    • 2011
  • Recently, according to the development of ubiquitous computing, the u-GIS which not only used in u-Transport, u-Care, u-Fun, u-Green, u-Business, u-Government, and u-City but also used to provides various spatial information such as the location of user is being the core technology of the ubiquitous computing environment. In this paper, we implemented an mobile spatio-temporal Query Processing Systems for handling the Spatio-Temporal Data in mobile equipment.The mobile spatio-temporal Query Processing Systems provides the spatio-temporal data type and the spatio-temporal operator that is expanded by the spatial data type and the spatial operator from OepenGIS "Simple Feature Specification for SQL". It supports arithmetic coding compression techniques that is considered with a spatio-temporal data specific character. It also provides the function of data cashing for improving the importation and exportation of the spatio-temporal data between a embedded spatio-temporal DBMS and u-GIS server.