• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.51-54
• /
• 2005

This paper proposes an index structure which is used to process X-Path on S-XML data. There are many previous index structures based on tree structure for X-Path processing. Because of general tree index's top-down query fashion, the unnecessary node traversal makes heavy access and decreases the query processing performance. And both of the two query types for X-Path called single-path query and branching query need to be supported in proposed index structure. This method uses a combination of path summary and the node indexing. First, it manages hashing on hierarchy elements which are presented in tag in S-XML. Second, array blocks named path summary array is created in each node of hashing to store the path information. The X-Path processing finds the tag element using hashing and checks array blocks in each node to determine the path of query's result. Based on this structure, it supports both single-path query and branching path query and improves the X-Path processing performance.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.494-506
• /
• 2003

Recently, explosive popularity of multimedia information has triggered the need for retrieving multimedia contents efficiently from the database including audio, video and images. In this paper, we propose an XML-based retrieval scheme and a data model that complement the weak aspects of annotation and conent based retrieval methods. The Property and hierarchy structure of image and video data are represented and manipulated based on the Multimedia Description Schema (MDS) that conforms to the MPEG-7 standard. For audio contents, pitch contours extracted from their acoustic features are converted into UDR string. Especially, to improve the retrieval performance, user's access pattern and frequency are utilized in the construction of an index. We have implemented a prototype system and evaluated its performance through various experiments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.649-651
• /
• 2001

본 논문에서는 XML 문서의 효율적인 관리와 구조검색을 위한 구조적 색인 방법을 제안한다. 기존의 방법은 특정 엘리먼트의 부모, 자식, 형제애 대한 다양한 구조검색을 효율적으로 지원하지 못하므로, XML 문서의 구조정보를 LETID(Labeled Element Type ID)로 표현하며 엘리먼트를 식별하고, 부모와 자식 엘리먼트간의 계층 정보와 동일한 부모 엘리먼트를 갖는 자식 엘리먼트들의 순서정보를 나타낸다. LETID는 고정된 크기로 하며, 엘리먼트에 고유 ID를 부여하는 방식을 통해서 DTD의 논리적 구조를 분석할 때 부모 형제 노드를 직접적으로 찾을 수 있고 ID 값에 깊이정보가 포함되어 있기 때문에 고유번호만 보고 깊이를 알 수가 있다. 이 구조정보를 이용하여 빠른 검색을 위한 내용 색인 구조 색인 애트리뷰트 색인을 설계하고 설계된 색인을 통하여 질의를 처리하여 다양한 구조적 질의를 효율적으로 처리할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.193-195
• /
• 2002

XML 기반의 MPEG-7은 사용자가 시스템을 통해서 원하는 정보를 얻을 수 있도록 멀티미디어컨텐츠의 다양한 정보를 기술하고 있다. 그러나 많은 샷으로 이루어진 MPEG-7 정보 저장 공간에서 질의가 들어왔을 때 원하는 정보를 찾기 위하여 모든 문서를 검색하는 것은 상당한 시간이 요구된다. 본 논문에서 이를 해결하기 위하여 동영상 MPEG-7 문서에 대한 효율적인 인덱싱 알고리즘을 제시한다. 본 논문에서 제안한 인덱싱 알고리즘의 적용으로 MPEG-7 검색에 있어서 효율적임을 할 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.199-201
• /
• 2004

디지털 방송 환경의 메타데이타 서비스 중에서도 가장 혁신적인 것이 하이라이트(highlight)메타데이타 서비스이다. 하이라이트 메타데이타를 생성하기 위해서 시각율동을 이용한 샷경계 검출 알고리즘을 사용해 스포츠 경기의 하이라이트 시간구간을 결정하고, 하이라이트 표시기에서 하이라이트를 설명하는 간단한 주제어를 부가한다. 그리고 하이라이트 템플릿을 이용해 계층구조를 생성하고 하이라이트에 부가된 하이라이트 주제어에 따라 계층 구조의 적절한 위치에 삽입하고. 하이라이트 계층구조는 MPEG-7 표준 스키마에 따라 xml로 서술한다 하이라이트 메타데이타 서비스를 받는 시청자들은 매우 짧은 시간에 이미 방영된 스포츠 경기의 중요 장면들을 모두 볼 수 있다.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.754-765
• /
• 2006

