locked
Data Storage a possible alternative? RRS feed

  • Question

  • Sorry if this is the wrong section in the forum for this post, and i apologize in advance if this seems like the ramblings of a Lunatic.

    Data storage in the computer world has gotten out of hand recently. With more hard drives becoming superdrives, that can store hundreds of gigabytes of raw data, it's kind of underhanded that most of these drives are becoming more inefficient, speed vs. bulk.

    Using a basic template of the variables possible in a string of binary digits (0's and 1's) wouldn't it thus be possible to create a small database (no more than 2MB) with the possiblities of strings required for the first 1024 bytes of data. And using a simple mathematical process of overlapping and overlaying data procedures, creating modes of operation for data manipulation within equations.

    For Example:

    (0000)=2000(0)

    sure it looks stupid, but put that function in a Line in a text file, and have a program that understands that that means to create 8192 0's suddenly 1024 bytes, becomes 4 bytes in Ansii text 0000

    (0001)=1FFF(0) + 1(1)            '8191 zeros, 1 one.

    (0002)=1FFE(0) + 1(1) + 0001(0) '8190 zeros, 1 one, followed by another 0.

    (0003)=1FFD(0) + 1(1) + 0002(0) '8189 zeros, 1 one, 2 zeros.

    Then Repeat the section at the other end of the pond at FFFF with 1's

    (FFFF)=2000(1)   '8192 1's

    (FFFE)=1FFF(1) + 1(0) '8191 1's, followed by 1 zero

    (FFFD)=1FFE(1) + 1(0) + 0001(1) '8190 1's, followed by a zero, then another 1

    etc, for 8193 lines appeace, 0000-2000, and FFFF-DFFE.

    Leaving you with 49,000 more addresses within 0000-FFFF, to play around with special string instructions.

    After Incorporating this system the basic model for using it would be simple

    Mode 0 = zero overwrite mode, when comparing 2 strings, it takes a zero to overwrite a 1, this is used when the 2 strings being compared need 1's turned to 0's

    Mode 1 = 1 overwrites a 0, standard addition rule for strings, 0+0 = 0, 0+1 = 1, 1+0 = 1, 1+1 = 11 (if a 0 is present to the left Mode 1a can be initialized to overwrite it, or mode 1b can be initialized to overright a right 0)

    Mode 2 = Mode 2 utilized swaping principles, every digit in the string is reversed. 0 to 1 or 1 to 0.

    Mode 3 = Line recreation, if a string is present that matches the current one, a marker is placed refering it to the (i) of the previous location, i is the line constant in all text files. 

    Mode 4 = Subtraction mode, 1 - 1 = 0, 0 - 1 = 0, 1 - 0 = 1

    The goal of this system is of course to lay a few of these different strings on top of each other to equal the string we want to recreate, this will take special research to find the easist way to recreate a string, or if that particular string will need one of the 49,000 available addresses. ( which could be increased later, using up to an FFFFF system)

    The Statements for most occurances of data will be fairly simplistic, and anything harder than that can be formed using one of the special addresses within the database. In essence there are only 2^8192 possible occurances of the 8192 bits in 1kb of data, this database breaks down the possibilites, and recreates a string using significantly less space, 1024 lines per 1024 kb, this makes storage a snap, and any text file created can be compressed using a standard compression method.

    The only real research required for this system would be the development of a hardcoded database, and the mathmatical structures of putting a line together. In theory there would only be 3 or 4 mathmatical processes per line, making this a fast alternative to historical data storage. Not to mention the files could be encoded to easily and losslessly protect data.

    -William

    Light2Dark Technologies

     

    Monday, May 15, 2006 11:44 PM