The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - June (1976 vol.2)
pp: 106-113
S.P. Ghosh , IBM Research Laboratory
ABSTRACT
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
812 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool