• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권4호
• /
• pp.260-263
• /
• 2008

In this paper we propose Personal Information Management System for Library Database. It manages personal search pattern for the given user and provide specific book list for library book search system. With the proposed system, the conventional overlap searching time will be decreased with personalized information and search history. This system manages the individual data according to personal searching pattern, sequence and usability. Therefore, the user can locate necessary book information more accurately with their distinct interest and search history.

• Asia pacific journal of information systems
• /
• 제8권2호
• /
• pp.1-18
• /
• 1998

As the management and preservation of the environment become an important social issue, information required to support environmental task is required. So, there is an increasing demand for environmental information and appropriate systems to manage it. The vast volume of environmental data is distributed in different knowledge domains and systems. Environmental data objects have the complex structure containing environmental quality data and attribute data. Environmental information systems must be able to address these properties. This research has aimed at constructing well-defined schema design of environmental data, and making system architecture that environmental data kept by authorities should be made available to the public user. There are 3 major components in environmental information systems architecture ; User interface, Catalog libraries, Communication Provider. Web browsers provide consistent and intuitive user interfaces on Internet. The communication provider is a collection of diverse CGI functions. The main roles of the CGIs are to build interfaces between the Web, databases. Catalog libraries is libraries of various matadata including administration matadata. Administration matadata support the environmental administration and the managerial aspects of environmental data rather than explain a database itself or its properties.

• International Journal of Computer Science & Network Security
• /
• 제23권5호
• /
• pp.128-134
• /
• 2023

The widespread usage of blockchain technology in cryptocurrencies has led to the adoption of the blockchain concept in data storage management systems for secure and effective data storage and management. Several innovative studies have proposed solutions that integrate blockchain with distributed databases. In this article, we review current blockchain databases, then focus on two well-known blockchain databases-BigchainDB and FalconDB-to illustrate their architecture and design aspects in more detail. BigchainDB is a distributed database that integrates blockchain properties to enhance immutability and decentralization as well as a high transaction rate, low latency, and accurate queries. Its architecture consists of three layers: the transaction layer, consensus layer, and data model layer. FalconDB, on the other hand, is a shared database that allows multiple clients to collaborate on the database securely and efficiently, even if they have limited resources. It has two layers: the authentication layer and the consensus layer, which are used with client requests and results. Finally, a comparison is made between the two blockchain databases, revealing that they share some characteristics such as immutability, low latency, permission, horizontal scalability, decentralization, and the same consensus protocol. However, they vary in terms of database type, concurrency mechanism, replication model, cost, and the usage of smart contracts.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.275-278
• /
• 1996

We propose dynamic file allocation method in distributed database management system with changing access patterns. There are a lot of studies on file allocation problem in D-DBMS, and those studies deal with off-line analysis and optimization. Those works are well for systems with static database access patterns, but are inadequate for systems that have changing access patterns. In these systems, dynamic file allocation along with access pattern is more proper. In advance, Brunstrom et al. studied on this area, but they dealt a extremely simplified model. So, we make more practical models to simulate real system. In these models, many factors that were disregard in the advance study are considered. These models are composed with the non-replication system and the replication system. In addition to, we deal with CPU workload balancing in such system in order to improve performance of systems. Our methodology is very simple and realistic, therefore we think that it will give a lot of improvement in D-DBMS with changing access pattern.

• 전자공학회논문지C
• /
• 제35C권3호
• /
• pp.32-45
• /
• 1998

A partitioned signature file is an enhancement of the signature file that divides all the signatures into blocks in such a way that each block contains the signatures with the same key. Its directory storesall the keys as meta information for avoiding unnecessary block accesses by examming them first before the acture searching of the blocks.. Efficient directory management is very important in large databasse environments since ist size gets larger proportionally to that of the database. In this paper, we first point out the problems in the directory management methods of the previous partitioned signature files, and then present a new one solving them. OUr method offers good features in the followint three aspects: (1) suitability for large database environments, (2) adaptability to dynamic situations, and (3) storage overhead for the directory. Moreover, we can seamlessly integrate it as a subcomponent into previously-developed general-purpose storage engines. These features show that our method is applicableto signature-based access structures for the content-based retrieval in various multimedia applications such as hypermedia systems, digital library systems, multimedia document systems, multimedia mailing systems, and so on.

• 한국지능시스템학회논문지
• /
• 제20권4호
• /
• pp.554-561
• /
• 2010

As a fundamental knowledge source in a global learning environment, it is feasible to apply the relational database management systems (RDBMS), object-oriented database management systems (OODBMS), and other traditional DBMS. However, the traditional DBMSs are not feasible in semantic knowledge/ontology representation and inference. One of the reasonable ways to overcome the limitations is the semantic web-based business support framework. Especially, in this study, we focused on the development of semantic web ontology and natural language (NL)-based inference framework. To validate the efficiency of the proposed framework, we considered a reasonable scenario for course recommendation in a university.

• 한국데이타베이스학회:학술대회논문집
• /
• 한국데이타베이스학회 1999년도 춘계공동학술대회: 지식경영과 지식공학
• /
• pp.161-171
• /
• 1999

Query language has been widely used as a convenient tool to obtain information from a database. However, users demand more intelligent query processing systems that can understand the intent of an imprecise query and provide additional useful information as well as exact answers. This paper introduces a meta-database and presents a query processing mechanism that supports a variety of intelligent queries in a consistent and integrated way. The meta-database extracts data abstraction knowledge from an underlying database on the basis of a multilevel knowledge representation framework KAH. In cooperation with the underlying database, the meta-database supports four types of intelligent queries that provide approximately or conceptually equal answers as well as exact ones.

• 한국전자거래학회지
• /
• 제4권1호
• /
• pp.1-19
• /
• 1999

Workflow management system provides automation of job processes by maintaining shareability on information about various job process schedules and persons related to those schedules. Existing workflow management systems use file or database to store the information generated in those systems. However, file or database system could manage only non-complicated information for the workflow but not the information resources of an enterprise which is complicated and of various formats. Therefore, we need a data management system that could control those information resources. This system should manage the data which are distributed at several places geographically. Information Repository could meet those requirements. Information Repository may integrate, store and manage information resources requested by application systems. We have an international standard for the information repository, Information Resources Dictionary System(IRDS). The IRDS, however, does not support distributed environment. In this paper, we design and implement an information repository based on IRDS that may be operated in distributed environment. We verify that this information repository is more effective and is more effective than any other file or database system.

• Asia pacific journal of information systems
• /
• 제7권3호
• /
• pp.23-37
• /
• 1997

Although numerous models and solution algorithms to design efficient distributed databases have been developed, very few have been validated for their effectiveness. In this paper, we develop a simulation system which can be used to analyze and validate the average response time of distributed database designs. Our simulation system models comprehensive query processing strategies such as semijoin as well as a concurrency control mechanism We analyze and validate an average response time distributed database design model using our simulation system.

• Asia pacific journal of information systems
• /
• 제2권2호
• /
• pp.85-102
• /
• 1992

A deductive database consists of collection of stored facts and deductive rules. It can answer queries based on logical deduction from the stored facts and general rules. A deductive database has both a declarative meaning(semantics) and a procedural meaning. The declarative semantics of a deductive database provides a definition of the meaning of the program in a manner which is independent of procedural considerations, context-free, and easy to manipulate, exchange and reason about. This paper investigates various declarative semantics of deductive databases, dicusses related computational issues, and suggests another declarative semantics for deductive databases which is more practical than others.