• Title/Summary/Keyword: database recovery

Search Result 154, Processing Time 0.026 seconds

Recovery Techniques for Memory Resident Databases (메인 메모리 상주 데이터 베이스 회복 기법)

  • Kim, Sang-Wook;Lee, Heon-Gyil;Kim, Yong-Seok
    • Journal of Industrial Technology
    • /
    • v.15
    • /
    • pp.51-62
    • /
    • 1995
  • Databases can crash due to various failures in computer systems. Recovery is a mechanism for restoring consistent data from damages caused by the by the failures and is an essential feature in database systems. This paper surveys recovery techniques for memory resident database systems. We first describe the basic architecture for memory resident database systems, and point out the main factors affecting their performance enhancement. Next, we explain the write-ahead logging(WAL), a recovery technique widely-used in most disk resident database systems, for easy understanding of basic recovery mechanisms. And then, we discuss some new concepts employed in memory resident database systems recovery. Finally, we present a representative memory resident database recovery technique, which is based on a special purpose hardware called HALO, as a case study.

  • PDF

SPaRe: Efficient SQLite Recovery Using Database Schema Patterns

  • Lee, Suchul;Lee, Sungil;Lee, Jun-Rak
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1557-1569
    • /
    • 2017
  • In recent times, the Internet of Things (IoT) has rapidly emerged as one of the most influential information and communication technologies (ICT). The various constituents of the IoT together offer novel technological opportunities by facilitating the so-called "hyper-connected world." The fundamental tasks that need to be performed to provide such a function involve the transceiving, storing, and analyzing of digital data. However, it is challenging to handle voluminous data with IoT devices because such devices generally lack sufficient computational capability. In this study, we examine the IoT from the perspective of security and digital forensics. SQLite is a light-weight database management system (DBMS) used in many IoT applications that stores private information. This information can be used in digital forensics as evidence. However, it is difficult to obtain critical evidence from IoT devices because the digital data stored in these devices is frequently deleted or updated. To address this issue, we propose Schema Pattern-based Recovery (SPaRe), an SQLite recovery scheme that leverages the pattern of a database schema. In particular, SPaRe exhaustively explores an SQLite database file and identifies all schematic patterns of a database record. We implemented SPaRe on an iPhone 6 running iOS 7 in order to test its performance. The results confirmed that SPaRe recovers an SQLite record at a high recovery rate.

The method of recovery for deleted record in Oracle Database (Oracle 데이터베이스의 삭제된 레코드 복구 기법)

  • Choi, Jong-Hyun;Jeong, Doo Won;Lee, Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.5
    • /
    • pp.947-955
    • /
    • 2013
  • Most of the enterprise information is stored in the database. Therefore, in order to investigate the company's criminal behavior, forensic analysis is important for the database and delete record is a need to develop recovery techniques. This paper is explained structure of the oracle database tablespace file and analyzed system tables that stored table information. Further, we suggests a method of recovery for deleted record in oracle tablespace.

A Recovery Scheme of Single Node Failure using Version Caching in Database Sharing Systems (데이타베이스 공유 시스템에서 버전 캐싱을 이용한 단일 노드 고장 회복 기법)

  • 조행래;정용석;이상호
    • 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.

The T-tree index recovery for distributed main-memory database systems in ATM switching systems (ATM 교환기용 분산 주기억장치 상주 데이터베이스 시스템에서의 T-tree 색인 구조의 회복 기법)

  • 이승선;조완섭;윤용익
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.1867-1879
    • /
    • 1997
  • DREAM-S is a distributed main-memory database system for the real-time processing of shared operational datra in ATM switching systems. DREAM-S has a client-server architecture in which only the server has the diskstorage, and provides the T-Tree index structure for efficient accesses to the data. We propose a recovery technique for the T-Tree index structre in DREAM-S. Although main-memory database system offer efficient access performance, the database int he main-memory may be broken when system failure such as database transaction failure or power failure occurs. Therfore, a recovery technique that recovers the database (including index structures) is essential for fault tolerant ATM switching systems. Proposed recovery technique relieves the bottleneck of the server processors disk operations by maintaining the T-Tree index structure only in the main-memory. In addition, fast recovery is guaranteed even in large number of client systems since the T-Tree index structure(s) in each system can be recovered cncurrently.

  • PDF

