3 Sep
1999
3 Sep
'99
7:33 p.m.
On 09/03/99 10:55:20 you wrote:
Can anybody suggest a way to schlep a hierarchy around that is not O(n) in this annoying way?
A qtree identifier is essentially just a third ID, just like user and group ID, set on each file and inherited from the parent directory. So to change the ID requires essentially a recursive chown-type operation that is always going to be proportional to the amount of data "schlepped".
I suppose one could implement a scheme where the changes were not made right away, and instead upon access each parent was checked back to the root to see if the file has the "wrong" qtree ID for the qtree and if so, correct it and then let you access it, but that would be very slow.
Bruce