Parallel Processing of Graph Reachability in Databases

O. Wolfson, W. Zhang (1992) Parallel Processing of Graph Reachability in Databases. [Journal (Paginated)]

Full text available as:

[img] Postscript


One of the features that distinguishes digital libraries from traditional databases is new cost models for client-access to intellectual property. Clients will pay for accessing data items in digital libraries, and we believe that optimizing these costs will be as important as optimizing performance in traditional databases. In this paper we discuss cost models and protocols for accessing digital libraries, with the objective of determining the minimum cost protocol for each model. We expect that in the future information appliances will come equipped with a cost optimizer, in the same way that today computers come with a built-in operating system. This paper makes the initial steps towards a theory and practice of intellectual property cost management.

Item Type:Journal (Paginated)
Subjects:Computer Science > Dynamical Systems
ID Code:482
Deposited By: Zhou, Jutai
Deposited On:26 Jun 1998
Last Modified:11 Mar 2011 08:53


Repository Staff Only: item control page