Jacek Konieczny: > IMHO a hash table should be used instead of the linear (even if sparse) > array for the xino data. Then the storage space could be used much more > efficiently.
Currently I am considering how can aufs reduce the size of XINO. Won't you tell me why hash table can use space much more efficiently? As you might know, current XINO file is a linear table for translation. When you give an inode number as input, aufs multiply it by the size of inum, seeks the file with the calculated value as the file offset, and reads a new inum. If you put the file on HDD (other than tmpfs), then you will not see the memory pressure. On the other hand, if aufs puts the translation table as a hash table in memory, then we need additional pointers other than the inum data, don't we? Or do you say that put the hash table in a file? Then is it easy to implement? J. R. Okajima ------------------------------------------------------------------------------ Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current with LearnDevNow - 3,200 step-by-step video tutorials by Microsoft MVPs and experts. SALE $99.99 this month only -- learn more at: http://p.sf.net/sfu/learnmore_122912
