Optimal partitioning of data bases across multiple servers in a local area network

Optimal partitioning of data bases across multiple servers in a local area network

0.00 Avg rating0 Votes
Article ID: iaor19921705
Country: United States
Volume: 22
Issue: 2
Start Page Number: 18
End Page Number: 27
Publication Date: Mar 1992
Journal: Interfaces
Authors: ,
Keywords: computers: data-structure, Computers: data structure, computational analysis: parallel computers
Abstract:

In 1987, Merrill Lynch was planning to establish about 450 local area networks (LANs) at its retail branch offices. Attached to the LANs would be personal computers for over 10,000 retail brokers, data-base servers providing customer and product data, and communication servers for interacting with remote systems and downloading data to the local data bases. The firm had not resolved how many data-base servers would be needed. The authors partitioned the data bases across multiple servers on a single LAN and developed an analytical methodology to determine the minimum number of data-base servers needed. They showed that, at most, two servers were needed for any branch office.

Reviews

Required fields are marked *. Your email address will not be published.