• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.585-592
• /
• 2003

In the spatial database systems, it is necessary to manage spatial objects that have two or more aspatial information with different security levels on the same layer. If we adapt the polyinstantiation concept of relational database system for these spatial objects, it is difficult to process the representation problem of spatial objects and to solve the security problem that is service denial and information flow by access of subject that has a different security level. To address these problems, we propose a polyinstantiation method for security management of spatial objects in this paper. The proposed method manages secure spatial database system efficiently by creating spatial objects according to user's security level through security-level-conversion-step and polyinstantiation-generation-step with multi-level security policy. Also, in case of user who has a different security level requires secure operations, we create polyinstance for spatial object to solve problems of service denial and information flow.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.175-181
• /
• 2006

AMobile-supported spatial database systems have been introduced with development of mobile computing technology, they offer an advantage that we can access the data wherever we are. However, the studies on database system in traditional distributed environments must be reconsidered again, because of characteristics of mobile database system such as mobility and instability of wireless network. A new transaction model should be required for considering the characteristics, since especially a mobile computing environment is location-dependent, compared with the location transparency in a distributed computing environment. In other aspect, normally mobile host may be moving not in all space, but in some limited path. That is, a host is moving along the roads or the geographical features adjacent to the roads. The transaction processing should be considered not on the spatial coordinate but on the geographical features. In this paper, the feature based transaction processing model is proposed to process location-dependent transaction efficiently.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.97-105
• /
• 2004

The purpose of this study is to design and implement web-based quality cost management system to measure the performance of quality improvement activities in the business firms. The designed web-based quality cost management system which is also known as WQCMS (Web-based Q-Cost Management System) utilized newly classified objective performance indicator items to measure quality related activities. Well-classified performance measurement Indicator item lists which are played key role in the system was researched and standardized according to size and business categories of enterprise. Its code standards are based from fundamental PAF Model. Developed WQCMS have ability to collect and analyze quality data generated from various different departments in the inside or outside of the enterprise without any limitations, if end-users are able to access wide area network. It provides the capability to integrate quality information from database and to generate various easy analysis reports to management's needs using built-in analysis tool modules with real-time. The proposed system was developed using Microsofi's .Net technology, ASP.NET and MS-SQL Server 2000. By web-enabling Q-cost management system, the effectiveness of the system management and utilization was realized by easiness of information Integration and economical efficiency.

• Journal of the Korean Society for information Management
• /
• v.38 no.3
• /
• pp.263-285
• /
• 2021

It is necessary to recognize the urgency and importance of administrative information dataset management and study effective management measures and specific procedures applicable in practice. Particularly, identify dataset records and developing records schedule for records management needs to be presented in detail and specific. This study designed and verified an identification method and appraisal procedure of dataset records in public administrative information systems dataset operating in public institutions. In addition, this study presented the role of the participants including the records center in the appraisal process. Through this, useful implications are derived for the development of specific and practical processes and tools for dataset management in the records center.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.1-17
• /
• 2009

E-Catalogs which describe products or services are one of the most important data for the electronic commerce. E-Catalogs are created, updated, and removed in order to keep up-to-date information in e-Catalog database. However, when the number of catalogs increases, information integrity is violated by the several reasons like catalog duplication and abnormal classification. Catalog search, duplication checking, and automatic classification are important functions to utilize e-Catalogs and keep the integrity of e-Catalog database. To implement these functions, probabilistic models that use statistics of index words extracted from e-Catalogs had been suggested and the feasibility of the methods had been shown in several papers. However, even though these functions are used together in the e-Catalog management system, there has not been enough consideration about how to share common data used for each function and how to effectively manage statistics of index words. In this paper, we suggest a method to implement these three functions by using simple SQL supported by relational database management system. In addition, we use materialized views to reduce the load for implementing an application that manages statistics of index words. This brings the efficiency of managing statistics of index words by putting database management systems optimize statistics updating. We showed that our method is feasible to implement three functions and effective to manage statistics of index words with empirical evaluation.

• Korean Journal of Construction Engineering and Management
• /
• v.2 no.3 s.7
• /
• pp.75-82
• /
• 2001

Traditional bidding process and activities in public construction area has many problems in terms of the clearness and fairness of administration. And, it causes many cost consumption to suppliers. As part of the efforts to solve these problems, some public institutions developed the electronic bidding systems. But these systems have still problems in diverse aspects. Therefore, the purpose of this study is to analyze current bidding systems through literature survey, case study and process mapping methodology, to compare the result of the analysis with the developed electronic bidding systems and to suggest the improvement for the coming bidding systems. As results of this study, key processes and classified contract types about public construction bidding were identified. These can be applied by means of guidelines when public institutions are planning new electronic bidding systems. The composition of unified driving organization, the database development for information share and the standardization of national level for the new electronic bidding systems were also suggested.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.

• Journal of the Korea Convergence Society
• /
• v.7 no.6
• /
• pp.43-48
• /
• 2016

Wireless sensor networks (WSN) can be more reliable and easier to program and use with the help of sensor database management systems (SDMS). SDMS establish a user-friendly SQL-based interface to process declarative user-defined queries over sensor readings from WSN. Typical queries in SDMS are ad-hoc snapshot queries and long-running, continuous queries. In SDMSs queries are flooded to all nodes in the sensor net, and query results are sent back from nodes that have qualified results to a base station. For query flooding to all nodes, and result flooding to the base station, a lot of communication energy consuming is required. This paper suggests an efficient in-network index solution, named Distributed Information Gathering (DIG) to process range queries in a sensor net environment that can save energy by reducing query and result flooding.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.549-561
• /
• 2000

In database management systems(DBMSs), partial rollback is a useful facility that cancels part of the executed operations upon user's requests without a total rollback. Many relational DBMSs(RDBMSs) provide this facility, However, object-orientccd DBMSs (OODBMSs) cannot utilize the previous recovery scl18lne of partial rollback usccd in (RDBMSs) since, unlike RDBMSs, they use a dual buffer consisting of an object buffer and a page buffer. Therefore, a new recovery scheme is required that rolls back the data efficiently in the dual buffer. We propose four partial rollback schemes in OODBMSs that use a dual buffer. We classify the proposed schemes into the single buffer based partial rollback scheme and the dual buffer based partial rollback scheme according to the number of buffers used for partial rollback processing. We further classify them into Uthe page buffer based partial rollback scheme, 2)the object buffccr based partial rollback scheme, 3)the dual buffer based partial rollback scheme using soft log, and 4)the dual buffer based partial rollback scheme using shadows. We evaluate the performance by mathematical analysis and experiments. The results show that the dual buffer based partial rollback scheme using shadows provides the best performance.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.45-56
• /
• 2003

In the wireless environment, according to the development of technology, which is able to obtain location information of spatiotemporal moving object, the various application systems are developed such as vehicle tracking system, forest fire management system and digital battle field system. These application systems need the data model, which is able to represent and process the continuous change of moving object. However, if moving objects are expressed by a relational model, there is a problem which is not able to store all location information that changed per every time. Also, existing data models of moving object have a week point, which constrain the query time to the time that is managed in the database such as past or current and near future. Therefore, in this paper, we propose a data model, which is able to not only express the continuous movement of moving point and moving region but also process the operation at all query time by using shape-change process and location determination functions for past and future. In addition, we apply the proposed model to forest fire management system and evaluate the validity through the implementation result.