This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching
June 1976 (vol. 2 no. 2)
pp. 106-113
S.P. Ghosh, IBM Research Laboratory
The problem of distributing a data base (with logical associations between segment types) on a computer network such that multiple segment types satisfying a query can be retrieved in paralel from different nodes has been introduced. Properties of such distributions without redundancy and with redundancy have been discussed. Lower bounds on the number of nodes needed for such distributions have been given. Algorithms for constructing such distributions have also been given. Distributions of data bases for queries whose target segments form a combinatorial set have been studied in detail. Closed form expressions for redundancy have been obtained for such query sets.
Index Terms:
redundancy, Algorithm of data bases, computer network, data bases, distributing data bases, multiple segment queries, parallel search
Citation:
S.P. Ghosh, "Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching," IEEE Transactions on Software Engineering, vol. 2, no. 2, pp. 106-113, June 1976, doi:10.1109/TSE.1976.233537
Usage of this product signifies your acceptance of the Terms of Use.