Reasoning about naming systems

This paper reasons about naming systems as specialized inference mechanisms, It describes a preference )-zierarch.v that can be used to specify the structure of a naming system’s inference mechanism and defines criteria by which different naming systems can be evaluated, For example, the preference hierarchy allows one to compare naming systems based on how dkcrzmznating 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.

[1]  Witold Lipski,et al.  On semantic issues connected with incomplete information databases , 1979, ACM Trans. Database Syst..

[2]  Ken Thompson,et al.  The UNIX time-sharing system , 1974, CACM.

[3]  C. E. Price Table Lookup Techniques , 1971, CSUR.

[4]  A. Retrospective,et al.  The UNIX Time-sharing System , 1977 .

[5]  Larry L. Peterson A yellow-pages service for a local-area network , 1987, Computer Communication Review.

[6]  Marvin H. Solomon,et al.  The CSNET Name Server , 1982, Comput. Networks.

[7]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[8]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[9]  Butler W. Lampson,et al.  Designing a global name service , 1986, PODC '86.

[10]  Eugene Wong,et al.  A statistical approach to incomplete information in database systems , 1982, TODS.

[11]  Richard W. Watson,et al.  Identifiers (Naming) in Distributed Systems , 1980, Advanced Course: Distributed Systems.

[12]  Paul V. Mockapetris,et al.  Domain names - implementation and specification , 1987, RFC.

[13]  John R. Pickens,et al.  The NIC Name Server - A Datagram Based Information Utility , 1979, Berkeley Workshop.

[14]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[15]  Yogen K. Dalal,et al.  The clearinghouse: a decentralized agent for locating named objects in a distributed environment , 1983, TOIS.

[16]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[17]  Larry L. Peterson,et al.  Univers: the construction of an internet-wide descriptive naming system , 1990 .

[18]  Bjørn N. Freeman-Benson,et al.  Constraint hierarchies , 1987, OOPSLA '87.

[19]  Bjørn N. Freeman-Benson,et al.  Constraint Hierarchies , 1992, LISP Symb. Comput..

[20]  T. P. Mann,et al.  Decentralized naming in distributed computer systems , 1987 .

[21]  Witold Lipski,et al.  On Databases with Incomplete Information , 1981, JACM.

[22]  Larry L. Peterson The profile naming service , 1988, TOCS.

[23]  Douglas B. Terry Caching Hints in Distributed Systems , 1987, IEEE Transactions on Software Engineering.

[24]  Larry L. Peterson,et al.  Univers: An attribute‐based name server , 1990, Softw. Pract. Exp..

[25]  Robert Joseph Fowler,et al.  Decentralized object finding using forwarding addresses (object, network, distribution) , 1985 .

[26]  Robert S. Fabry,et al.  Capability-based addressing , 1974, CACM.