Concurrent Data Base Reorganization - Assessment of a Powerful Technique through Modeling.
Lars Söderlund:
Concurrent Data Base Reorganization - Assessment of a Powerful Technique through Modeling.
VLDB 1981: 499-509@inproceedings{DBLP:conf/vldb/Soderlund81,
author = {Lars S{\"o}derlund},
title = {Concurrent Data Base Reorganization - Assessment of a Powerful
Technique through Modeling},
booktitle = {Very Large Data Bases, 7th International Conference, September
9-11, 1981, Cannes, France, Proceedings},
publisher = {IEEE Computer Society},
year = {1981},
pages = {499-509},
ee = {db/conf/vldb/Soderlund81.html},
crossref = {DBLP:conf/vldb/81},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
System performance requirements commonly force general
database management systems to conduct only
indispensable operations while processing a query and to
postpone data structure maintenance operations.
Therefore, the physical data structure tends to
deteriorate due to insert- and delete-activities. In
the long run this causes system performance to degrade.
As system performance has degraded below acceptable
limits the database must be reorganized. In conventional,
periodic reorganization the database, or part
of it, is taken off line while the data structure
is being reorganized.
Concurrent reorganization,i.e.a continous reorganization
of the physical data structure while application process
have full access to the database,is an attractive
alternative to conventional reorganization.
This paper presents results from a study where it is
shown that concurrent reorganization of network
databases is not only feasible but also benefical
for long run system performance.
Copyright © 1981 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings.
IEEE Computer Society 1981
Contents
References
- [CODA-78]
- ...
- [CULL-78]
- ...
- [DAS-75]
- K. Sundar Das, Toby J. Teorey, S. Bing Yao:
Reorganization Points for File Designs with Nonlinear Processing Costs.
VLDB 1975: 516-518
![bibliographical record in XML](../../xml.gif)
- [DEAR-74]
- P. A. Dearnley:
A Model of a Self-Organising Data Management System.
Comput. J. 17(1): 13-16(1974)
![bibliographical record in XML](../../xml.gif)
- [HULT-80]
- ...
- [HULT-79]
- ...
- [MARU-76]
- K. Maruyama, S. E. Smith:
Optimal Reorganization of Distributed Space Disk Files.
Commun. ACM 19(11): 634-642(1976)
![bibliographical record in XML](../../xml.gif)
- [SEVE-76]
- Dennis G. Severance, Guy M. Lohman:
Differential Files: Their Application to the Maintenance of Large Databases.
ACM Trans. Database Syst. 1(3): 256-267(1976)
![bibliographical record in XML](../../xml.gif)
- [SHNE-73]
- Ben Shneiderman:
Optimum Data Base Reorganization Points.
Commun. ACM 16(6): 362-365(1973)
![bibliographical record in XML](../../xml.gif)
- [SOCK-77]
- ...
- [SOCK-79A]
- ...
- [SOCK-79B]
- Gary H. Sockut, Robert P. Goldberg:
Database Reorganization - Principles and Practice.
ACM Comput. Surv. 11(4): 371-395(1979)
![bibliographical record in XML](../../xml.gif)
- [SODE-80]
- ...
- [SPER-79]
- ...
- [STOC-73]
- Peter M. Stocker, P. A. Dearnley:
Self-Organising Data Management Systems.
Comput. J. 16(2): 100-105(1973)
![bibliographical record in XML](../../xml.gif)
- [TUEL-78]
- William G. Tuel Jr.:
Optimum Reorganization Points for Linearly Growing Files.
ACM Trans. Database Syst. 3(1): 32-40(1978)
![bibliographical record in XML](../../xml.gif)
- [YAO-76]
- S. Bing Yao, K. Sundar Das, Toby J. Teorey:
A Dynamic Database Reorganization Algorithm.
ACM Trans. Database Syst. 1(2): 159-174(1976)
![bibliographical record in XML](../../xml.gif)
Copyright © Tue Mar 16 02:21:56 2010
by Michael Ley (ley@uni-trier.de)