A recovery method for deleted records in the ESE Database (ESE 데이터베이스 내의 삭제된 레코드 복구 기법)

  • Kim, Jeong-hyeon;Choi, Jong-hyun;Lee, Sang-jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.5
    • /
    • pp.1143-1151
    • /
    • 2015
  • Extensible Storage Engine (ESE) database is a database developed by Microsoft. This database is used in web browser like Internet Explorer, Spartan and in Windows system with Windows Search, System Resource Usage Monitor. Previous ESE database viewer can display an incorrect result and can't read the file depending on collected environment and status of files. And the deleted record recovery tool is limited to some program and cannot recover all tables. This paper suggests the universal recovery method for deleted records and presents the experimental results through development of tool.

The Method of Deleted Record Recovery for MySQL MyISAM Database (MySQL MyISAM 데이터베이스의 삭제 레코드에 대한 복구 기법)

  • Noh, Woo-seon;Jang, Sung-min;Kang, Chul-hoon;Lee, Kyung-min;Lee, Sang-jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.1
    • /
    • pp.125-134
    • /
    • 2016
  • MySQL database is currently used by many users and It has gained a big market share in the database market. Even though MyISAM storage engine was used as a default storage engine before, but records recovery method does not existed. Deleted records have a high possibility for important evidence and it is almost impossible to determine that investigators manually examine large amounts of database directly. This paper suggests the universal recovery method for deleted records and presents the experimental results.

Digital Forensics Investigation of Redis Database (Redis 데이터베이스에 대한 디지털 포렌식 조사 기법 연구)

  • Choi, Jae Mun;Jeong, Doo Won;Yoon, Jong Seong;Lee, Sang Jin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.5
    • /
    • pp.117-126
    • /
    • 2016
  • Recently, increasing utilization of Big Data or Social Network Service involves the increases in demand for NoSQL Database that overcomes the limitations of existing relational database. A forensic examination of Relational Database has steadily researched in terms of Digital Forensics. In contrast, the forensic examination of NoSQL Database is rarely studied. In this paper, We introduce Redis (which is) based on Key-Value Store NoSQL Database, and research the collection and analysis of forensic artifacts then propose recovery method of deleted data. Also we developed a recovery tool, it will be verified our recovery algorithm.

Recovery Technique using PLT in a Page-Server Object Oriented DBMS (페이지-서버 객체지향 DBMS에서의 PLT를 이용한 회복기법)

  • Cho, Sung-Je
    • The KIPS Transactions:PartD
    • /
    • v.9D no.6
    • /
    • pp.1097-1104
    • /
    • 2002
  • Recently, with a drop in memory chip price and rapid development of mass storage memory chip technology, research on client-server Database Management Systems has gained wide attention. This Paper discusses the recovery technique in a page-server OODBMS environment. Although most researchers have studied client-server systems, the recovery technique has been a poor researches. In this paper, client transfers only the completed log records to the server and resolves the problems in the current recovery techniques. In addition, the server manages only the execution of completed log records suggesting a simple recover algorithm, Client uses system concurrency, fully, by acting to abort actions and it suggests a page unit recovery technique to reduce time that is required in the whole database.

Recovery Model Improvement using BISLD in Mobile Computing Environment (모바일 컴퓨팅 환경에서 BISLD를 이용한 회복모델 개선)

  • Cho, Sung-Je;Han, Seong-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.10
    • /
    • pp.4786-4793
    • /
    • 2012
  • In a recent mobile computing environment, the research for a transaction model have been actively carried out to deal with real-time transaction. However, the research for recovery model is relatively insufficient. Therefore, it would be very important for mobile recovery methods for database stability, just in case of data loss due to hand-off in mobile computing system. So, further efficient research should be keenly done to reduce I/O hand-off in mobile computing systems. SLL method increases I/O time due to sequential file. This paper have been suggested to efficient mobile recovery method in mobile computing system. Finally, it has been clearly demonstrated for system efficiency, conducting the performance assessment that currently proposed recovery system.