MXPA98003515A - System to store and recover digitaliza data - Google Patents

Abstract

A database is presented that stores various forms of communication in the form of digitized data (1) in a computer readable memory (10-16) for future access and retrieval. Using the proven reliability of a native file structure of a computer operating system (22), the database reduces overall complexity (24), increases stability (26), decreases access time to data (28) , and decreases the access time to several attributes in terms of data (30). These objectives are achieved by creating a flat database that employs the native structure (46) of the operating system file, thus preventing a more easily corrupted indexed database design created by a database engine. A unique algorithm is used to find a way to the data file that can be accessed using algorithms and conventional search techniques (20). In addition, information about the data file attributes can be accessed from the names of the digitized data files themselves (10-1

Description

SYSTEM FOR STORING AND RECOVERING DATA1 »DI Gil AT THE LEFT BACK! It is DF THE INVENTION 1. Field of the ínvanción This iiivofif ion ~ .e efie and a data üa'.e pir-i sislfßias "3 e to the storage and retrieval of * information I am parti? -u] armt'nt", ns intimated mens de vor in a re-tado'-, e plea the native structure of 31 ' fh? vo-? of a computer operating system to create a data base? »enta l which avoids program chapters that are ] < "'typical of the - systems of damage datas where are stored mens? de ac ac ac ac ac ac ac ac &&&&&&&&&&&&&............ El El. .. 1 < Í recovery and email, fax, video • orreo and girdles rel amateurs 2. T ?. above n.ca 1 is ema -5 message: s have Vuel or common in society r. As seen today, today's low-tech place has come to consider computers and technologies re fl ected as needs rather than luxuries, but we have become saturated with a volume each time we see more. information easily available through the side as a result of the capacity of i pterc one :; Ion of the computer systems and re.jes. Through a court 11 increasing life and a > "c" = "». In rement to the information arises the ineffective requirement to manage the information.

Typically, the information must be saved in order to have access to it later. In addition, access must be fast and reliable or technology becomes a burden in ve1; from uni help3. The information is typically organized in databases. 5 A database provides that Easy, right to large amounts of typically difficult to organize information and which e.i t i p ically di icIL to have cedo otherwise. The conventional approach to programming a database on a computer is the > ~ rea > ~ Ng a l stru ure own file or engine bn-.n database consisting of records and ..ampos within records, l s > amps of kingístro > Not only do the data that are being stored, but also information about the data, such as length of the data record, acquisition date, etc :. the b of d os = > It is also equipped with various utilities to clarify and extract the desired information from the registers. These utilities are also programs or parts of proprietary programs suitable only for your use. ?? own window of database files. Are there many justifications for the legal opinion as regards? 13 construction of own databases. I fie. They show the opti mi, ar i on of search routines, the adaptation of the structure. registration and field and, evidently, s aspects of comp ability and industrial mobility or lack of it. While dealing with important commercial considerations, they do not take into consideration the one that is frequently more important to customers. The confidence in the stability of the database could be the point m¿ > It is important for a client whose computer database has just been damaged and mat.cer.ible. The client no longer has access to essential commercial or medical records, either permanently or temporarily. No embaryo, is the na ture of cholera of1 data base engine employing a pro io database comprising program b. '' And data. A database engine is simply an additional programming layer on an operating system, This layer of additional programming has the effect of increasing the complexity of the database's oced to save and retrieve data later, as well. decrease the access speed to lo =; data l ma > «Do ah í. Another conventional approach in the technical field is that the structure of information is generally less stable. This ability is the result of a loss of pointer potential in the program, corruption of a part of an index that results in the loss of large segments of information, which in themselves are not affected, so as the additional programs of the program.

The prior art databases also present a slow access to the data because they typically require that a file not only be found but also open, or have access to and from it; Next, bitch in order to review several attributes of the file, such as date of creation, size, type of data, and 1 ma nings, etc. Accordingly, it would be a sale to create a less complex database than those found in the prior art by eliminating the additional layer of programming between the stored information and the native file structure of the computer. An additional advantage e =. increase the speed of the process of access to the data stored on the base df > data. S »: - > laugh also u.n ~. advantage to provide a more stable database and with a lesser tendency to 1.i corruption. It would also be an improvement if one could have information about the information "other than the data stored in a file if the proj ects require a long time to open, access and then close the file. ODTETQS AND I COMPENDIUM? INVENTION It is an object of the present invention to provide a structure for a base of inherently more stable and less tendency to corruption than those found in the prior art.

It is another object of this invention to provide a basis of > inherently less complex data through the elimination of a programmed archival structure. It is another object of the present invention to provide a data base that provides a faster access to data compared to databases found in the prior art. An object of the invention is to offer a base of which it does not need to be open, and I will have access to it and then I will use it to bring some useful information in C 1.1 to rite some of the parameters related to the data stored there. These and other objects: are achieved on a base that stores \ ^? «L < to forms of ctniiurpca ». ion in the form of datas di i la 11: adas in a computer readable memory for future access and retrieval. Using the con fi guration and provenance of a native archival structure of a computing operation, the base of data is: -. reduces 1A global complexity,? n? rementa 3? stabili ad, decreases the access time to the aos, and decreases the ti m of acc at various attributes in mantle to the data. These objectives loyr-? N mt * d? Integration of a flat database using the file structure of the native operating system, thus avoiding a database design? nde? < ado fáás corruptible r.r ^ A a par n database engine. Be employed? If? simple algorithm to find a way to data files which can then be accessed using conventional algorithms and search techniques. In addition, you can have access to information about r- "> attribute of data files from the data within remote digital data files, and more importantly, from» The names of the data of the same data themselves, and other objects, features, advantages, and aspects of the present invention will be apparent to the users in the subject matter. from the following detailed description in conjunction with the accompanying drawings DESCRIPTION OF THE DI BUTS I 3 is an illustration of a part of the 5 sub-sections of the present invention using the native structure of files of an operating system Figure 2 is an algorithm ip lement aclo in code C ue that returns 3a via through subd i rec ti i os has the files >! * •> da o. = > digital i ? .id s .. 0 Figure 7 illustrates in the form of a block diagram how the system is ip 3 emented in u? i3 network of computers to store vario--, types of digi ta 1 i -radas. DETAILED DESCRIPTION OF THE INVENTION Reference will be made to the figures in which the various elements of the present invention will receive designated numerical ions and wherein the invention will be commented upon to allow a subject in the art to make and use the invention. death. In the meantime, the title of the present invention specifies that it has a particular application in relation to a processing system of 13 amadas / va ,:, it being understood from the beginning that any form of >;: i tos > i? y? such i. can be saved and then retrieved from this data b. The number e »individual data files n > > it must be excessively large if the benefits of the database are not lost. More specifically, the preferred embodiment of the present invention is applied to the processing of vci messages: which are stored in a computer network. Typically, the number of new voice messages: for a single user and the number of enaa e qi.it »have been listened to but not erased does not come close to > _?in. Evaluates ions of voice message systems: they have in fact shown that the total number of new messages saved rarely exceeds twenty 3. However, as stated above, the vor messages are not the only form of data such as the one to which the present invention is applied. Due to the fact that e-1 implements in an r > - Of course, a really useful Ipse of data from this natural? _r also has an application for the processing of electronic mail fe-mail.), Video mail, f ix, and mail distribution lists which are they are becoming increasingly popular methods of communication in our office in the Latin American offices. For the purpose of the present invention, a network of computers and a computer-readable memory associated with it is required. The computer network server has an i -.te to operative that controls functions of 13 .ue computer? Allow 3 users; interact with him through commands to the computer to do things such as run programs, read keystrokes, on a keyboard, etc. A native file structure is also an integral part ... I read the operating system. Onoce as "native" because the operating system has its own method for cre > A recognizable space for storage in a medium, known as computer-readable memory, is satiated. In the case of the present invention, the computer-readable memory is any convenient form of mass ation to, for example, a d? > It is hard, but it can easily be used to include an optical drive, a CD-ROM drive, a mobile backup medium such as a 7IP unit, and even a tape drive. However, if speed is an important consideration, a tape drive is practical. Smaller storage medium for example disk drives, flexible, RAM and snapshot are generally too small and therefore practical for implementing the invention of the present invention. In a non-xl computer, the capacity of the memory can also be written by a compiler.A native file structure of an operating system can store data in a computer readable memory, suitably shaped, and It is possible to have access to the data Several operating systems comply with this access to data through several methods, such as, for example, with reference to a tab that includes an index of the data. how the file structure works, what is essential is that an operating system can quickly find the files stored by its particular native file structure, and The file structure has stability. The stability of a native file structure is uni caput discounted by the present invention, since the file structure is one of the most basic characteristics e? an operating system .. A successful operation is a stable "platform" within which programs are executed. All operating systems mentioned in this specification are all considered to be sufficiently stable for the purposes of the invention. These operating systems are: - without limitation Net? Are, DOS, Windows NT, Windows 95, Macintosh OS, 0 / S 2, UNIX and VMS. The data base-- of the present invention is implemented by the use of the 1. structure of files of any operating alat which structure support;, of subdirectory files. In esc »nc a, vir tua Imei i te cua 3 q? 11 is the theme of the aperitif fuft i unar-a "However, in a preferred modality that is read for the illustration of the bases of the base d'> dat ci 33 present invention, the operating system is Netware that has been created by Novell for its programmatic of i ntert annexation of computers. Gene almen e. The operating system Ni.tware receives on a server or on a host computer that serves as a centralized repository of programs and expensive network computing capabilities even when remote computers are connected to the host. Once: connected, remote computers take advantage of several network features, such as layer id. to communicate with another- ,. > or remote pudar, The first element is nci l of the present invention is the reaction of uni base tie ditoi flat. A database is a static structure that is not adjusted to compensate with i ione *. of imbalance. It is more likely that the data base, pl na co, or a tree file structure B, which is typically wide and po / ry, but without the capacity of the F tree to compensate subdi rectors that are not. full "in relation to other subdivisions. This means that the data bases do not adjust nor do they change their toptcfiidi from one ßub i re to another when c. d sequi Iðbrada: .. Má-. specifically, the data base in a preferred embodiment is constructed as shown in Figure 1. A base directory of databases is created and called DATA. The next level ci subd i re tones are called first J D subdiv i rec tur i os. Within each first subdire. A plurality of second subdivisions is found. Since it is constructed as a b da da da piaña that looks like a structure of 5 archives of arhol B, does it exist? an equal number of seconds d i retired tones within each exquisite subd i rec ton o. The preferred embodiment of the present invention, in accordance > In Figure 3, moreover, there is a total of in-depth subdivisions 1 " > first level < from 000 to 9800, in > .. rementSnds in units of 20O) 0 This number is not arbitrary insofar as it is i portat- »to-13 access speed of the base d» data if there is no ma =. Which is approximately 1 8 = - &ubt i rec tor This is due to the fact that the experiment has shown the fact of exceeding 1 8 5 subdivisions or files by subdirectory or results in a reduction: > "What if the speed of access to the files within the subti i rec tone. The number of the first sub-reciter 10 10 was reached because it was a number less than 128 for the reasons indicated above, and more speci fi cally because the total number of seconds subdivided 12 within the first cycle. subd i rec ton r > 10 should stay below 128 too. As illustrated in Figure 3, the preferred embodiment has a total of 1 OO second subdials 12 within each first upload 10. However, it is not easy to see why the second subdirectorates 12 of the odd number have been salt ados. For example, the first of the second subdivisions 14 receives the number fOOOO, and the second elelili seconds subdivisions 16 receives the number ffoOOC EJ second subdivision IO ßOOOO 14 ¡r & as a "mailbox" or an absolute index number for the owner of messages (eg, boxes 0 and L.). This is due to the fact that due to experimentation it was proved that in a processing system Of the typical speaker, it is extremely rare that users simultaneously have more than 6 old and new messages each, so the total number of messages to the second assistant or at any given time should not Ideally, we should never exceed 328. The final result of this data structure is that 50 primary subdivisions 10 each with 0 second subdivisions that store each one for two users. -means that a total of 10,000 individual storage sites, logical or physical, have been created for the database in the preferred modality.There is obviously a large number of variables that can be modified, to walk the layer of acenamiento of the present For example, does not a third sub-coller (not shown) within each of the second sub-blocks 32 increase the layering capacity at 1, 0, 00? of storage sites. It will be apparent that the present invention can e-mail numbers; of large storage sites while maintaining a very shallow data base structure. In the previous example, a data search engine only used to go down through three levels of subdivings to find the data, despite the fact that there are more than 1,000,000 sites in the world. or > J isponi bles. Having created a file structure for the database using the native file structure of the operating system, the next step is to identify storage locations where data storage is required. However, the indication of the previous paragraph is that the fact of finding a storage location ... well between 1,000,000 and 10,000 storage if in the preferred modality can make access to direct debits. on the basis of whether or not it is significantly slow. An important point of novelty of the present invention is a quick and easy way to determine where ~, they must give rise to di i ta l i zadus and from where they can recover. Figure 2 is a view of source codes of the algorithm used in the preferred embodiment for calculating a path through dt »subdirector ios 10 and 12 to desired digits 1 ized. The algorithm was written in the code of programming language C, and then passed to a number 22 of absolute owner and a variable 7-1, returns to a digital data pair path. in ASCII format up to a character buffer. The path stored in the character buffer 26 is then extracted and a command is provided for either saving the accessed data or accessing it. More generically, the algorithm is a process to identify a path to a data file stored in a computer readable memory and then access this file. Having access includes activities such as the file's length, the modification of the registration fields within the file, the addition of information to the records within the file, the removal of the file, etc.

It is probably useful at this time to use an example of how the algorithm interacts with the database that has been documented in the native file structure of the operating theme. Let us assume that a user of the 11-speaker system of the present invention requires activating a "message" file; "4543. MSN" from bu "; or" 3". While these idenfication markers are critically critical, the user is more likely to be reading a bookmark that says "vo .. message No. 32" of the "John Q. Public" mailbox respectively. The user is typically a person who has a networked computer connected to a central computer or host. In the preferred embodiment, the user activates a program that presents a new message and a message. previously visual, if they were not removed after reading. The user selects a message to listen to either a n > i uo or bi n a new one. The program associated with the single user n "bu-rón" previously determined where all the mens3 is stored is for this user, and a previously predetermined single message number associated with the selected message. The mailbox and message number are updated dynamically in the file associated with the program. Once the program for reading is identified, the program has access to the database and passes three parameters to the database. In the preferred fashion, two parameters contain useful information and "3 third parameter is a simulation variable or to preserve the place that reserves the space for data to be returned from the base of data. Specifically, the terms are passed to the procedure algorithm QF.l_BOX_rilE_PATH.NAMr. There are the terms "box_? D" 22, "buf" 26 and "ext" 24. The term "bo-, i_? D" 22 is the absolute number of ferret associated with the user. The term "" buf "6 is the simulation variable u ^ will contain a path to the data ci igi ta 1 iz two returned by the algorithm The term 7¡! 4 is the real name of the file that also identifies In this example, the variable bo;; _? d 22 passed to the procedure is 3, and the extension 24 is 4 43. MSN The first step of the algorithm is to divide the stored value into the variable bo;; _? d 22 by an index place keeper 28. Using the subdirector structure of the preferred mode, the place preserver of index 28 is equal to 20"The result is pos ib 3 or a number area 3 with a component of »integer and a decimal component When a particular C code syntax such as st.1 rita is used, the decimal component is removed from the result. multiply then by the conservator- of index place 28 (20) , The result is a value stored in the variable top__level 30 that represents the path through the first subd i ec ton. In this example, by dividing the number 3 by 2 f) e you get a result of 0.0150. Multiplying the whole number portion (zero) by 2 0 gives us a zero zero result. Therefore, the variable1 top_i vc- »l Z < "> is equal to zero, or bi n 000. The next step in the algorithm is equal -ir a variable called sub_level 32 to the value of ba? __? d 22, and then execute a modulation operation. on the sub_level 32. In this case, by executing an operation of Modn] _? - 2 on c- »l sub_level 32, the effect is to return a value df VE.PDADEH0 for the declaration" if "if the variable stored in sufo__level 32 is odd, and a value of FALSE if the variable stored in sub__3evel 32 is pa r.The algorithm subtract * after-, "I" from the value of the number stored in sub_level 32 of variable if the value In the sub_level 32 it is odd, or else it will go to the next step.In this case, the sub__levsl 32 is 3 3o that-1 is an odd number The fact of subtracting one of3 sub__level of variable 32 results in a sub_Jevel that it has the value e> 2, or bi n 0 02. Finally, one way is returned to the digital data stored in the computer readable memory by m and io of the procedure 20. In this example, the address is called DATA 34. The complete path to the message of di elated data 4543 is then returned to the "internal memory" variable 26 i omo, DATAfí0000ff00002 « 0034543.MSN. "As illustrated, the algorithm adds the mailbox bon_? D 22 to the digitized data message 3 to create an eight-bit file name (00034543) with a three-bit integer.; MSIM) It will be noted that the n =, or of a decimal system of base 10 limits the scheme and number of the ion and the total number of the subdi e orios.However, the limitation is generally super: gives changing of the decimal system To a higher base ion numbering system, for example, the database could employ the system of 5 numbering either ac 1 or base 16 f normally used. of even greater numbers - just as plausible as, for example, a system lauded in. - »l full set of c a? a > - ASCI f. Going on at a »from 1 to Í. variables and values in the previous example, the place-keeper of »index 28 receives a v-illor of 200 due to the directory structure of the selected file. This means that even if I exi in only 100"seconds subcli rec tor" in each of the ppmei os directories, the second subdi recos YES? create in inc ements of two. This is due, 1 fact that each of the seconds. Subd i rec tones is a place of reference for the di gi tal data of users. In fact, the conserved place of index 28 represents the number of users at the level of subd i rec or 10 lowest of the database and can be varied for ec are *? to a database and data. Another novelty of the present invention is the ability of the database to have access to information regarding the data stored in a storage location in the computer-readable memory. In fact, open the digital data registry. This ability increases the speed of the database sublimely because it avoids the steps that require a lot of time to open a file, access the data and then close the file when the file is opened. Desired information is typically found in a field within the data record? d i i a 1 i zado. On the contrary, the present invention emulates the integrated function of the native structure of the operating system to register some attributes regarding the file, outside the file. In other words, the date of creation of the file, the time of the file reaction and the size of the file are standard file parameters to the files you can have so open the file. The present invention takes this idea another step further by creating a convention of file name dt »message so that this useful information is contained in the file name itself. This process again avoids the need to open the file to recover the information. For example, the buon number is known as the absolute index number of the message owner, thus identifying the bank that monsa e has. In the previous example, the mailbox received the number "3", and through the use of the algorithm, a message was stored for this mailbox in a subdivided follow-up / 0002. The mens' -d in the previous example was previously identified as a message 4543. MSN. The numerical portion of the message identification number is an index number of the data file that defines a unique number for the file. within a second subd i rec tor i o. The data file index number is generated randomly at the time the message is stored in the second sub-directory i or. A quick comparison was made in order to determine if the file index number of ci or- is really unique. If this is the case, the message is guided. Otherwise, file index numbers of randomly generated files are created until a unique number is found. The faces are alphabetical ?. (MSN) that follow the numerical delivery of the message identification number identify a type of message. The tip message can be any face combination or possibly numbers that uniquely identify the source of the message. For example, the message can be a message cié vo :. as in the preferred embodiment, but it can also be a FAX, electronic mail, video mail, E? X distribution list, electronic mail distribution list, v? >distribution.eo mail etc. The message type characters can be any ASCII character allowed for use in tensions of the file name by the native file structure of the operating system. The preferred modality in the Net convention? »? A e < and DOS) of eight ca rac i < sr z, for a file name1 and three characters for uri3 tension, known as 8.3. The preferred mode reserves the first two characters of the extension for the message type indicator. Currently, the preferred modality focuses only on correspondence, and therefore does the message type indicator identify only? if the message is of the "normal" type or in other words, an ore. e not received as part of a distribution list, or if the message is of the "distributed" type and received from a distribution list from which the person receiving the message is a member. Specifically, a "normal" message is invoked by means of the "MS" characters, and a "di-assigned" message is known by means of the "MD" characters.