In XML keyword search, a search result is defined as a set of the smallest elements (i.e., least common ancestors) containing all query keywords and a granularity of indexing is an XML element instead of a document. Under the conventional index structure, all least common ancestors produced by the combination of the elements, each of which contains a query keyword, are considered as a search result. In this paper, to avoid unnecessary operations of producing the least common ancestors and reduce query process time, we describe a way to construct a partitioned index composed of several partitions and produce a search result by merging those partitions if necessary. When a search result is restricted to be composed of the least common ancestors whose depths are higher than a given minimum depth, under the proposed partitioned index structure, search systems can reduce the query process time by considering only combinations of the elements belonging to the same partition. Even though the minimum depth is not given or unknown, search systems can obtain a search result with the partitioned index, which requires the same query process time to obtain the search result with non-partitioned index. Our experiment was conducted with the XML documents provided by the DBLP site and INEX2003, and the partitioned index could reduce a substantial amount of query processing time when the minimum depth is given.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.737-748
• /
• 2003

With the popularity of digital music contents, querying and retrieving music contents efficiently from database has become essential. In this paper, we propose a Fast Melody Finder (FMF) that can retrieve melodies fast and efficiently from music database using frequently queried tunes. This scheme is based on the observation that users have a tendency to memorize and query a small number of melody segments, and indexing such segments enables fast retrieval. To handle those tunes, FMF transcribes all the acoustic and common music notational inputs into a specific string such as UDR and LSR. We have implemented a prototype system and showed on its performance through various experiments.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.275-280
• /
• 2009

While database(DB) and information retrieval(IR) have been developed independently, there have been emerging requirements that both data management and efficient text retrieval should be supported simultaneously in an information system such as health care, customer support, XML data management, and digital libraries. The great divide between DB and IR has caused different manners in index maintenance for newly arriving documents. While DB has extended its SQL layer to cope with text fields due to lack of intact mechanism to build IR-like index, IR usually treats a block of new documents as a logical unit of index maintenance since it has no concept of integrity constraint. However, In the DB-IR integrations, a transaction on adding or updating a document should include maintenance of the posting lists accompanied by the document. Although DB-IR integration has been budded in the research filed, the issue will remain difficult and rewarding areas for a while. One of the primary reasons is lack of efficient online transactional index maintenance. In this paper, performance of a few strategies for per-document basis transactional index maintenance - direct index update, pulsing auxiliary index and posting segmentation index - will be evaluated. The result shows that the pulsing auxiliary strategy and posting segmentation indexing scheme, can be a challenging candidates for text field indexing in DB-IR integration.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.483-494
• /
• 2001

Most of hypertext retrieval models consider documents as independent entities. They ignore relationships between documents of link semantics. in an information retrieval system for hypertext documents, retrieval effectiveness can be improved when ling information is used. Previous link-based hypertext retrieval models ignore link information while indexing. They utilize link information to re-rank the retrieval results. Therefore they are limited that only the documents is result-set utilize link information. This paper utilizes link information when indexing. We present how to use term weighting and inLinks weighting for ranking the relevant documents. Experimental results show that recall and precision evaluation according to the link semantics and the comparison with previously link_based hypertext retrieval model.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.21-31
• /
• 2007

The intellectual property system was very important to the past industrial society. It is so important to the 21C information age. It is a leading role to developing these information society. Not only the digital content control but the technology of software source code for the intellectual property is so much mean to international competition. On occurring disputation property, we have to prove the fact, there is a problem to discriminate the original source code. In this paper, we make a study of the digital licence prototype for discriminate the original source code. Reserved words of software source code by parsing express to XML file that have hierarchical structure. Then, we can express architecture of software source code by tree structure form instead of complex source code. And we make a study of the indexing and searching to search digital license.