Complexity analysis of distributed database algorithm
Published in WIT transactions on information and communication technologies • Jun 10, 1997
Authors:,,
Alfred Wai-Sing Loo
Chris Bloor
David Grey
Abstract
This paper presents the complexity analysis and empirical results of a distributed selection algorithm. The algorithm uses the statistical properties of the data file. The objective of the algorithm is to minimize the number of communication messages required for the whole selection process. The alg...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!