This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
In a distributed file system built on network attached storage, client computers access data directly from shared storage, rather than submitting I/O requests through a server. W...
Randal C. Burns, Robert M. Rees, Darrell D. E. Lon...
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
Efficient access methods are reviewed and explored in relation to the global surface hourly data set and several of its derivative products. Typical access paradigms are compared ...
Abstract. This paper presents a probabilistic model for combining cluster ensembles utilizing information theoretic measures. Starting from a co-association matrix which summarizes...
Network attached disk storage is characterized by independent network attachment and embedded intelligence. For Internet applications, it provides the key functionality of geograp...
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
Wensi Xi, Edward A. Fox, Weiguo Fan, Benyu Zhang, ...
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
This paper describes the idea of embodied data objects. Using this concept, everyday objects can be used to represent bits and bytes of active information. These data objects can ...
Manas Tungare, Pardha S. Pyla, Pradyut Bafna, Vlad...