Performance analysis of a concurrent file reorganization algorithm for record clustering

Presents a simulation-based performance analysis of a concurrent file reorganization algorithm. We examine the effect on throughput of (a) buffer size, (b) degree of reorganization, (c) write probability of transactions, (d) multiprogramming level, and (e) degree of clustered transactions. The probl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering 1994-04, Vol.6 (2), p.248-257
Hauptverfasser:	Omiecinski, E., Liehuey Lee, Scheuermann, P.
Format:	Artikel
Sprache:	eng
Schlagworte:	Analytical models Applied sciences Clustering algorithms Computer science Computer science control theory systems Costs Database systems Exact sciences and technology Indexes Memory and file management (including protection and security) Memory organisation. Data processing Performance analysis Relational databases Software Throughput Writing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!