• Title/Summary/Keyword: Index data structure

Search Result 831, Processing Time 0.027 seconds

Design of Algorithm for Efficient Retrieve Pure Structure-Based Query Processing and Retrieve in Structured Document (구조적 문서의 효율적인 구조 질의 처리 및 검색을 위한 알고리즘의 설계)

  • 김현주
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.8
    • /
    • pp.1089-1098
    • /
    • 2001
  • Structure information contained in a structured document supports various access paths to document. In order to use structure information contained in a structured document, it is required to construct an index structural on document structures. Content indexing and structure indexing per document require high memory overhead. Therefore, processing of pure structure queries based on document structure like relationship between elements or element orders, low memory overhead for indexing are required. This paper suggests the GDIT(Global Document Instance Tree) data structure and indexing scheme about structure of document which supports low memory overhead for indexing and powerful types of user queries. The structure indexing scheme only index the lowest level element of document and does not effect number of document having retrieval element. Based on the index structure, we propose an query processing algorithm about pure structure, proof the indexing schemes keeps up indexing efficient in terms of space. The proposed index structure bases GDR concept and uses index technique based on GDIT.

  • PDF

Effective Streaming of XML Data for Wireless Broadcasting (무선 방송을 위한 효과적인 XML 스트리밍)

  • Park, Jun-Pyo;Park, Chang-Sup;Chung, Yon-Dohn
    • Journal of KIISE:Databases
    • /
    • v.36 no.1
    • /
    • pp.50-62
    • /
    • 2009
  • In wireless and mobile environments, data broadcasting is recognized as an effective way for data dissemination due to its benefits to bandwidth efficiency, energy-efficiency, and scalability. In this paper, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of the mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data which enable energy and latency-efficient broadcast of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains tag name, attributes, and text content of an element as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the wireless stream in a shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing over the stream in the mobile clients. Through extensive performance experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.

Analysis of Construction and Searching Algorithms for Compressed Index Data Structures (압축된 인덱스 자료구조를 위한 구축 및 검색 알고리즘의 성능 분석)

  • 이분녀;김동규
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2004.05a
    • /
    • pp.640-643
    • /
    • 2004
  • 기하급수적으로 증가하고 있는 방대한 양의 데이터를 효율적으로 저장하고, 검색하기 위한 방법으로 압축된 인덱스 자료구조(compressed index data structure)가 제안되었고 현재 활발히 연구되고 있다. 압축된 인덱스 자료구조란 데이터를 적절한 방법으로 색인화(indexing)하여 이를 압축(compression)된 자료구조로 저장하여, 데이터 검색의 성능저하 없이, 저장 공간을 줄일 수 있는 방법이다. 본 논문에서는 대표적인 방법으로 Ferragina와 Manzini가 제시한 FM-index를 다룬다. 이 방법을 구현하여 전체적인 성능에 영향을 미치는 요소들을 실험을 통해 분석하였다. 이를 통하여 각 파라미터들의 상관관계를 분석하고 이상적인 설정 값을 실험하였다.

  • PDF

Competitiveness of Korea in World Pollack Markets for WTO/NAMA Negotiation (WTO/NAMA협상 대비 국제명태시장에서의 우리나라 경쟁력)

  • Jang Young-Soo;Song Jung-Hun
    • The Journal of Fisheries Business Administration
    • /
    • v.37 no.2 s.71
    • /
    • pp.85-109
    • /
    • 2006
  • This study is aimed to investigate the structure of world pollack markets and the position/competitiveness or Korea for WTO/NAMA Negotiation. First or all, it is clearly pointed out that many limitations and problems are inherent in FAO statistics that is widely utilized to investigate the structure of international seafood markets. Especially, it is impossible to find not only the data for Russia that is the top production and export country of pollack, but also the data for importing/exporting countries for pollack. In order to make up for these problems, the data for export and import of major countries are collected and analyzed. The results of analysis show the followings. First, it is clearly investigated that classification of fish products are different for countries. Second, it is understood the structure of international pollack market in actuality. The pollack market is segmented by frozen, fresh, dried, fillet, roe, surimi, etc. In addition, the pollack market has grown as much as 600,000 tons in amount and $1.2billion in value. Third, competitiveness of Korea in international pollack markets is measured quantitatively. It shows that Korea has low RAC index and TSI index, but high RMI index. Thus, it is identified that Korea becomes the largest pollack importing country. Fourth, the partial equilibrium analysis on pollack import market of Korea indicates that the frozen pollack has both price elasticity and substitution elasticity, while the fresh pollack has income elasticity.

  • PDF

The Analysis of the the characteristics of Korean peninsula Aircraft Turbulence Index using KWRF (KWRF를 활용한 한반도 항공기 난류 지수 특성 분석)

  • Kim, Young-Chul
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.18 no.1
    • /
    • pp.89-99
    • /
    • 2010
  • The purpose of this study is analysis of Korean peninsula aircraft turbulence using the numerical weather prediction model, KWRF with the various turbulence index and pilot weather report data. Compared with the pilot weather report data and Calculated the turbulence index using the KWRF model result, many turbulence index show the similar horizontal distribution, except for the TUB2 and VWS. The analysis of vertical structure of turbulence, there are some difference each turbulence index respectively, but severe turbulence turn up in 15,000ft almost turbulence index. above 20,000ft height, intensity of turbulence vary each turbulence index. Through this turbulence study, It is founded on the research and development of the Korean peninsula aircraft turbulence

