| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <mivr40$2lj$1@ger.gmane.org> Date: Wed, 13 May 2015 17:37:36 +0200 From: "U.Mutlu" <for-gmane@...luit.com> To: linux-ext4@...r.kernel.org Subject: Htree concept 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@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists