Version modeling concepts for computer-aided design databases
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Composite object support in an object-oriented database system
OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
The design and implementation of a version server for computer-aided design data
Software—Practice & Experience
A version server for computer-aided design data
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Managing Change in a Computer-Aided Design Database
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Object management system concepts
COCS '84 Proceedings of the second ACM-SIGOA conference on Office information systems
Inheritance in Computer-Aided Design Databases: Semantics and
Inheritance in Computer-Aided Design Databases: Semantics and
Support for Versions of VLSI CAD Objects
Support for Versions of VLSI CAD Objects
Effective clustering and buffering in an object-oriented dbms
Effective clustering and buffering in an object-oriented dbms
Managing persistent objects in a multi-level store
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Effective clustering of complex objects in object-oriented databases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Efficient assembly for complex objects
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The term retrieval abstract machine
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Performances of clustering policies in object bases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
HAC: hybrid adaptive caching for distributed storage systems
Proceedings of the sixteenth ACM symposium on Operating systems principles
Vclusters: a flexible, fine-grained object clustering mechanism
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Object Organization on a Single Broadcast Channel in the Mobile Computing Environment
Multimedia Tools and Applications
VOODB: A Generic Discrete-Event Random Simulation Model To Evaluate the Performances of OODBs
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Context-Based Prefetch for Implementing Objects on Relations
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Fido: A Cache That Learns to Fetch
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Extensible Buffer Management of Indexes
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Clustering Techniques for Minimizing External Path Length
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity
Proceedings of the International Symposium on Objects and Databases
Context-based prefetch – an optimization for implementing objects on relations
The VLDB Journal — The International Journal on Very Large Data Bases
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions
The VLDB Journal — The International Journal on Very Large Data Bases
Information Sciences: an International Journal
A Tool for Nesting and Clustering Large Objects
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Dynamic Reorganization of Object Databases
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
An object-oriented persistent database interface for CAD
EURO-DAC '90 Proceedings of the conference on European design automation
EURO-DAC '91 Proceedings of the conference on European design automation
Research issues in automatic database clustering
ACM SIGMOD Record
A Formal Framework for Prefetching Based on the Type-Level Access Pattern in Object-Relational DBMSs
IEEE Transactions on Knowledge and Data Engineering
Path and cache conscious prefetching (PCCP)
The VLDB Journal — The International Journal on Very Large Data Bases
A multi-version cache replacement and prefetching policy for hybrid data delivery environments
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
An Approach to Distribution of Object-Oriented Applications in Loosely Coupled Networks
Journal of Management Information Systems
Online reorganization of databases
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
Object-oriented databases provide new kinds of data semantics in terms of inheritance and structural relationships. This paper examines how to use these additional semantics to obtain more effective object buffering and clustering. We use the information collected from real-world object-oriented applications, the Berkeley CAD Group's OCT design tools, as the basis for a simulation model with which to investigate alternative buffering and clustering strategies. Observing from our measurements that real CAD applications exhibit high data read to write ratios, we propose a run-time clustering algorithm whose initial evaluation indicates that system response time can be improved by a factor of 200% when the read/write ratio is high. We have also found it useful to limit the amount of I/O allowed to the clustering algorithm as it examines candidate pages for clustering at run-time. Basically, there is little performance distinction between limiting reclustering to a few I/Os or many, so a low limit on I/O appears to be acceptable. We also examine, under a variety of workload assumptions, context-sensitive buffer replacement policies with alternative prefetching policies.