A dynamic mechanism for determining relationships in a partially ordered user hierarchy
by Chin-Chen Chang, Iuon-Chang Lin, Hui-Min Tsai
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 3, No. 5/6, 2005

Abstract: In this paper, we propose a mechanism in the partially ordered user hierarchy, instead of the tree hierarchy discussed till now, by assigning each user an interpolating polynomial constructed from the user's own id number and his fathers'. In this way, any two users' relationship can be quickly determined from evaluating their associated polynomials. Moreover, whenever a new user is added to or deleted from the user hierarchy, none or only some relevant polynomial needs to be updated, differing from the previously proposed schemes where the information needs to be reconstructed all over.

Online publication date: Fri, 31-Mar-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com