Xref: utzoo sci.math:11923 comp.cog-eng:1725
Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!rutgers!bellcore-2!bellcore!pyuxp!pyuxe!nvuxr!efam
From: efam@nvuxr (elliott familant)
Newsgroups: sci.math,comp.cog-eng
Subject: Formalizing location and distance in file retrieval systems
Message-ID: <1801@nvuxr.UUCP>
Date: 6 Aug 90 20:40:41 GMT
Sender: efam@nvuxr.UUCP
Reply-To: efam@nvuxr (elliott familant)
Followup-To: sci.math
Organization: Bell Communications Research, Red Bank, NJ
Lines: 29

I am trying to develop a descriptive framework to characterize different
kinds of file operating systems that might be found on a computer.  I am
specifically interested in formalizing what is meant by location and
distance in various file systems.  The two kinds of file systems around
today are hierchical retrieval systems (found in UNIX, DOS, VMS,etc.)
and those based on a desk top metaphor.  Distance, in the formal case,
corresponds, I assume, to some graph theorectical notion of distance
(since a hierarchy is simply a tree structure).  Distance in the latter
case, is more like what it's like in real life.  The two kinds of
distances differ, but how?  Is it correct to say that distance on a
graph is measured on an ordinal scale, whereas distance on a desktop is
measured on a ratio scale?

And what of location?  Location on a "desktop" interface is kind of
strange.  It does not correspond to a single abstract point in space,
but represents a set of points.  How can I talk about this kind of
location in some kind of formal language. 

Please forgive the simpleness of my questions.  My training is not in
mathematics so if my questions sound naive, they probably are.  But if
anyone can make suggestions as to ways to think about this, or can at
least direct me to some body of mathematics that would be relevant to
these kinds of issues, I would be greatful.  

Please send me Email if you have any thoughts about this.  

Thanks in advance.

Elliott Familant