• Title/Summary/Keyword: data storage algorithm

Search Result 448, Processing Time 0.027 seconds

Storage and Retrieval Architecture based on Key-Value Solid State Device (Key-Value Solid State Device 기반의 저장 및 검색 아키텍처)

  • Sun, Yu Xiang;Lee, Yong-Ju
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.1
    • /
    • pp.45-52
    • /
    • 2020
  • This paper proposes a solution for storage and retrieval problems for Resource Description Framework (RDF) data utilizing a key-value Solid State Device (SSD), considering storage, retrieval performance, and security. We propose a two-step compression algorithm to separate logical relationship and true values from RDF data-sets using the key-value SSD. This improves not only compression and storage efficiency but also storage security. We also propose a hybrid retrieval structure based on R∗-tree to enhance retrieval efficiency and implement a sort-merge join algorithm, and discuss factors affecting R∗-tree retrieval efficiency. Finally, we show the proposed approach is superior to current compression, storage, and retrieval approaches, obtaining target results faster while requiring less space, and competitive in terms of versatility, flexibility and security.

Disc Tilt Error Measurement using Reconstructed Image Pattern for Holographic Data Storage (홀로그래픽 정보저장기기의 재생 이미지 패턴을 이용한 디스크 틸트 오차 측정)

  • Lim, Sung-Yong;Han, Cho-Lok;Kim, Do-Hyung;Yang, Hyun-Seok;Park, No-Cheol;Park, Young-Pil
    • Transactions of the Society of Information Storage Systems
    • /
    • v.8 no.2
    • /
    • pp.67-71
    • /
    • 2012
  • Page-oriented holographic data storage (HDS) is very sensitive to the tilt error. Therefore, tilt error should be measured and compensated. Especially, mechanical tilt measurement method cannot cope with tilt error measurement because photopolymer medium has shrinkage problem. Therefore, the method to solve this problem is using the reconstructed image which can represent both tilt and shrinkage effect. In this paper, we suggest disc tilt measurement algorithm using image pattern of retrieval data.

Cooperative Data Stream Filtering for Sensor Tag (센서태그 통합 데이터 필터링에 관한 연구)

  • Ryu, Seung-Wan;Oh, Seul-Ki;Park, Sei-Kwon;Oh, Dong-Ok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.8A
    • /
    • pp.683-690
    • /
    • 2011
  • The conventional sensor tag data filtering algorithm uses time window based data filtering for each tag data. However, this approach shows many performance problems such as low error and event detection rate and larger storage size requirement. In this paper, we propose a collaborative sensor tag data filtering algorithm to improve sensor data processing performance. simulation study shows that the proposed sensor tag filtering algorithm outperforms the conventional filtering algorithm in terms of the processing time, the size of required data storage memory and accuracy of error and event detection rate.

DNA Based Cloud Storage Security Framework Using Fuzzy Decision Making Technique

  • Majumdar, Abhishek;Biswas, Arpita;Baishnab, Krishna Lal;Sood, Sandeep K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3794-3820
    • /
    • 2019
  • In recent years, a cloud environment with the ability to detect illegal behaviours along with a secured data storage capability is much needed. This study presents a cloud storage framework, wherein a 128-bit encryption key has been generated by combining deoxyribonucleic acid (DNA) cryptography and the Hill Cipher algorithm to make the framework unbreakable and ensure a better and secured distributed cloud storage environment. Moreover, the study proposes a DNA-based encryption technique, followed by a 256-bit secure socket layer (SSL) to secure data storage. The 256-bit SSL provides secured connections during data transmission. The data herein are classified based on different qualitative security parameters obtained using a specialized fuzzy-based classification technique. The model also has an additional advantage of being able to decide on selecting suitable storage servers from an existing pool of storage servers. A fuzzy-based technique for order of preference by similarity to ideal solution (TOPSIS) multi-criteria decision-making (MCDM) model has been employed for this, which can decide on the set of suitable storage servers on which the data must be stored and results in a reduction in execution time by keeping up the level of security to an improved grade.

A Study on the Improved EDR Storage Data to Identify the Cause of Unintended Acceleration of Eco-friendly Vehicles (친환경 자동차의 급발진 원인 규명을 위한 EDR 저장 데이터 개선방안 연구)

  • Lee, Sang Bae;Kim, Dong Han;Moon, Byoung Joon
    • Journal of Auto-vehicle Safety Association
    • /
    • v.14 no.3
    • /
    • pp.17-22
    • /
    • 2022
  • In this paper, we propose the improved EDR (Event Data Recorder) storage data, which can identify the cause of unintended acceleration of eco-friendly vehicles. The proposed EDR storage data includes the brake pressure sensor value and a brake pedal travel sensor value. To verify the proposed EDR storage data, we observe the control algorithm and internal structure of the vehicle dynamic control system and a regenerative braking system in an eco-friendly vehicle.