Development of a Fusion Vegetation Index Using Full-PolSAR and Multispectral Data

  • Kim, Yong-Hyun;Oh, Jae-Hong;Kim, Yong-Il
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.6
    • /
    • pp.547-555
    • /
    • 2015
  • The vegetation index is a crucial parameter in many biophysical studies of vegetation, and is also a valuable content in ecological processes researching. The OVIs (Optical Vegetation Index) that of using multispectral and hyperspectral data have been widely investigated in the literature, while the RVI (Radar Vegetation Index) that of considering volume scattering measurement has been paid relatively little attention. Also, there was only some efforts have been put to fuse the OVI with the RVI as an integrated vegetation index. To address this issue, this paper presents a novel FVI (Fusion Vegetation Index) that uses multispectral and full-PolSAR (Polarimetric Synthetic Aperture Radar) data. By fusing a NDVI (Normalized Difference Vegetation Index) of RapidEye and an RVI of C-band Radarsat-2, we demonstrated that the proposed FVI has higher separability in different vegetation types than only with OVI and RVI. Also, the experimental results show that the proposed index not only has information on the vegetation greenness of the NDVI, but also has information on the canopy structure of the RVI. Based on this preliminary result, since the vegetation monitoring is more detailed, it could be possible in various application fields; this synergistic FVI will be further developed in the future.

A Study on Competitiveness Improvement of Chittagong Container Port

  • Haque Md Jubair;Woo-Chul Ahn
    • Asia-Pacific Journal of Business
    • /
    • v.14 no.1
    • /
    • pp.439-451
    • /
    • 2023
  • Purpose - Market structure is crucial to identify as it defines the market states for new and existing container ports to perform within a given region. the study aims to compare the major ports in the Bay of Bengal in the context of Chittagong Port. Design/methodology/approach - For this study, the past 9 years of container volume data have been collected and analyzed through the HHI index, BCG matrix and shift effect analysis. Based on the analysis, this study has found that the Chittagong Port is in an oligopoly competitive market structure. Findings - The findings have shown that port in low market share and low growth in very recent years with the moderately concentrated ports HHI index. The shift effect analysis shows that the container volumes shifted from one port to another in the 2019 and 2020 periods. This study is the pioneer study in the Bay of Bengal region to identify the market structure, analyze market share and growth, and analyze the market concentration. Research implications or Originality - Future recommendations for the port authority is to take advantage of geolocation; attract international; tax exemption, faster clearance process, reduced waiting charges; increasing storage and technological machinery; promoting maritime logistics education; promoting Chittagong tourism; collaboration with other countries. Also, this study can be used as basic data for the establishment of a new supply chain between Korea and Southwest Asia for the Korean government and companies.

Development of Halfedge-based Triangular Mesh Data Structure (반모서리 기반의 삼각망 자료 구조 개발)

  • Chung, Yun-Chan;Chang, Min-Ho
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.1
    • /
    • pp.33-41
    • /
    • 2009
  • Triangular mesh models are widely used in reverse engineering, computer graphics, rapid prototyping and NC(numerical controller) tool-path generation. Triangular mesh models are generated from point clouds, surface models and solid models. A halfedge-based triangular mesh data structure is proposed and the development considerations are presented. In the presented data structure, halfedge is the key data structure. Halfedge stores its triangle index and the order in the triangle. Triangles do not store the halfedge lists explicitly. Halfedge is referred by value and defined when it is required. Proposed data structure supports four design requirements: efficient rendering, compact memory, supporting efficient algorithms and easy programming.

Design & Performance Evaluation of Storage and Index Structures for Spatial Network Databases (공간 네트워크 데이터베이스를 위한 저장 및 색인 구조의 설계 및 성능평가)

  • Um Jung-Ho;Chang Jae-Woo
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.325-336
    • /
    • 2006
  • For supporting LBS service, recent studies on spatial network databases (SNDB) have been done actively. In order to gain good performance on query processing in SNDB, we, in this paper. design efficient storage and index structures for spatial network data, point of interests (POIs), and moving objects on spatial networks. First, we design a spatial network file organization for maintaining the spatial network data itself consisting of both node and edges. Secondly, we design a POI storage and index structure which is used for gaining fast accesses to POIs, like restaurant, hotel, and gas station. Thirdly, we design a signature-based storage and index structure for efficiently maintaining past, current, and expected future trajectory information of moving objects. Finally, we show that the storage and index structures designed in this paper outperform the existing storage structures for spatial networks as well as the conventional trajectory index structures for moving objects.

GC-Tree: A Hierarchical Index Structure for Image Databases (GC-트리 : 이미지 데이타베이스를 위한 계층 색인 구조)

  • 차광호
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.13-22
    • /
    • 2004
  • With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.