AneiO to these characters that define the message is a unique character that indicates the status of the message, and is known as a status indicator. The status indicator includes file attributes that indicate whether the message is new, saved or bi-reproduced, temporary, etc. The message is new if it has never been reproduced by the user who has left the message, and e = > represented by the "N" character. A message is saved or reproduced if it has been reproduced and not deleted from the user's message space in the computer memory, and is represented by the character "P". A message is temporary, for example, when the message is in the process of being saved in the computer readable memo, and represented by the "$ -" character. When the database r ^ ali.a the function of examining all the files of a suhdi rec tor the user, a message with the > z '^ (ter "$" co or the same character in an extension was ignored as if it did not exist yet.) When the message has been fully saved (the person ends the registration of a message), the file is copied into a new file. hey <the character "$" is replaced by an "N", and the temporary file is deleted.A new directory of the user's sub-directory will now show that a new message is there, just before it is reproduced. 3 illustrates the present invention implemented in a Local Area Network 40 (LAN) such as Novell, the network consists of the main served U or host computer 42, access to telephone communications 44, and a plurality of remote computers 4. This configuration indicates that the system can be adapted to other forms of communication storage and new calls, especially those associated with computer technologies, while the preferred modality is presented as a base application. of data in computer-readable memory of 1"fia & of computer, = and notes that the present invention works equally well on an isolated computer. All system characteristics applied to a computer connected to a network will be applied to any type of message that? I can receive a computer. For example, a standalone computer that marks the Internet modem can ^ - ^ cp qa messages and then disconnect from the internet connection. In the same way, the computer could rec: ib-phone messages of vain people if it is connected to telephone lines. It must be understood that- »the modalities described above are only illustrative of the application of the principles of I? present invention, those skilled in the art can invent numerous alternatives and alternative arrangements without departing from the spirit or scope of the present invention. Rei indicates attached ions cover such od i f i ca > ::. ICANNs and regimes "

