The impressions from a conference are positive both from the heard information and from circumstance that - the real participants was not hurries with a lecture there was in once or twice a less amount of requests. To lay out the article of lecture will not be while, but will lay out theses.
So...
Tag-based filesystems. The features of organization of data on the example of «Fitafs»
Classic FS (file systems) with the hard hierarchical structure of catalogues successfully used already more than 30 years. However now that the volumes of storable users information are calculated in tens and by hundreds gigabyte, arrangement and retrieval of the required data appears either strongly laboured or not comfortable. The matter is an all that hard hierarchy and impossibility of dynamic reflection of all information, proper the set criterion in one place, by facilities FS. Certainly, an user has a good mechanism of hard Refs on files, however and it far not panacea. For example, we want to represent all present on a computer voice files in the folder of «Music» – it is for this purpose necessary it will be to find all necessary files, create on them hard Refs.s inwardly «Music» (thus it will be necessary to change the original names in order to avoid a reiteration), and periodically to scan the system in the presence of new voice files. If inwardly «Music» must be reproduced part of original hierarchy, as that: « performer \ album \ file_name.mp3», the that amount of operations yet more will be increased. For the removal of similar problems the great number of realization of FS and buildings (control system by information and metadatas, being not the file systems) on, representing information as pages of DB (databases) was developed, some of which use SQL as the mother tongue of queries. To them behave: «WINFS» (Microsoft), «Hyppocampus». However and they are not deprived failings main which it is been from: 1) absence of complete reverse compatibility with classic FS and using them programs; 2) most similar systems are buildings on above existing FS and use external universal SUBD, that notedly increases loading on CPU and expense of memory (both operative and permanent). As appeared, there is another not obscure mechanism of reflection and arrangement of information – tags. Yes, certainly, systems, based on databases tags use also, but only in a role of additional properties of file. In a difference from them tag-based filesystems («Fitafs», «Tagsistant») make from tags way to the file. If file 1.mp3 tags [music, the classics]has, and file 2.mp3 - [music, fate], passing on any of ways [«music\fate» or «fate\music»] we will find a file 1.mp3. In also time in a catalogue «music» it is possible to find out both files - 1.mp3 and 2.mp3. Directory tree, in most cases is a list of all tags-catalogues, into each of which again list from all tags-catalogues (except for already chosen) together with the list of files, having set tags. Complete reverse compatibility is the same provided with classic FS. However, at plenty of tegov, an interface becomes uncomfortable, and the enormous inlaid can result in serious problems in the programs, trying to go (proskanirovat') round all tree folders. Developed by me the tag-based filesystem of «Fitafs» uses a few other approach, leveling the problem of over-surplus inlaid of tegov-catalogues. In a lecture the methods of removal of the above enumerated problems will be lighted up with an interface, management the volumes of information and increase fast-actings, used for planning of «Fitafs». And also comparing of «Fitafs» to the existent systems.
Butenko M.S. 2008