Improving Noise Tolerance in Hopfield Networks

  • Kim, Young-Tae;Park, Jeong-Hyun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.8 no.2
    • /
    • pp.111-118
    • /
    • 1997
  • Adding a noise tolerance factor to the Relaxation learning algorithm in Hop-field network improves noise tolerance without effecting storage capacity. The new algorithm is called the Pseudo-Relaxation algorithm, and the convergence of the algorithm has been proved. It is also shown that the noise tolerance factor does not effect learning speed.

  • PDF

Storage Strategy and Separated Storage Structure for Multi-dimensional Geographic Information System (다차원 지리정보시스템을 위한 저장기법 및 분리된 저장구조)

  • Park, Dong-Seon;Bae, Hae-Young
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.1
    • /
    • pp.1-11
    • /
    • 2000
  • Up to the present, many GIS logical data models have been proposed to incorporate time dimension into traditional 2-dimensional (2D space) GIS databases. However, these models are difficult to implementation of multi-dimensional GIS and have problems of significant data redundancy and search performance. This paper proposes a new storage strategy and a separate storage structure, that is composed of current database and past database, in order to reduce data redundancy and improve search performance of temporal query. Also we design moving algorithm for migration from current database to past database, and design efficient search algorithm for temporal query.

  • PDF

Image Deduplication Based on Hashing and Clustering in Cloud Storage

  • Chen, Lu;Xiang, Feng;Sun, Zhixin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1448-1463
    • /
    • 2021
  • With the continuous development of cloud storage, plenty of redundant data exists in cloud storage, especially multimedia data such as images and videos. Data deduplication is a data reduction technology that significantly reduces storage requirements and increases bandwidth efficiency. To ensure data security, users typically encrypt data before uploading it. However, there is a contradiction between data encryption and deduplication. Existing deduplication methods for regular files cannot be applied to image deduplication because images need to be detected based on visual content. In this paper, we propose a secure image deduplication scheme based on hashing and clustering, which combines a novel perceptual hash algorithm based on Local Binary Pattern. In this scheme, the hash value of the image is used as the fingerprint to perform deduplication, and the image is transmitted in an encrypted form. Images are clustered to reduce the time complexity of deduplication. The proposed scheme can ensure the security of images and improve deduplication accuracy. The comparison with other image deduplication schemes demonstrates that our scheme has somewhat better performance.

Dynamic Analysis of Tip-actuators for Controlling Tip-media Gap in Cantilever Type Optical Data Storage (캔틸레버형 광 정보저장에서의 빠른 팁/매체 간극제어를 위한 팁/구동기의 동역학적 분석)

  • 이성규;송기봉;김준호;김은경;박강호;남효진;이선영;김영식
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.05a
    • /
    • pp.1004-1008
    • /
    • 2003
  • Near-filed optical storage using cantilever aperture tip is a promising way fer next generation optical data storage. To enhance the speed of reading and writing data, gap between tip and media should be controlled fast and precisely within near field region. In this paper, several PZT actuators are analyzed far constructing dual servo control algorithm: coarse actuators(stact. PZT, bimorph PZI) for media surface inclination and One actuator(film PZT) for media surface roughness. Dynamic analysis of stack PZT, bimorph PZT, and film PZT are performed through the frequency response. Based on the frequency response and mathematical model, fast analog controller is designed.

  • PDF

Optimal Information Dispersal Scheme for Survivable Storage Systems (서바이벌 스토리지 시스템을 위한 최적 정보 분할 기법)

  • Song, Sung-Keun;Youn, Hee-Yong;Lee, Hyung-Soo;Lee, Kang-Shin
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.657-664
    • /
    • 2003
  • Supporting the availability, integrity, and confidentiality of the information is crucial. The survivability storage systems require to encode and distribute data over multiple storage nodes or data base to survive failures and malicious attacks Information dispersal scheme is one of the most efficient schemes allowing high availability and security with reasonable overhead. In this paper, we propose an algorithm determining the optimal (m, n)-lDS in terms of availability, given a set of IDS's. The proposed algorithm will be very useful for designing a highly available and secure storage system since many factors such as node number, storage space, operation speed, etc. interact with each other and thereby finding an optimal information dispersal scheme is very difficult.