• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.1-13
• /
• 1994

The Temporal Database Management Testbed supports valid and transaction time. In this paper, we discuss the design and implementation of a testbed of a temporal database management system in main memory. The testbed consists of a syntactic analyzer, a semantic analyzer, a code generator, and an interpreter. The syntactic analyzer builds a parse tree from a temporal query. The semantic analyzer then checks it for correctness against the system catalog. The code generator builds an execution tree termed ann update network. We employ an incremental view materialization for the execution tree. After building the execution tree, the interpreter activates each node of the execution tree. Also, the indexing structure and the concurrency control are discussed in the testbed.

• Journal of the Korean Society for Library and Information Science
• /
• v.17
• /
• pp.49-83
• /
• 1989

A Full text retrieval system is a natural language document retrieval system in which the full text of all documents in a collection is stored on a computer so that every word in every sentence of every document can be located by the machine. This kind of IR System is recently becoming rapidly available online in the field of legal, newspaper, journal and reference book indexing. Increased research interest has been in this field. In this paper, research on full text databases and retrieval systems are reviewed, directions for research in this field are speculated, questions in the field that need answering are considered, and variables affecting online full text retrieval and various role that variables play in a research study are described. Two obvious research questions in full text retrieval have been how full text retrieval performs and how to improve the retrieval performance of full text databases. Research to improve the retrieval performance has been incorporated with ranking or weighting algorithms based on word occurrences, combined menu-driven and query-driven systems, and improvement of computer architectures and record structure for databases. Recent increase in the number of full text databases with various sizes, forms and subject matters, and recent development in computer architecture artificial intelligence, and videodisc technology promise new direction of its research and scholarly growth. Studies on the interrelationship between every elements of the full text retrieval situation and the relationship between each elements and retrieval performance may give a professional view in theory and practice of full text retrieval.

• Journal of Integrative Natural Science
• /
• v.2 no.4
• /
• pp.243-251
• /
• 2009

This paper surveys some researches to accomplish on bioinformatics. These researches wish to propose a database architecture combining a general view of bioinformatics data as a graph of data objects and data relationships, with the efficiency and robustness of data management and query provided by indexing and generic programming techniques. Here, these invert the role of the index, and make it a first-class citizen in the query language. It is possible to do this in a structured way, allowing users to mention indexes explicitly without yielding to a procedural query model, by converting functional relations into explicit functions. In the limit, the database becomes a graph, in which the edges are these indexes. Function composition can be specified either explicitly or implicitly as path queries. The net effect of the inversion is to convert the database into a hyperdatabase: a database of databases, connected by indexes or functions. The inversion approach was motivated by their work in biological databases, for which hyperdatabases are a good model. The need for a good model has slowed progress in bioinformatics.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.16 no.2
• /
• pp.139-156
• /
• 2005

In this paper, we design and implement electronic book system providing web-based interface for the ebook. The aim of this study is to optimize the effective reading and management of electronic text for its users(readers and librarians). Advanced functions of the electronic book system are the following: 1) Electronic book system is not dependent to specific software and tool. 2) Electronic book system is able to. minimize images(table, image, icon etc) to improve the meaning and readability of information. 3) Electronic book system is able to reduce the effort for indexing extraction and constructing the table of content. 4) The system is able to collect the user log files that are created during the process of reading ebook from various points of view. 5) When reading, the system uses the DRM through decoding and encoding the ebook.

• Journal of Information Management
• /
• v.39 no.4
• /
• pp.121-154
• /
• 2008

In this paper, a ontology-based keyword structuring method is proposed to represent the knowledge structure of scholarly documents and to make inferences from the semantic relationships holding among them. The characteristics of thesaurus as a knowledge organization system(KOS) for subject heading is critically reviewed from the information retrieval point of view. The domain concepts are identified and classified by analysis of the information activities occurring in a general research process based on scholarly sensemaking model. The ontological structure of keyword set is defined in terms of the semantic relationship of the canonical concepts which constitute scholarly documents such as journal articles. As a result, each ontologically structured keyword set of a document represents the knowledge structure of the corresponding document as semantic index. By means of the axioms and inference rules defined for information needs, users can efficiently explore the scholarly communication network built on the semantic relationship among documents in an analytic way based on the scholarly sensemaking model in oder to efficiently retrieve the relevant information for problem solving.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.1
• /
• pp.85-91
• /
• 2011

The technique, which is able to detect and recognize characters in videos such as a movie or TV drama, can be used for applications which are database management of a general user's facial images for the suppliers of PVR(personal video recorder), mobile phones, and multimedia, etc. In this paper, we propose a face detection algorithm. It searches the character through cast indexing when the scene is changed in video. It is consisted of three stages. The first step is the detection-step of the scene change after producing a paused image. The second step is the face detection-step using color information. The final step is the detection-step which detects its features by the facial boundary. According to the experimental result, it has detected faces in different conditions successfully and more advanced than the existing other one that are using only color information.