• Journal of Digital Convergence
• /
• v.7 no.4
• /
• pp.91-99
• /
• 2009

To determine factors affecting scholarly web database service quality, this research is to investigate factors of web academic information service quality, and analyze how these factors influencing on web academic information service quality satisfactions. As a results, three dimensions were identified namely, information retrieval, ease of use and interaction. The scholarly web database service management has more critical problems than information service in these days. It indicates that the qualitative aspect is becoming more important than quantitative in web academic information service management.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.06a
• /
• pp.48-67
• /
• 2002

This paper is a report on part of the results of a research project entitled "Research and Model Development for a Multi-Lingual Lexical Database". It Is a six-year project in which we aim to construct a model of a multilingual lexical database of Korean, Chinese, Japanese, and English. Now we have finished the first two-year stage of the project In this paper, we present the goal of the project, the construction model of items in the lexical database, and the possible (semi-)automatic methods of acquisition of lexical information. As an appendix, we present some sample items of the database as an i1lustration.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.1997-2007
• /
• 2000

This paper presents a new benchmark for object-relational database systems, which are regarded as the next-generation database system. This benchmark has been developed to evaluate system performance peculiar to object-relational database systems. The design philosophy, test databases, an test queries of the benchmark are presented. This benchmark features scaleability, use of a synthesized database only, and a query-oriented evaluation. We have implemented his benchmark with two commerical object-relational database systems and the experimental results are also reported.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.36-38
• /
• 2000

An optoelectronic database filter chip for high performance database computers and applications is proposed. The proposed device is designed to perform the selection and projection operations of relational database operation on-the-fly in page-parallel manner to increase the overall performance of a database system. The device utilizes CMOS smart pixel array consists of detector and combinational logic circuit to perform the selection and projection operation.

• Management & Information Systems Review
• /
• v.3
• /
• pp.133-150
• /
• 1999

This paper proposes to study on the interoperation between Relation Database(RDB) and Object-oriented database(OODB). It also describes some Characteristics of OODB and introduces the UniSQL system. This paper suggests a new systemcalled URODB (Unifide Relation & Object-oriented database) that will overcome the limits of OODB, improve the shortcomings of the present RDB, and increase the interchangeability in particular.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.446-449
• /
• 2002

To establish integrated Database, this paper (1) grasped key success factors of integrated data environment, (2) selected linking information through investigating information-oriented projects and database necessary to perform construction project in public section, (3) divided selected information into project-based information and general information, and then (4) presented plan of sharing knowledge through using the linking method of knowledge database and meta-database.

• IE interfaces
• /
• v.14 no.3
• /
• pp.247-254
• /
• 2001

As current postal automation is limited to dispatch and arrival sorting, delivery sequence sorting is performed manually by each postman. It not only acts as a bottleneck process in the overall mailing process but is expensive operation. To cope with this problem effectively, delivery sequence sorting automation is required. The important components of delivery sequence sorting automation system are sequence sorter and Hangul OCR which function is to extract the address of delivery point. DSI database will be interfaced to both Hangul OCR and sequence sorter for finding the accurate delivery sequence number and stacker number. The objectives of this research are to develop DSI(Delivery Sequence Information) database prototype and client application for managing information effectively. For database requirements collection and analysis, we draw all possible sorting plans, and apply the AHP(Analytic Hierarchy Process) method to determine the optimal one. And then, we design DSI database schema based on the optimal one and implement it using Oracle RDBMS. In addition, as address information in DIS database consist of hierarchical structure which has its correspondence sequence number, so it is important to reorganize sequence information accurately when address information is inserted, deleted or updated. To increase delivery accuracy, we reflect this point in writing application.

• Journal of Information Management
• /
• v.24 no.3
• /
• pp.31-56
• /
• 1993

In order to respond to the public needs to utilize the newspapers as high-valued information resources, the number of the commercially available news items which are transformed into a form of database has been remarkably increased by the introduction of CTS into the newspaper companies. As for the domestically available Japanese and foreign newspaper article database, explanations are given to the following items. 1) Characteristics of database, such as date of coverage, frequency updating, time-lag, news sources, search terms, available information, etc. 2) Matters to be noticed at the utilization. 3) Pattern of utilization depending on the object of the investigation, such as the investigation of company, market trend, etc. Since the newspaper article database will be available in a form of digitized information, making the combination with the inter-company LAN system possible, increased opportunities to use it in near future are expected.

• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.183-196
• /
• 2011

There has recently been a surge of interest in relational database mining that aims to discover useful patterns across multiple interlinked database relations. It is crucial for a learning algorithm to explore the multiple inter-connected relations so that important attributes are not excluded when mining such relational repositories. However, from a data privacy perspective, it becomes difficult to identify all possible relationships between attributes from the different relations, considering a complex database schema. That is, seemingly harmless attributes may be linked to confidential information, leading to data leaks when building a model. Thus, we are at risk of disclosing unwanted knowledge when publishing the results of a data mining exercise. For instance, consider a financial database classification task to determine whether a loan is considered high risk. Suppose that we are aware that the database contains another confidential attribute, such as income level, that should not be divulged. One may thus choose to eliminate, or distort, the income level from the database to prevent potential privacy leakage. However, even after distortion, a learning model against the modified database may accurately determine the income level values. It follows that the database is still unsafe and may be compromised. This paper demonstrates this potential for privacy leakage in multi-relational classification and illustrates how such potential leaks may be detected. We propose a method to generate a ranked list of subschemas that maintains the predictive performance on the class attribute, while limiting the disclosure risk, and predictive accuracy, of confidential attributes. We illustrate and demonstrate the effectiveness of our method against a financial database and an insurance database.

• Information Systems Review
• /
• v.1 no.2
• /
• pp.55-71
• /
• 1999