Abstract: A XML-aware file system exploits attributes encoded in a XML document. The file system presents a dynamic directory structure to the user, and breaks the conventional tight linkage between sets of files and the physical directory structure, thus allowing different users to see files organized in a different fashion. The dynamic structure is based upon content, which is extracted using an inverted index according to attributes and values defined by the XML structure. In one application, a dynamically changing federated repository is searchable using a system of local and merged master indices, wherein query results are presented as virtual directory paths that are semantically organized.

Abstract: A XML-aware file system exploits attributes encoded in a XML document. The file system presents a dynamic directory structure to the user, and breaks the conventional tight linkage between sets of files and the physical directory structure, thus allowing different users to see files organized in a different fashion. The dynamic structure is based upon content, which is extracted using an inverted index according to attributes and values defined by the XML structure. In one application, a dynamically changing federated repository is searchable using a system of local and merged master indices, wherein query results are presented as virtual directory paths that are semantically organized.

Abstract: Disclosed is a system and method for implementing a distributed network system, such as the World Wide Web, in which distributed location services are utilized and include a collection of server processes that map from resource identifiers to a resource's controlling server. In addition, distributed location services provide an architecture for assigning resource identifiers and set of protocols for accessing server processes. The server processes are logically defined to provide a more flexible system. Each of these logical server processes are an abstraction which provides the external view of the server. The logical server processes may be implemented by different numbers of physical processes running on different machines at different points in time.

Abstract: Disclosed is a system and method for implementing a distributed network system, such as the World Wide Web, in which distributed location services are utilized and include a collection of server processes that map from resource identifiers to a resource's controlling server. In addition, distributed location services provide an architecture for assigning resource identifiers and set of protocols for accessing server processes. The server processes are logically defined to provide a more flexible system. Each of these logical server processes are an abstraction which provides the external view of the server. The logical server processes may be implemented by different numbers of physical processes running on different machines at different points in time.

Abstract: Disclosed is a system and method for load balancing on a computer network that utilizes two levels of addressing abstraction—logical and physical. Logical processes are mapped to physical processes using a logical interface and may be done in a one-to-one, one-to-many, or many-to-one fashion. The mapping is dynamic in the sense that mapping decisions may include selection functions that can be changed on the fly so that servers can be added or removed in a manner that is relatively transparent to the client. The system and method are also applied to the World Wide Web so that web sites can also dynamically distribute processes over a plurality of servers.

Abstract: Methods and apparatus for resolving access patterns in a data processing system using the pigeon hole principle are disclosed herein. The data processing system has a directed graph G of access patterns including a vertices set V representing cache items. Each cache item v has an access pattern defined by a path of vertices (v.sub.1 .fwdarw. , . . . , .fwdarw.v.sub.n), v.sub.1 representing the start of the path and v.sub.n representing the end of the path at cache item v. The method includes defining a prefix cache for directed graph G which contains a map between an access pattern (v.sub.1 .fwdarw. , . . . , .fwdarw.v.sub.k) and vertex v.sub.k for a kth level L in graph G, storing the prefix cache in a memory and, for a given access pattern (v.sub.1 .fwdarw. , . . . , .fwdarw.v.sub.n), searching the prefix cache for a prefix (v.sub.1 .fwdarw. , . . . , .fwdarw.v.sub.k) of the given access pattern that reaches the kth level L. If the search is successful, the method includes outputting vertex v.sub.

Abstract: Disclosed is a system and method for implementing a distributed network system, such as the World Wide Web, in which distributed location services are utilized and include a collection of server processes that map from resource identifiers to a resource's controlling server. In addition, distributed location services provide an architecture for assigning resource identifiers and set of protocols for accessing server processes. The server processes are logically defined to provide a more flexible system. Each of these logical server processes are an abstraction which provides the external view of the server. The logical server processes may be implemented by different numbers of physical processes running on different machines at different points in time.