Claims (17)

1. l PEÍVINDICACIONES 1. A message processing system for storing and retrieving a plurality of messages ", which are represented by segments of elliptical data, and received by a pillaridad ci usu rios, said system provides a basic structure and stable data that renders (a) a database that uses a native file structure of a computer operating system to create a plurality of storage locations in a mobile memo on a computer to store the plurality of messages, each of the plurality of storage locations has a corresponding single address defined as a di ectory having a number, uniquely defining a path to a directory created by the native structure of the file, where each of the two Unique ions corresponds to a location of the amalgamation for messages received for each one of the plurality of u ua; (b) U i \ device to determine a first location of lmac: c »nam? c» nto where a first segment of iglisted data must be stored when the first data segment is received; (c) a device for storing the first segment of data di i tal in the first location of a 1 mac namiento; id) a device to determine the first storage location where the first digitized data segment is stored when it is to be retrieved; and (e) a device for recovering the first digital data segment from the first location.
2. 2. The information processing system of the rei indication 1 where the plurality of digitized digital data segments that are stored and retrieved are selected within the group consisting of voice mail, email, fas, video mail, and data. related
3. 3. The information processing system according to that defined in claim 1: wherein the system further comprises a device for reproducing the plurality of digitalized data segments.
4. The information processing system according to that defined in FIG. 13 rei indication 1 where the device to determine the corresponding unique di dondection where it is stored and should be stored cid? one of the various segments of di al alized data comprises a mi p processor that executes a sequence of steps retrieved from computer readable memory on the computer.
5. 5. The information processing system of claim 1 wherein the native structure of? computer operating system files that create the address .-! -, The corresponding single defined pathway to a directory includes a device for creating nested subdirectories that correspond to a plurality of unique paths from a root directory to a plurality of subdivisions in memory readable on the computer where the various segments of stored data are stored.
6. 6. The information processing system of claim 5 wherein the native file structure of the operating system includes file names and extensions structured in accordance with 8.3.
7. 7. The information processing system of the rei indi 5 where the h3 of. atos comprises a base of d or pl has a static structure.
8. 8. The information processing system of claim 5 wherein the operating system is selected within d > sl group consisting of DOS, Netware, Wi n bis NT, Windows 75, Macintosh OS, 0/5 2, Uni! - and VMS.
9. 9. The information processing system according to claim 5 wherein a file name pa to a data segment diita 1?:: Ados to be stored and retrieved subsequently co prencle: a number ci absolute index of owner of message identifying the owner of the corresponding segment of di ff erent data; IB a file number of files that has a unique number for the corresponding segment of digital data with a sub-directory; an indicator of the type of message that defines the type of message contained in the correct segment of all the data in such a way that it can be reproduced using an appropriate method! a status indicator that de fi nes a state of mens e piara the corresponding section of di gi tal data. .
10. The information processing system of file 9 where the additional information of the file associated with the file name matches the corresponding segment of data that has been accessed at <l. : > i n ab p r1 or omp also a file creation date; one hour of file processing; and? n size of-1 file. 31.
11. The information processing system of claim 1 wherein the database comprises a native file structure including a database root directory, a plurality of first subd i rec: tones den tr of the directory r í, and a plurality of seconds subdivided into one of the first two openings.
12. 12. The information processing system of the rei indication 11 where e:? Ste- > n less than 128 first subdivisions within the root directory of the database.
13. 13. The information processing system of claim 1: where 12 there are less than 128 seconds sub-rector or within each of the suphdi recipients.
14. 14. The information processing system of claim 13 wherein all the digi ized data and related files are stored in the plurality of second sub-retries in the readable memory in co-add.
15. 15. E.3 cié system information processing of claim 14 where the devices to determine a unique address in which each of the various segments dt? The data stored or stored must include a positive di- rection to receive information that includes an absolute owner index number, and which then determines a corresponding first subdi and a second corresponding subdirector within it. of the first sub-i ectap or corresponding. Ib.
16. The information processing system of regulation 1 wherein the system that implements the present invention is selected from: > > of the group consisting of computers and dependents and computer networks »
17. 17. A method to store and extend several di erent segments, this method provides a stable database structure that has a higher tendency to corruption while increasing the access speed of a readable memory in compiler, and comprising the steps of: (a) forming the database by creating a plurality of storage locations in computer-readable memory by using a native file structure of an operating system to create a unique address defined as a path to a directory cited by the native file structure; ib) determines a corresponding storage location where it is necessary to store a first digitized digit segment when the first digitized data segment is received. (c) store the first segment of di i tal data in the corresponding storage location; id) determine the corresponding location of storage where the first segment of dicj i talized data is stored within the computer-readable memory when it must be retrieved; and íe) recover the first segment of di cj i tated data from the corresponding location of the pavement. IB. The method for storing and retrieving di erent data i in accordance with claim 1"where the passage from the native file structure of the computer system to the one that creates the unique address defined as a path to a directory includes the step of creating a plurality of subd i nes nested tones that correspond to a plurality of unique paths starting from ut \ directory ra i7 towards a plurality of subd 1 rectors ios e ^ n the computer readable memory where the plurality of digital data segments should be stored. 19. The method of storing and retrieving digital data in accordance with that defined in claim 18 where the step of creating a plurality of nested directories comprises the most specific step of creating less than 128 first subd 1 r-ec: ton inside a root directory. 2 . The method for storing and retrieving digital data 1 in accordance with claim 19 wherein the step of creating less than 17 × 8 pin subd1 recreorios mergers comprises the ad-lonal step of c &; i less than 128 seconds subdivided within each of the first sub-directors! you. 21. The method for storing and retrieving digital data in accordance with that defined in claim 20 wherein the step of creating a plurality of subdi nes nested tones corresponding to a plurality of unique paths from a directory ra 1 r to a plurality of selected data segments should be stored, comprises the most specific steps of s (a) receiving a message owner absolute index number; ib) divide the absolute owner index number by a first index place separator; (c) abandon any decimal part of a country's result; (d) multiply the result of step (c) by the first index place separator in order to obtain a numerical value that defines a first subdi rectopo; (e) defining a second sub-index as a numeric value to the absolute Proponent Index number; (f) determine whether the numerical value of the second subdi rerio is even or odd; íg) decrease the numerical value of the second subdi ector by 1 if the numerical value of the second subdi recto is a nu r imp r; and ih) c an archived name associated with the digital data. 22. The method for storing and retrieving di fl icted data in accordance with that defined in rei indication 17 where the step of a file name par-to the digitized data segment comprises the μ.iao more specific to assigning the message owner absolute index number, a randomly generated identification number that is unique to the plurality of data segments stored in the plurality ci second subd? recio ios, an indicator of type e »message and a message status indicator .. 2.« The method for storing and retrieving gives di gi gi tal z zades according to the definition in claim 22 where the step Creating a file name includes the more specific steps of assigning a file creation date, an archive time, and a file size. 24. The method for storing and retrieving digital data in accordance with the one defined in claim 1. in which the method of assigning a message type indicator to the file name of the digital data segment i z-tdos includes the most speci fi c step of indicating- what type of data is stored and stored, and it is classified as a group consisting of a < , email, video, voice mail, voice message distribution list, fai distribution list < , and an e-mail distribution list indicator. 25. The method of storing and recovering digitized data in accordance with that defined in claim 24 wherein the password of the message status indicator to the file name of the data is displayed. gi t 11 adas includes the most specific pass of in icar t? l state of the data di gi a 11 zados, and is selected within the group consisting of dt »a new message indicator, a temporary indicator-message and an indicator of message reproduced and now guided. 2 ¿> . The method for storing and retrieving digitized data in accordance with that defined in claim 21 wherein e3 meter it further comprises the assignment of the first index device equal to the number 2O0. 27. The method for storing and retrieving di f icted data in accordance with that defined in claim 23 wherein the step of determining whether the numerical value of the second subdirectory is even or odd comprises the more specific step of executing an operation of Modulate-2 in the numerical value that defines the second sub-field 10. 2B. The method of storing and retrieving di fl icted data in accordance with that defined in claim 17 wherein the step of determining the corresponding storage location where the digitized data segment is stored comprises the specific steps of. a) receive an absolute Owner's Index number; (b) divide the owner absolute index number by a μrpicr index locator; ic) abandon any decimal part of a result of piases ib); (ti) multiply the result of step (c) by the first index-placeholder for the purpose of obtaining a numerical value that defines a first-subdirector i or; (e->) define a second subd i rec tone as a numeric value that is equal to the owner absolute index number; (f) determine whether the numerical value of the second subdirectory is odd or even; (g) decrease the numerical value of the second subdi rec tone by 1 if the numerical value of the second subdi line is an imp number; (h) returning a guide to the storage location comprising a first subdi recte - a, a second subdirector i or within the first subdivision, the absolute owner index number, and an extension. 29. The method of storing and retrieving digitized data in accordance with that defined in paragraph 28, where the method comprises the reception, storage and re-application of selected items of data within the group consisting of video mail, email, fas, and relational data. 30. The method for storing and retrieving di ff erent data in accordance with the definition in the indication 29 where access to di f iced data includes the most specific piases of having access to digital data. All of these methods are selected in the same way as with audio reproduction, visual 1 i zac in comes teictp on a video screen, vi s? a 1 i zac 1 as video in a device of visualization, and visualization in a printed production device. 31. The method for storing and retrieving digital data in accordance with that defined in claim 30 wherein the method comprises the additional step of assigning a combination of a message type indicator and a message state in the form of an extension of a file name for the d ized passwords.