Before we moved to AFS, we used a hashing algorithm I wrote to help
even out the directory structure for our POP server. When we went to AFS,
we decided to propagate that hashing algorithm into the user tree for AFS.
It breaks the user tree into 26 subdirectories, a-z, and places users in
one of those directories based on the first 4 letters of the login name.
Basically we do:
(ord(login[0])+ord(login[1])+ord(login[2])+ord(login[3]) % 26)
We chose this over the method you describe because the distribution of
users between directories was much simpler. To get around the "ease of
navigation" issue, we put everyone in a global password file so that
~username would find each user's directory.
If you want to see the code we use, you can mail me or you can
download the Qualcomm POPPER distribution. I believe it's included there
as a compile time option.
-Brian
On Apr 16, 9:23am, "Daniel D. Arrasjid" wrote:
} Subject: Directory structures
}
} We're finalizing our user directory tree structure, and would like
} to know what other large sites are doing. We're thinking of
} making a directory off the top called user, and then two levels of
} subdirectories based on the first two letters of the person's
} username.
}
} For example, username 'daniel' would be in
}
} user/d/a/daniel
}
} Username 'mark29' would be in
}
} user/m/a/mark29
}
} With 60,000 users, we need a sensible way to distribute the users
} so that we don't end up with very large directories. Yet we need
} to balance that with ease of navigation for our users.
}
} Would anyone share how they manage the user space?
}
} Daniel
}
} --
} Daniel D. Arrasjid Computing and Information Technology
} Voice: (716) 645-6153 State University of New York at Buffalo
} Fax: (716) 645-5972 301 Computing Center, Buffalo, NY 14260
} E-Mail: [EMAIL PROTECTED] WWW: http://www.acsu.buffalo.edu/~daniel
} PGP public key: http://www.acsu.buffalo.edu/~daniel/key.html
>-- End of excerpt from "Daniel D. Arrasjid"
