Hi, I'm writing a toy-fs, and discover a major shortcoming (finding a given child (dir/file) as fast as possible), which other developers (ie. ext3/4) had encountered long ago too. They introduced HTree. The info on HTree on the web is scarce or I couldn't find the right texts/papers yet. I wonder how HTree works on a conceptual basis. Could a kind soul enligten me pls. TIA. -- cu Uenal -- To unsubscribe from this list: send the line "unsubscribe linux-ext4" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
