• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.1 s.307
• /
• pp.35-44
• /
• 2006

Recently, a lot of index techniques for storing and querying XML document have been studied so far and many researches of them used coordinate-based methods. But update operation and query processing to express structural relations among elements, attributes and texts make a large burden. In this paper, we propose an efficient BitmapInvert index technique based on Relative Position Coordinate (RPC). RPC has good preformance even if there are frequent update operations because it represents relationship among parent node and left, right sibling nodes. BitmapInvert index supports tort query with bitwise operations and does not casue serious performance degradations on update operations using PostUpdate algerian. Overall, the performance could be improved by reduction of the number of times for traversing nodes.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.154-163
• /
• 2005

Because most researches that were studied so far on XML documents used an absolute coordinate system in most of the index techniques, the update operation makes a large burden. To express the structural relations between elements, attributes and text, we need to reconstruct the structure of the coordinates. As the reconstruction process proceeds through out the entire XML document in a cascade manner, which is not limited to the current changing node, a serious performance problem may be caused by the frequent update operations. In this paper, we propose an index technique based on extensible index that does not cause serious performance degradations. It can limit the number of node to participate in reconstruction process and improve lots of performance capacities on the whole. And extensible index performs the containment relationship query by the simple expression using SQL statement.

• Journal of Korea Multimedia Society
• /
• v.22 no.9
• /
• pp.1036-1045
• /
• 2019

Relational databases have a notion of normalization, in which the model for storing data is standardized according to the organization's business processes or data operations. However, the graph database is relatively early in this standardization and has a high degree of freedom in modeling. Therefore various models can be created with the same data, depending on the database designers. The essences of the graph database are two aspects. First, the graph database allows accessing relationships between the objects semantically. Second, it makes relationships between entities as important as individual data. Thus increasing the degree of freedom in modeling and providing the modeling developers with a more creative system. This paper introduces different graph models with test data. It compares the query performances by the results of response speeds to the query executions per graph model to find out how the efficiency of each model can be maximized.

• The Journal of the Korea Contents Association
• /
• v.14 no.1
• /
• pp.14-23
• /
• 2014

There have been many researches for XML as the international standard to store and exchange data on the internet. Among these research fields, we focus on the techniques labeling the nodes of the XML tree that is required for querying the structural information. A labeling scheme assigns the unique label to the nodes and supports the queries for the structural information such as Ancestor-Descendant and Parent-Child relationships. In this paper, we propose a labeling scheme using vector representation where the assigned labels are not altered although XML documents are changed dynamically. Our labeling scheme reduces the storage requirement for the labels of the XML tree and provides the efficient query by using the fixed-length labels with a short size. Result of performance evaluation shows that our labeling scheme is superior to the previous approaches.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.48-60
• /
• 2004

XML documents consist of elements that are basic units of information. When the structure of XML documents is changed dynamically, we need to update structure information efficiently without changing the information of the index structure for fast retrieval. In this paper, we propose a dynamic indexing model scheme that updates the index structure in real time as the structure of XML documents is changed by insertion and deletion of elements. Our dynamic indexing model consists of a structure information representation method and a dynamic index structure. The structure information representation method supports various types of structure retrievals. Our dynamic index structure processes various structural queries efficiently. We show through various experiments that our method outperforms existing ones in processing various types of queries such as content based queries, structural queries and hybrid queries.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2287-2297
• /
• 2000

Video documents which have audio-visual and other semantics information have complex relationship among media. While user requests for topic retrieval or specific region retrieval increase, it is difficult to meet these requests with the existing design methodology, In order to support the systematic management and the various retrieval capabilities of video document, we must formulate structural and systematic model on metadata using semantics and structural informations which are abstracted automaticallv or manuallv. This paper suggests generic metadata model with which we analyze the characteristics of video document, supports various query types and serves as a generic framework for video applications, we propose the generic integrated management model(GIMM)for generic metadata,, design video documents management system(VDMS) and implement it using GIMM.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.606-617
• /
• 2005

There have been many research efforts which find efficiently all occurrences of the structural relationships between the nodes in the XML document tree for processing a XML query. Most of them use the region numbering which is based on positions of the nodes. Hut The position-based node numbering schemes require update of many node numbers in the XML document li the XML nodes are inserted frequently in the same position. In this paper, we propose ENN(extensible node numbering) scheme using the bucket number which is represented with the variable-length string for decreasing the number of the node numbers which is updated. We also present an performance analysis by comparing ENN method with TP(extended preorder) method.

• BMB Reports
• /
• v.46 no.8
• /
• pp.416-421
• /
• 2013

Genome-wide association studies (GWAS) have become popular as an approach for the identification of large numbers of phenotype-associated variants. However, differences in genetic architecture and environmental factors mean that the effect of variants can vary across populations. Understanding population genetic diversity is valuable for the investigation of possible population specific and independent effects of variants. EvoSNP-DB aims to provide information regarding genetic diversity among East Asian populations, including Chinese, Japanese, and Korean. Non-redundant SNPs (1.6 million) were genotyped in 54 Korean trios (162 samples) and were compared with 4 million SNPs from HapMap phase II populations. EvoSNP-DB provides two user interfaces for data query and visualization, and integrates scores of genetic diversity (Fst and VarLD) at the level of SNPs, genes, and chromosome regions. EvoSNP-DB is a web-based application that allows users to navigate and visualize measurements of population genetic differences in an interactive manner, and is available online at [http://biomi.cdc.go.kr/EvoSNP/].

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.634-644
• /
• 1995

In this paper, we propose a mechanism to transform more effective and semantically equivalent queries by using appropriately represented three kinds of knowledge. Also we proposed a mechanism which transforms partially omitted components or expressions into complete queries so that users can use more simple queries. The knowledges used to transform and optimize are semantic, structural and domain knowledge. Semantic knowledge includes semantic integrity constraints and domain integrity constraints. Structural knowledge represents physical relationship between relations. And domain knowledge maintains the domain information of attributes. The proposed system optimizes to more effective queries by eliminating/adding/replacing unnecessary or redundant restrictions/joins.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.940-955
• /
• 2008

Semantically similar XML documents in the same application domain might often conform to different schemas. To uniformly view and query such XML documents, we need an efficient method of integrating XML schemas. This paper proposes a sophisticated method for integrating XML schemas in the same application domain. To compute mapping relationships between schemas, the proposed method utilizes various relationships, such as synonyms and hypernyms, between lexical items based on dictionaries and domain ontologies. Particularly, the relationships between lexical items are elaborated by taking their structural information into account. In addition, this paper proposes a more accurate method for integrating compositors. Experimental results with schemas in various application domains show that the utilization of domain ontologies and the structural relationships between lexical items enhance the precision and recall of integrated schemas.