• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.409-421
• /
• 2004

A database sharing system (DSS) couples a number of computing nodes for high performance transaction processing, and each node in DSS shares database at the disk level. In case of node failures in DSS, database recovery algorithms are required to recover the database in a consistent state. A database recovery process in DSS takes rather longer time compared with single database systems, since it should include merging of discrete log records in several nodes and perform REDO tasks using the merged lo9 records. In this paper, we propose a two version caching (2VC) algorithm that improves the cache fusion algorithm introduced in Oracle 9i Real Application Cluster (ORAC). The 2VC algorithm can achieve faster database recovery by eliminating the use of merged log records in case of single node failure. Furthermore, it can improve the performance of normal transaction processing by reducing the amount of unnecessary disk force overhead that occurs in ORAC.

• Asian Journal for Public Opinion Research
• /
• v.7 no.2
• /
• pp.75-93
• /
• 2019

Background: Since 2010, Korea has maintained a DNA database of those convicted of or awaiting trial for certain crimes. There have been proposals to expand the list of crimes included in this database, or conversely, omit certain crimes if they are committed during protests. An understanding of the feelings of the public as we consider the ethical, legal, and social aspects of a DNA database and as revisions to laws are made is required. Methodology: Questions related to the DNA database were included in the nationally representative Korean Academic Multimode Open Survey (KAMOS) panel (June-August 2016). Results: Of 2,000 randomly selected panel members, 1,013 respondents participated in this survey, including 89.2% who supported the existence of a criminal DNA database. The current system of storing DNA profiles until a suspect's acquittal or a convict's death was supported by 79.5% of respondents. In addition, 70.8% of respondents agreed with the expansion of crime categories included in the criminal database. Many (93.4%) respondents favored genetic testing and data storage to determine the identity and cause of death for people who die of unnatural causes. Some differences in attitude related to social class were noted, with those who self-identified as members of the upper class more likely to support the database and its expansion to include additional crimes than those who self-identified as middle or lower class. Conclusion: Our findings suggest that Koreans generally support the criminal DNA database.

• The Journal of Information Technology and Database
• /
• v.6 no.1
• /
• pp.89-101
• /
• 1999

Increasing number of companies recognize that the understanding of customers and their markets is indispensable for their survival and business success. The companies are rapidly increasing the amount of investments to develop customer databases which is the basis for the database marketing activities. Database marketing is closely related to data mining. Data mining is the non-trivial extraction of implicit, previously unknown and potentially useful knowledge or patterns from large data. Data mining applied to database marketing can make a great contribution to reinforce the company's competitiveness and sustainable competitive advantages. This paper develops the classification model to select the most responsible customers from the customer databases for telemarketing system and evaluates the performance of the developed model using LIFT measure. The model employs the decision tree algorithm, i.e., CHAID which is one of the well-known data mining techniques. This paper also represents the effective database marketing strategy by applying the data mining technique to a credit card company's telemarketing system.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.11a
• /
• pp.61-66
• /
• 2005

Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.61-66
• /
• 2004

Fracture toughness database system was developed with Visual Foxpro 6.0 and operates in MS Windows environment. The database system contains 10,278 sets of $K_{IC}$ data, 7,046 sets of $K_{C}$ data, 784 sets of $J_{IC}$ data, 571 sets of CTOD data, 62 sets of $K_{a}$ data and 26 sets of $K_{Id}$ data. The data were collected from JSMS(Society of Material Science, Japan) fracture toughness data book and USAF(United States Air Force) crack growth database. In addition, the database was applied to predicting $K_{IC}$ from tensile material properties using artificial neural networks.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.183-186
• /
• 1996

The relational database management systems sometimes require extremely long and complicated queries for a certain retreval. In this case, recursive retirevals are more efficient approach than the usual queries. Many researchers have tried to incorporate semantics in the traditional relational models using artificial intelligence techniques. This new concept becomes a deductive database and sometimes it is also called as a logic programming. However, the designer of a deductive database did not overcome the short of relational database. In this paper, we propose a new way of designing queries for the deductive database. We also provide relations for recursive retrieval in the deductive database. These approaches are applied for the material requirement planning.

• IE interfaces
• /
• v.16 no.2
• /
• pp.258-267
• /
• 2003

Recently, virtual reality technologies have been rapidly developed and realtime virtual simulation methods have been extensively employed for several application areas such as game, sports, manufacturing, military, and so on. A 3D database in realtime virtual simulation plays a key role because it makes users feel reality in virtual space. In a application view of 3D database, a systematic construction approach is required to reduce its construction time and increase its quality. However, many researches have been mostly focused on realtime graphic issues and its key technologies. In virtual simulation of transportation equipments, this paper proposes a systematic construction process of 3D database consisting of four stages as follows: 1) determine the activity space of a equipment, 2) collect data related to 3D database construction, 3) make a 3-dimensional modeling strategy, and 4) generate and evaluate a 3D model. This paper also introduces a new procedure of 3D environment modeling, which summarizes and expands our modeling experiences, to be used as a modeling guide.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.4
• /
• pp.331-352
• /
• 2008

The person information is a database given free most lively. This study investigates the construction of the domestic person information database and the service present situation. And I compare a search item and a search method with problems for the biographical database construction process and analyze it. I analyze the problems of the person information database and show the person idea who can solve this. I use term relations and the attribute data of the person which used thesaurus by biographical database construction with this purpose.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.726-729
• /
• 2004

Spatiotemporal phenomena are ubiquitous aspects of real world. In the spatial and temporal databases, integrity constraints maintain the semantics of specific application domain and relationship between domains when proceed update in the database. Efficient maintenance of data integrity has become a critical problem, since testing the validity of a large number of constraints in a large database and after each transaction is an expensive task. Especially, in spatiotemporal domain, data is more complex than traditional domains and very active. Additionally, it is not considered that unified frameworks deal with both spatial and temporal properties to handle integrity constraints. Therefore, there need a model to maintain integrity constraints in the unified frameworks and enforcement and management techniques in order to preserve consistence.

• The Journal of Information Systems
• /
• v.6 no.1
• /
• pp.159-180
• /
• 1997

Database sharing system(DBSS) refers to a system for high performance transaction processing. In DBSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory, a separate copy of operating system, and a DBMS. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. However, since multiple nodes may be simultaneously cached a page, cache consistency must be ensured so that every node can always access the latest version of pages. In this paper, we propose efficient buffer invalidation schemes in DBSS, where the database is logically partitioned using primary copy authority to reduce locking overhead. The proposed schemes can improve performance by reducing the disk access overhead and the message overhead due to maintaining cache consistency. Furthermore, they can show good performance when database workloads are varied dynamically.