Show simple item record

dc.contributor.advisorPeterson, Larryen_US
dc.contributor.authorBowman, Clair Michael, II.
dc.creatorBowman, Clair Michael, II.en_US
dc.date.accessioned2011-10-31T17:29:01Z
dc.date.available2011-10-31T17:29:01Z
dc.date.issued1990en_US
dc.identifier.urihttp://hdl.handle.net/10150/185148
dc.description.abstractThis thesis describes the construction of a descriptive naming system for an internet environment. Descriptive naming systems allow clients to identify a set objects by description. In a world where information is perfect, this amounts to a simple database query. However, descriptive naming systems operate in an imperfect world: clients may provide inaccurate descriptions, the database may contain out-of-date or incomplete information, the database may be highly distributed, and so on. Traditional strategies for handling imperfect information approach the problem from the database's perspective; i.e., queries are resolved according to a method determined by the database designer. This thesis presents a model, called a preference hierarchy, that allows the client to define the meaning of a preferred answer. A preferred answer is computed using knowledge about the quality of information in the database and in the query. Specifically, clients provide the naming system with a description of an object and some meta-information that describes the client's beliefs about the query and the naming system. This meta-information is an ordering on a set of perfect-world approximations and it describes the preferred methods for accommodating imperfect information. The description is then resolved in a way that respects the preferred approximations. The preference hierarchy may be used to solve problems associated with some forms of imperfect information that exist in descriptive naming systems. It also provides a foundation for designing and comparing various naming systems. For example, the preference hierarchy allows us to compare naming systems based on how discriminating they are, and to identify the class of names for which a given naming system is sound and complete. A study of several example naming systems demonstrates how the preference hierarchy can be used as a formal tool for designing naming systems. Univers is a generic attribute-based name server that implements the preference hierarchy model. It provides a foundation upon which a variety of high-level naming services can be built. It is a platform for constructing an internet-wide descriptive naming system. This thesis describes several aspects of its implementation and demonstrates how various descriptive naming services--including a global white-pages service, a local yellow-pages services, and a conventional name-to-address mapper--can be built on top of Univers.
dc.language.isoenen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectComputer scienceen_US
dc.titleUnivers: The construction of an internet-wide descriptive naming system.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.identifier.oclc708661650en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.contributor.committeememberDebray, Saumyaen_US
dc.contributor.committeememberManchanda, Sanjayen_US
dc.identifier.proquest9103012en_US
thesis.degree.disciplineComputer Sciencesen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.namePh.D.en_US
refterms.dateFOA2018-08-23T01:09:08Z
html.description.abstractThis thesis describes the construction of a descriptive naming system for an internet environment. Descriptive naming systems allow clients to identify a set objects by description. In a world where information is perfect, this amounts to a simple database query. However, descriptive naming systems operate in an imperfect world: clients may provide inaccurate descriptions, the database may contain out-of-date or incomplete information, the database may be highly distributed, and so on. Traditional strategies for handling imperfect information approach the problem from the database's perspective; i.e., queries are resolved according to a method determined by the database designer. This thesis presents a model, called a preference hierarchy, that allows the client to define the meaning of a preferred answer. A preferred answer is computed using knowledge about the quality of information in the database and in the query. Specifically, clients provide the naming system with a description of an object and some meta-information that describes the client's beliefs about the query and the naming system. This meta-information is an ordering on a set of perfect-world approximations and it describes the preferred methods for accommodating imperfect information. The description is then resolved in a way that respects the preferred approximations. The preference hierarchy may be used to solve problems associated with some forms of imperfect information that exist in descriptive naming systems. It also provides a foundation for designing and comparing various naming systems. For example, the preference hierarchy allows us to compare naming systems based on how discriminating they are, and to identify the class of names for which a given naming system is sound and complete. A study of several example naming systems demonstrates how the preference hierarchy can be used as a formal tool for designing naming systems. Univers is a generic attribute-based name server that implements the preference hierarchy model. It provides a foundation upon which a variety of high-level naming services can be built. It is a platform for constructing an internet-wide descriptive naming system. This thesis describes several aspects of its implementation and demonstrates how various descriptive naming services--including a global white-pages service, a local yellow-pages services, and a conventional name-to-address mapper--can be built on top of Univers.


Files in this item

Thumbnail
Name:
azu_td_9103012_sip1_m.pdf
Size:
4.299Mb
Format:
PDF
Description:
azu_td_9103012_sip1_m.pdf

This item appears in the following Collection(s)

Show simple item record