myajax95,

ich kann wirklich sehr schnell in Deutsch schreiben. Mein Deutschkenntnis is viel besser als Englisch.

I can really very quickly write in german. My german is much better than english.

kai!
nice to meet you too!

佩服LZ懂至少4种语言哈哈！羡慕ing.

ysol,
not 4, but just 3 arts Language.

So What is the content of a file? Is it representing one object or a collection of objects. If it is for one object, there might be too many files. If not, the collection of files just conduct the same function as table. you still needs to build relationships with all files.

[此贴子已经被作者于2006-7-25 2:45:45编辑过]

myajax95,

think about the date structure from Tree, a tree has a root, the root can be null, or can also be an object. root stands in level 0, then in level1 are the childreen of roots, any child can also has his child, they stand in his next level. Only the object that has no child more, is leaf. In a file system, the leaf is the object, that consists of a file, the others are the objects, that consist of more objects(his children), it could be so that, there were leafs in his children or nonleaf fileobject in his children.

summerization:
A file system consists of file object, a file object could be a leaf or nonleaf. A leaf in file system is a file object, that has a file. My Idea is, every file object will have a listener, that mean a listener will be added in a file object. Searching in a file system, will like something, water go through all pipes. In level one a listener will some response, that mean, he will ask himself, if he is leaf, when yes, then search the file, when no, then search his children, and the his children make the same thing. Pay attention here, when a file object is not a leaf, he will make all his children active, because every file object is a thread, active a file object then this file object will do search. So in a very quickly time, All file object in this file system will be actived and start their searching work, so that many searching works will be done in the same time, that is concurrent.

I will implement it recently in java.

Kai:

I think I'm kind of understand your idea. And the second paragraph looks familiar to me. I forgot where I read that.

Althrough every file has a listener, are you going to active all of them or only files on root level get actived, and the root file will active its children based on the search condition?

I'm not doubting about the feasibility of your approach. But I guess you need to prove that searching through a file system is really different than seaching through traditional Database table, and its performance it really better. That might be your challange.

[此贴子已经被作者于2006-7-25 11:17:29编辑过]

请myajax95将此移到
http://www.

Mandarin,English,even German!
Well,in the future,if have chances,could i have a talk to you in Shanghai dialect?

ku yi a. me wen ti.

哈哈..个的比参啊拉饿"关税"区了.....