• Title/Summary/Keyword: incremental update

Search Result 57, Processing Time 0.02 seconds

XML Vicw Indexing (XML 뷰 인덱싱)

  • 김영성;강현철
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.252-272
    • /
    • 2003
  • The view mechanism provides users with appropriate portions of database through data filtering and integration. In the Web era where information proliferates, the view concept is also useful for XML, a future standard for data exchange on the Web. This paper proposes a method of implementing XML views called XML view indexing, whereby XML view xv is represented as an XML view index(XVI) which is a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements but not the elements themselves, when a user requests to retrieve xv, its XVI should be materialized against xv's underlying XML documents. Also an efficient algorithm to incrementally maintain consistency of XVI given a update of xv's underlying XML documents is required. This paper proposes and implements data structures and algorithms for XML view indexing. The performance experiments on XML view indexing reveal that it outperforms view recomputation for repeated accesses to the view, and requires as much as about 30 times less storage space compared to XML view materialization though the latter takes less time for repeated accesses to the view due to no need of materialization.

Ultimate behavior and ultimate load capacity of steel cable-stayed bridges

  • Choi, D.H.;Yoo, H.;Shin, J.I.;Park, S.I.;Nogami, K.
    • Structural Engineering and Mechanics
    • /
    • v.27 no.4
    • /
    • pp.477-499
    • /
    • 2007
  • The main purpose of this paper is to investigate the ultimate behavior of steel cable-stayed bridges with design variables and compare the validity and applicability of computational methods for evaluating ultimate load capacity of cable-stayed bridges. The methods considered in this paper are elastic buckling analysis, inelastic buckling analysis and nonlinear elasto-plastic analysis. Elastic buckling analysis uses a numerical eigenvalue calculation without considering geometric nonlinearities of cable-stayed bridges and the inelastic material behavior of main components. Inelastic buckling analysis uses an iterative eigenvalue calculation to consider inelastic material behavior, but cannot consider geometric nonlinearities of cable-stayed bridges. The tangent modulus concept with the column strength curve prescribed in AASHTO LRFD is used to consider inelastic buckling behavior. Detailed procedures of inelastic buckling analysis are presented and corresponding computer codes were developed. In contrast, nonlinear elasto-plastic analysis uses an incremental-iterative method and can consider both geometric nonlinearities and inelastic material behavior of a cable-stayed bridge. Proprietary software ABAQUS are used and user-subroutines are newly written to update equivalent modulus of cables to consider geometric nonlinearity due to cable sags at each increment step. Ultimate load capacities with the three analyses are evaluated for numerical models of cable-stayed bridges that have center spans of 600 m, 900 m and 1200 m with different girder depths and live load cases. The results show that inelastic buckling analysis is an effective approximation method, as a simple and fast alternative, to obtain ultimate load capacity of long span cable-stayed bridges, whereas elastic buckling analysis greatly overestimates the overall stability of cable-stayed bridges.

An Approach for Integrated Modeling of Protein Data using a Fact Constellation Schema and a Tree based XML Model (Fact constellation 스키마와 트리 기반 XML 모델을 적용한 실험실 레벨의 단백질 데이터 통합 기법)

  • Park, Sung-Hee;Li, Rong-Hua;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.3
    • /
    • pp.519-532
    • /
    • 2004
  • With the explosion of bioinformatics data such proteins and genes, biologists need a integrated system to analyze and organize large datasets that interact with heterogeneous types of biological data. In this paper, we propose a integration system based on a mediated data warehouse architecture using a XML model in order to combine protein related data at biology laboratories. A fact constellation model in this system is used at a common model for integration and an integrated schema it translated to a XML schema. In addition, to track source changes and provenance of data in an integrated database employ incremental update and management of sequence version. This paper shows modeling of integration for protein structures, sequences and classification of structures using the proposed system.

Constitutive Model for Unsaturated Soils Based on the Effective Stress (유효응력에 근거한 불포화토의 역학적 구성모델)

  • Shin, Ho-Sung
    • Journal of the Korean Geotechnical Society
    • /
    • v.27 no.11
    • /
    • pp.55-69
    • /
    • 2011
  • The importance of unsaturated state in various geo-engineering problems has led to the advance of mechanical constitutive model emulating behavior of unsaturated soils in response to thermo-hydro-mechanical loading. Elasto-plastic mechanical constitutive model for unsaturated soil is formulated based on Bishop's effective stress. Effective stress and temperature are main variables in constitutive equation, and incremental formulation of constitutive relationship is derived to compute stress update and stiffness tensor. Numerical simulations involving coupled THM processes are conducted to discuss numerical stability and applicability of developed constitutive model: one-dimensional test, tri-axial compression test, and clay-buffering at high level radioactive waste disposal. Numerical results demonstrated that developed model can predict very complex behavior of coupled THM phenomena and is applicable to geo-engineering problems under various environmental conditions, as well as interpret typical behavior of unsaturated soils.

Binary Search on Tree Levels for IP Address Lookup (IP 주소 검색을 위한 트리 레벨을 사용한 이진 검색 구조)

  • Mun, Ju-Hyoung;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2B
    • /
    • pp.71-79
    • /
    • 2006
  • Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

Modified Kernel PCA Applied To Classification Problem (수정된 커널 주성분 분석 기법의 분류 문제에의 적용)

  • Kim, Byung-Joo;Sim, Joo-Yong;Hwang, Chang-Ha;Kim, Il-Kon
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.243-248
    • /
    • 2003
  • An incremental kernel principal component analysis (IKPCA) is proposed for the nonlinear feature extraction from the data. The problem of batch kernel principal component analysis (KPCA) is that the computation becomes prohibitive when the data set is large. Another problem is that, in order to update the eigenvectors with another data, the whole eigenspace should be recomputed. IKPCA overcomes these problems by incrementally computing eigenspace model and empirical kernel map The IKPCA is more efficient in memory requirement than a batch KPCA and can be easily improved by re-learning the data. In our experiments we show that IKPCA is comparable in performance to a batch KPCA for the feature extraction and classification problem on nonlinear data set.

Longest First Binary Search on Prefix Length for IP Address Lookup (최장 길이 우선 검색에 기초한 프리픽스 길이에 따른 이진 IP 검색 구조)

  • Chu Ha-Neul;Lim Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.691-700
    • /
    • 2006
  • Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.