• Journal of Korea Spatial Information System Society
• /
• v.5 no.2 s.10
• /
• pp.69-82
• /
• 2003

Mobile transactions updating spatial objects are long transactions that update local objects of mobile clients during disconnection. Since a recovered transaction cannot read the write sets of other transactions committed before the recovery due to disconnection, the recovered transaction may conflicts with them. However, aborting of the recovered long transaction leads to the cancellation of all updates including the recovered updates. It is definitely unsuitable to cancel the recovered updates due to the conflicts. In this paper, we propose the recovery scheme to retrieve foreign conflictive objects from the write sets of other transactions for reducing aborting of a recovered transaction. The foreign conflictive objects are part of the data committed by other transactions and may conflict with the objects updated by the recovered transaction. In the scheme, since the recovered transaction can read both the foreign conflictive objects and the recently checkpoint read set, it is possible to reupdate properly the potentially conflicted objects.

• Journal of the Korea Society for Simulation
• /
• v.12 no.2
• /
• pp.55-62
• /
• 2003

The explosive Increase of wireless networks and the advancement of mobile devices lead to the expansion of mobile environment. In accordance with the development of mobile environment, the need to use mobile database is increased sharply, and also it accompanies the related problems. The current mobile database system is based on the centralized method from which a synchronized server manages multiple mobile database management system to synchronize. From this mobile system architecture, several kinds of problems can be detected such as the management of synchronization issues between mobile databases and the transaction management issues. Furthermore, the current mobile database management system does not consider any solution on the fault tolerance. To solve those problems, this paper proposes the mobile agent-based mobile database management system. The proposed system provide high confidence and efficiency by enhancing the network efficiency and fault tolerance through the mobile grouping.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.4
• /
• pp.71-83
• /
• 2008

The recent advances of the information technology have motivated lots of research efforts to develop new computer-aided teaching and learning methodologies on various computer science topics, such as data structures, operating system, computer networks, and computer architecture. However, there have been only few studies to educate the database subject although it is one of the most important topics in the computer science. Specifically, among the various issues in the database subject, a learner often suffers to understand the mechanism of the concurrency control and recovery of database transaction in the database because it highly interacts with other functions in the database. Obviously, an intelligent visualization tool can help a learner to understand the process of the concurrency control and the recovery of database transaction. The purpose of this study is to develop an efficient visualization tool which can help users understand the two phase locking protocol (2PLP)-based concurrency control. Specifically, this visualization tool is designed to encourage a users' participation and raise their interest by visualizing the process of transactions and allowing users to specify and manipulate their own transactions.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.4
• /
• pp.859-868
• /
• 2018

Previous research related to recovering deleted data in database has been mainly based on transaction logs or detecting and recovering data using original source files by physical collection method. However there was a limit to apply if the transaction log does not exist in the server or it is not possible to collect the original source file because a database server owner does not permit stopping the database server because of their business loss or infringement at the scene. Therefore it is necessary to examine various collection methods and check the recoverability of the deleted data in order to handling the constraints of evidence collection situation. In this paper we have checked an experiment that the recoverability of deleted data in the original database source according to logical and physical collection methods on digital forensic investigation of Microsoft SQL Server database.

• The Journal of Industrial Distribution & Business
• /
• v.9 no.6
• /
• pp.49-55
• /
• 2018

Purpose - This paper examines the effect of related party transactions on crash firm-specific stock price crash risk. Ownership of a typical Korean conglomerate is concentrated in a single family. In those entities, management and board positions are often filled by family members. Therefore, a dominant shareholder can benefit from related party transactions. In Korea, firms have to report related party transactions in financial statement footnotes. However, those are not disclosed in detail. The more related party transactions are the greater information risk. Thus, companies with related party transactions are likely to experience stock price crashes. Research design, data, and methodology - 2,598 firm-year observations are used for the main analysis. Those samples are from TS2000 database from 2009 to 2013, and the database covers KOSPI-listed firms in Korea. The proxy for related party transactions (RTP) is calculated by dividing total transactions to the related-party by total sales. A dummy variable is used as a dependent variable (CRASH) in the regression model. Logistic regression is used to explain the relationship between related party transactions and crash risk. Then, the sample was separated into two groups; tunneling firms and propping firms. The relation between related party transactions and crash risk variances with features of the transaction were investigated. Results - Using a sample of KOSPI-listed firms in TS2000 database for the period of 2009-2013, I find that stock price crash risk increases as the trade volume of related-party transactions increases. Specifically, I find that the coefficient of RPT is significantly positive, supporting the prediction. In addition, this relationship is strong and robust in tunneling firms. Conclusions - The results report that firms with related party transactions are more likely to experience stock price crashes. The results mean that related party transactions increase the possibility of future stock price crashes by enlarging information asymmetry between controlling shareholders and minority shareholders. In case of tunneling, it could be seen that related party transactions are positively associated with stock crash risk. The result implies that the characteristic of the transaction influences crash risk. This study is related to a literature that investigates the effect of related party transactions on the stock market.

• Convergence Security Journal
• /
• v.12 no.2
• /
• pp.107-113
• /
• 2012

Recently, according to the establishment of personal information protection Act, the public and private organizations are taking a step to protect personal information rights and interests by employing the technical methods such as the access control mechanism, cryptography, etc. The result of the personal information leakage causes a serious damage for the organization image and also has to face with the responsibility by law. However, applying access control and cryptographic approach on the personal information item for every connection to large database system causes significant performance degradation in a large database system. In this paper, we designed and implemented the light weight system using JVM (Java Virtual Machine) for the Oracle DBMS environment which the concurrent transaction occurs many, thereby the proposed system provides the minimum impact on the system performance and meets the need of personal information protection. The proposed system was validated on the personal information protection system which sits on a 'A' public organization's portal site and personnel information management system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1350-1355
• /
• 2011

It is very important issues to protect many system resources using authorized client authentication in distributed client server systems. So it is not enough to prevent unauthorized opponents from attacking our systems that client authentication is performed using only the client's identifier and password. In this paper, we propose a secure authentication database modeling with two authentication keys such as a client authentication key and a server authentication key. The proposed authentication model can be used making high quality of computer security using two authentication keys during transaction processing. The two authentication keys are created by client and server, and are used in every request transaction without user's extra input. Using the proposed authentication keys, we can detect intrusion during authorized client's transaction processing because we can know intrusion immediately through comparing stored authentication keys in client server systems when hackers attack our network or computer systems.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.107-113
• /
• 2015

In a database system, updates on pages that are made by a transaction should be stored in a secondary storage before the commit is complete. Generic secondary storages have volatile DRAM caches to hide long latency for non-volatile media. However, as logs that are only written to the volatile DRAM cache don't ensure durability, logging latency cannot be hidden. Recently, a flash SSD with capacitor-backed DRAM cache was developed to overcome the shortcoming. Storage devices, like those with a non-volatile cache, will increase transaction throughput because transactions can commit as soon as the logs reach the cache. In this paper, we analyzed performance in terms of transaction throughput when the SSD with capacitor-backed DRAM cache was used as log storage. The transaction throughput can be improved over three times, by committing right after storing the logs to the DRAM cache, rather than to a secondary storage device. Also, we showed that it could acquire over 73% of the ideal logging performance with proper tuning.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3447-3455
• /
• 1999

Database correctness is guaranteed by standard transaction scheduling schemes like two-phase locking for the context of concurrent execution environment in which short-lived ones are normally mixed with long-lived ones. Traditional syntax-oriented serializability notions are considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in distributed database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of concurrency and average transaction waiting time under the circumstances that the size of long-transaction is in between 5 and 9.

• 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.