Cited By
View all- Park JKanitkar VDelis A(2019)Logically Clustered Architectures for Networked DatabasesDistributed and Parallel Databases10.1023/A:101928442957810:2(161-198)Online publication date: 1-Jun-2019
Dynamic Reorganization of Object Databases
Page 110
Abstract
We consider the problem of optimizing the number of I/O operations by means of an effective clustering with the objective to overcome defficiencies of existing solutions. Our objective is to dynamically adapt physical database organizations, on-line, according to the access patterns of the users without adding significant overhead on processing workload. We propose a clustering schedule that may be convenient for any Object Database Management Systems [ODBMS]; it combines flexibility, dynamics, and efficiency. This paper describes relative partial validation of our approach using Versant.
References
[1]
V. Wietrzyk. Performance Evaluation of New Clustering Algorithms in Object-Oriented Database Systems. International Conference on Database and Expert Systems Applications, Zurich, Switzerland, September 1996.
[2]
V. Wietrzyk, Mehmet A. Orgun. A Foundation for High Performance Object Database Systems. in Databases for the Millennium 2000 in proceedings of the 9th International Conference on Management of Data, Hyderabad, December, 1998.
[3]
V. Wietrzyk. Effective Clustering and Data Caching in Client-Serve DBMS Architecture. in Trends in Information Technology in the proceedings of the International Conference on Information Technology Bhubaneswar, December 1998.
[4]
Bancilon, F., Delobel, C., Kanellakis, P. Building An Object-Oriented Database System: The Story of O2. Morgan Kaufmann, San Mateo, CA, 1992.
[5]
Batory, D. S. Optimal File Designs and Reorganization Points. ACM Trans. On Database Systems, Vol.7, 1982.
[6]
J.B. Cheng, A.R Hurson. Effective Clustering of Complex Objects in Object-Oriented Databases. ACM SIGMOD Conference, 1991.
[7]
E.E. Chang, R.H. Katz. Inheritance in Computer-Aided Design Databases: Semantics and Implementation Issues. CAD. Vol. 22, 1990.
[8]
E.E. Chang, R.H. Katz. Exploiting Inheritance and Structure Semantics for Effective Clustering and Buffering in an Object-Oriented DBMS. ACM SIGMOD, 19989.
[9]
V. Wietrzyk, M. A. Orgun. VERSANT Architecture: Supporting High-Performance Object Databases. International Database Engineering Applications Symposium, IDEAS98, Cardiff, U.K., July 1998, IEEE Computer Society Press, Los Alamitos, Calif., 1998.
[10]
J. D. DeWitt, D. Maier, P. Futtersack, F. Velez. A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems. Proceedings of the 16th VLDB Conference Brisbane, Australia 1990.
[11]
D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification: A technique for speeding up dynamic graph algorithms. Proceedings of the 33rd IEEE Symposium on Foundation of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992.
[12]
P. N. Klein, R. E. Tarjan. A randomized linear-time algorithm for finding minimum spanning trees. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing. Montreal, Que., Canada. May 23- 25). ACM, New York, p. 9-15, 1994.
[13]
Bela Andrasfai. Graph Theory. Techno House, 335 East 45th Street, New York NY 100017, USA.
[14]
D. Alberts, G. Cattaneo, G. F. Italiano. An empirical study of dynamic graph algorithms. Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (1996).
[15]
R. E. Tarjan and D. D. Sleator. A data structure for dynamic trees. J. Comp. Sys. Sci., 1983.
[16]
T. L. Anderson, A.J. Berre, M. Mallison et al. The Hypermodel Benchmark in Bancilhon, Thanos, Tsichritzis (Eds.): Advances in Database Technology - EDBT'90, LNCS 416, 1990.
[17]
VERSANT System Manual. VERSANT Release 5.0, February 1997.
- Dynamic Reorganization of Object Databases
Recommendations
ADDROL: A Method for On-Line Reorganization in a Multisystem DBMS with Shared Disks
ICPADS '00: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: WorkshopsThis paper describes the design of a method, called ADDROL - Algorithm for Distributed Database Reorganization On-Line, which supports on-line reorganization of the distributed database. The contributions of this paper are both of theoretical and of ...
A Performance Evaluation of Log-Only Temporal Object Database Systems
SSDBM '00: Proceedings of the 12th International Conference on Scientific and Statistical Database ManagementAn alternative to in-place updating of data is to eliminate the database, and use a log-only approach. The log is written contiguously to the disk, in a no-overwrite way, in large blocks. The log-only approach is particularly interesting for transaction ...
Optimal object descriptor caching in temporal object database systems
Information organization and databasesIn object database systems (ODBs) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction-time temporal ODB, the OIDX should also index the object versions. In this case, the index ...
Comments
Information & Contributors
Information
Published In
August 1999
ISBN:0769502652
Copyright © Copyright (c) 1998 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
Publisher
IEEE Computer Society
United States
Publication History
Published: 02 August 1999
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Sep 2024
Other Metrics
Citations
Cited By
View all- Park JKanitkar VDelis A(2019)Logically Clustered Architectures for Networked DatabasesDistributed and Parallel Databases10.1023/A:101928442957810:2(161-198)Online publication date: 1-Jun-2019