• Journal of the Korea Computer Industry Society
• /
• v.5 no.5
• /
• pp.699-710
• /
• 2004

It is one of important techniques to protect illegal uses and forgeries for text databases when the internet has become widsepread. Lots of studies and system developments has been progressed in order to protect text databases, important documents of the companies, and blueprints of the research institutes. Given this project securing the KISTI (Korea Institute of Science and Teschnology Information) digital contents, we are to design a watermaking and fingerprinting system protecting document images, and a agent notifying the traitors' location.

• Journal of Information Management
• /
• v.24 no.4
• /
• pp.58-77
• /
• 1993

Database of journals/books are categorized into bibliographic database and clearinghouse-type databases which tell you locations of original materials. There is such a problem in the latter type of databases that those are not likely to be commercialized, although ultimate purpose which users have is to obtain original materials. We find photocopying service through on-line or full-text databases currently available, but we can't get information which meets our needs only by those databases. This paper describes major database services and how to use them by document type(journal or book). The author also discusses what future information centers utilizing databases should be.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.427-433
• /
• 2004

Most information providers are offering integrated retrieval service based on the bibliographic metadata and schema corresponding to each type of document which are developed in a distributed and independent way. However, it is difficult to maintain the relational consistency of those single heterogeneous databases even though they obey the metadata standard like MARC or MODS. It is the main reason that those standards are restricted to present the general property of document regardless of its type and not to applied to define the relationship of document types. Therefore, It is necessary to define a comprehensive meta model to associate the related databases in a systematic way so that the semantically common part of them can be easily shared and reused without any additional effort like conversion or mapping. In this paper, we first outline the document types for designing meta model by the empirical analysis of various data schema of main information providers. We propose then data element definition, metadata model and modularized XML DTD which support the efficient and consistent management of multiple ducument types.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

• The Journal of Information Systems
• /
• v.10 no.1
• /
• pp.257-278
• /
• 2001

An IR(information retrieval) index for dynamic document databases where insertion, deletion, and update of documents happen frequently should be frequently updated. As the conventional structure of IR index is, however, focused on the information retrieval purpose, its structure is inefficient to handle dynamic update of it. In this paper, we propose a new structure for IR Index, we call it Index Graph, which is organized by connecting multiple indexes into a graph structure. By analysis and experiment, we prove the Index Graph is superior to the conventional structure of IR index in the performance of insertion, deletion, and update of documents as well as the performance of information retrieval.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.103-106
• /
• 2006

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.720-732
• /
• 1996

Spatial match retrieval methods for iconic image databases recognize an image document as several icon symbols. Therefore the iconic symbols are used as primary keys to index the image document. When a user requires content-based retrieval ofimages, a spatial match retrieval method converts a query image into iconic symbols and then retrieves relevant images by accessing stored images. In order to support content-based image retrieval efficiently, we, in this paper, propose spatial match retrieval methods using signatures for iconic image databases. For this, we design new index representations of two-dimensional iconic images and explain implemented system.. In addition, we compare the conventional 9-DLT and our two-dimensional image retrieval method in terms of retrieval precision and recall ratio. We show that our method is more efficient than the conventional method.

• IE interfaces
• /
• v.17 no.3
• /
• pp.330-337
• /
• 2004

Since XML (eXtensible Markup Language) was highlighted as an information interchange format, there is an increasing demand for incorporating XML with databases. Most of the approaches are focused on RDB (Relational Databases) because of legacy systems. But these approaches depend on the database system. Countless researches are being focused on DTD (Document Type Definition). However XML Schema is more comprehensive and efficient in many perspectives. We propose a meta-model for XML Schema that is independent of the database. There are three processes to build our meta-model: DOM (Document Object Model) tree analysis, object modeling and storing object into a fixed DB schema using model mapping approach. We propose four mapping rules for object modeling, which conform to the ODMG (Object Data Management Group) 3.0 standard. We expect that the model will be especially useful in building XML-based e-business applications.

• Proceedings of the CALSEC Conference
• /
• 2005.03a
• /
• pp.55-61
• /
• 2005

We will introduce a new web-based knowledge management system in progress, in which XML-based web information extraction and our structuring knowledge technologies are combined using ontology-based natural language processing. Our aim is to provide efficient access to heterogeneous information on the web, enabling users to use a wide range of textual and non textual resources, such as newspapers and databases, effortlessly to accelerate knowledge acquisition from such knowledge sources. In order to achieve the efficient knowledge management, we propose at first an XML-based Web information extraction which contains a sophisticated control language to extract data from Web pages. With using standard XML Technologies in the system, our approach can make extracting information easy because of a) detaching rules from processing, b) restricting target for processing, c) Interactive operations for developing extracting rules. Then we propose a structuring knowledge system which includes, 1) automatic term recognition, 2) domain oriented automatic term clustering, 3) similarity-based document retrieval, 4) real-time document clustering, and 5) visualization. The system supports integrating different types of databases (textual and non textual) and retrieving different types of information simultaneously. Through further explanation to the specification and the implementation technique of the system, we will demonstrate how the system can accelerate knowledge acquisition on the Web even for novice users of the field.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.289-302
• /
• 2007

The existing query processing technique for CXQuery, which is able to query regardless of knowledge about XML document structures, is difficult to manage because of table join for query processing and results return, mapping XML documents into relational tables, and so on. In this paper we have developed a converter capable of converting CXQuery to XQuery in order to make use of the query processing techniques for XQuery progressing standardization. The converting speed of the converter takes a trifling time as much as negligible quantities in comparison with the total query processing time. This is also able to query directly XML documents regardless of relational databases, and users can query without knowledge about XML document structures.