View in EDS PDF Full Text

Improving the Security of Split Data When Using Multidimensional Parity Algorithms.

Saved in:
Bibliographic Details
Title: Improving the Security of Split Data When Using Multidimensional Parity Algorithms.
Authors: Akhmetgalym, Tlek1 tlek.akhmetgalym@mail.ru, Mukasheva, Gulzira1 gulzira_7777@mail.ru, Zhumagazievna, Karipzhanova Ardak1 kamilakz2001@mail.ru, Mayzhanuly, Aukenov Bolat1 abm58@mail.ru, Toleubekovna, Urazbaeva Kumys1 urazbaeva57@mail.ru
Source: International Journal of Interactive Mobile Technologies. 2022, Vol. 16 Issue 21, p168-182. 15p.
Subjects: Data security, Iterative decoding, Data warehousing, Algorithms, Multidimensional databases, Error correction (Information theory)
Abstract: A model of distributed storage split data using algorithms, multidimensional parity, resistance to partial losses of the storage sites, is regarded as an alternative way of security that can replace the conventional multiple reservations and carrying costs of growth of the physical volume. In this model, the generated redundant data allows you to restore partial loss of the split parts. In this case, the recovery is performed at the expense of the parity files formed during the splitting procedure, in which the main action is the calculation of bitwise parity with summation modulo "two". With this additional operation between the source files, you can restore the corrupted file without distortion. A comparison with several models that use checksum codes for recovery shows that the estimated probability of losses due to storage failure in the case of multidimensional parity codes is significantly less than when using other split data storage options. Using the operation of adding the bits of undamaged files, you can completely restore corrupted files. According to the calculated data, even when theoretically non-recoverable losses are reached, it is always possible to find combinations of chain recovery. The complexity of alternative methods, including the iterative decoding method, makes a distributed split data storage system using multidimensional parity algorithms a more convenient error correction technology. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Interactive Mobile Technologies is the property of International Journal of Interactive Mobile Technologies and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 160220852
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Improving the Security of Split Data When Using Multidimensional Parity Algorithms.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Akhmetgalym%2C+Tlek%22">Akhmetgalym, Tlek</searchLink><relatesTo>1</relatesTo><i> tlek.akhmetgalym@mail.ru</i><br /><searchLink fieldCode="AR" term="%22Mukasheva%2C+Gulzira%22">Mukasheva, Gulzira</searchLink><relatesTo>1</relatesTo><i> gulzira_7777@mail.ru</i><br /><searchLink fieldCode="AR" term="%22Zhumagazievna%2C+Karipzhanova+Ardak%22">Zhumagazievna, Karipzhanova Ardak</searchLink><relatesTo>1</relatesTo><i> kamilakz2001@mail.ru</i><br /><searchLink fieldCode="AR" term="%22Mayzhanuly%2C+Aukenov+Bolat%22">Mayzhanuly, Aukenov Bolat</searchLink><relatesTo>1</relatesTo><i> abm58@mail.ru</i><br /><searchLink fieldCode="AR" term="%22Toleubekovna%2C+Urazbaeva+Kumys%22">Toleubekovna, Urazbaeva Kumys</searchLink><relatesTo>1</relatesTo><i> urazbaeva57@mail.ru</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Interactive+Mobile+Technologies%22">International Journal of Interactive Mobile Technologies</searchLink>. 2022, Vol. 16 Issue 21, p168-182. 15p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Data+security%22">Data security</searchLink><br /><searchLink fieldCode="DE" term="%22Iterative+decoding%22">Iterative decoding</searchLink><br /><searchLink fieldCode="DE" term="%22Data+warehousing%22">Data warehousing</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Multidimensional+databases%22">Multidimensional databases</searchLink><br /><searchLink fieldCode="DE" term="%22Error+correction+%28Information+theory%29%22">Error correction (Information theory)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A model of distributed storage split data using algorithms, multidimensional parity, resistance to partial losses of the storage sites, is regarded as an alternative way of security that can replace the conventional multiple reservations and carrying costs of growth of the physical volume. In this model, the generated redundant data allows you to restore partial loss of the split parts. In this case, the recovery is performed at the expense of the parity files formed during the splitting procedure, in which the main action is the calculation of bitwise parity with summation modulo "two". With this additional operation between the source files, you can restore the corrupted file without distortion. A comparison with several models that use checksum codes for recovery shows that the estimated probability of losses due to storage failure in the case of multidimensional parity codes is significantly less than when using other split data storage options. Using the operation of adding the bits of undamaged files, you can completely restore corrupted files. According to the calculated data, even when theoretically non-recoverable losses are reached, it is always possible to find combinations of chain recovery. The complexity of alternative methods, including the iterative decoding method, makes a distributed split data storage system using multidimensional parity algorithms a more convenient error correction technology. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Interactive Mobile Technologies is the property of International Journal of Interactive Mobile Technologies and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=160220852
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3991/ijim.v16i21.36075
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 168
    Subjects:
      – SubjectFull: Data security
        Type: general
      – SubjectFull: Iterative decoding
        Type: general
      – SubjectFull: Data warehousing
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Multidimensional databases
        Type: general
      – SubjectFull: Error correction (Information theory)
        Type: general
    Titles:
      – TitleFull: Improving the Security of Split Data When Using Multidimensional Parity Algorithms.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Akhmetgalym, Tlek
      – PersonEntity:
          Name:
            NameFull: Mukasheva, Gulzira
      – PersonEntity:
          Name:
            NameFull: Zhumagazievna, Karipzhanova Ardak
      – PersonEntity:
          Name:
            NameFull: Mayzhanuly, Aukenov Bolat
      – PersonEntity:
          Name:
            NameFull: Toleubekovna, Urazbaeva Kumys
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: 2022
              Type: published
              Y: 2022
          Identifiers:
            – Type: issn-print
              Value: 18657923
          Numbering:
            – Type: volume
              Value: 16
            – Type: issue
              Value: 21
          Titles:
            – TitleFull: International Journal of Interactive Mobile Technologies
              Type: main
ResultId 1