A heuristic algorithm for determining a near-optimal set of nodes to access in a partially replicated distributed database system

A heuristic algorithm for determining a near-optimal set of nodes to access in a partially replicated distributed database system

An O(n/sup 2/) heuristic algorithm using randomized decisions is developed for determining a near-optimal set of nodes. For small values of n, the authors can determine how close the heuristic solution is to the optimal set of nodes. They also compare their heuristic to other algorithms reported in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mukkamala, R., Bruell, S.C., Shultz, R.K.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Cities and towns
Computer science
Concurrency control
Database systems
Delay
Distributed databases
Greedy algorithms
Heuristic algorithms
Linear programming
NP-hard problem
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An O(n/sup 2/) heuristic algorithm using randomized decisions is developed for determining a near-optimal set of nodes. For small values of n, the authors can determine how close the heuristic solution is to the optimal set of nodes. They also compare their heuristic to other algorithms reported in the literature.< >
DOI:10.1109/ICDE.1988.105476