DOEF: A Dynamic Object Evaluation Framework

  title={DOEF: A Dynamic Object Evaluation Framework},
  author={Zhen He and J{\'e}r{\^o}me Darmont},
  booktitle={International Conference on Database and Expert Systems Applications},
  • Zhen HeJ. Darmont
  • Published in
    International Conference on…
    1 September 2003
  • Computer Science
In object-oriented or object-relational databases such as multimedia databases or most XML databases, access patterns are not static, i.e., applications do not always access the same objects in the same order repeatedly. However, this has been the way these databases and associated optimisation techniques like clustering have been evaluated up to now. This paper opens up research regarding this issue by proposing a dynamic object evaluation framework (DOEF) that accomplishes access pattern… 

Evaluating the Dynamic Behavior of Database Applications

The results confirm the analysis that flexible conservative reclustering is the key in determining a clustering algorithm’s ability to adapt to changes in access pattern and show the effectiveness of DoEF at determining the adaptability of each dynamic clustering algorithms to changes to access pattern in a simulation environment.

Conception d'un banc d'essais décisionnel

The Data Warehouse Engineering Benchmark (DWEB) allows to generate various ad -hoc synthetic data warehouses and workloads and is complimentary to the TPC standard benchmarks, and not a competitor.

Object Database Benchmarks

  • J. Darmont
  • Computer Science
    Encyclopedia of Information Science and Technology
  • 2005
Benchmarks are generally used to compare the global performance of OODBMSs, but they can also be exploited to illustrate the advantages of one system or another in a given situation, or to determine an optimal hardware configuration.



Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity

Three dynamic clustering techniques for Object-Oriented Databases (OODBs) are presented and it is shown that DRO induced a lighter overhead while still achieving better overall performance.

Dynamic Clustering in Object Databases Exploiting Effective Use of Relationships Between Objects

This paper concerns the problem of clustering objects onto units of secondary storage to minimise the number of I/O operations in database applications. We first investigate problems associated with

Opportunistic Prioritised Clustering Framework (OPCF)

OPCF is presented, a framework in which any existing static clustering algorithm can be made dynamic and given the desired properties of I/O opportunism and clustering prioritisation, which can produce dynamic clustering algorithms that out-perform complex existing dynamic algorithms, in a variety of situations.

Benchmarking OODBs with a Generic Tool

We present in this paper a generic object-oriented benchmark (OCB: the Object Clustering Benchmark) that has been designed to evaluate the performances of Object-Oriented Data-bases (OODBs), and more

The Engineering Database Benchmark

This chapter describes EDB (for Engineering Database Benchmark), a redesign of an earlier, more primitive benchmark described in Rubenstein, Kubicar, and Cattell [RUBE1987].

The HyperModel Benchmark

This paper describes an application-oriented strategy for evaluating engineering DBMSs based on a generic hypertext application, which it calls the HyperModel, which consists of a schema and several operations described at a conceptual level, suitable for implementation on many differentDBMSs.

On the cost of monitoring and reorganization of object bases for clustering

This paper reports on a object base reorganization tool that covers all stages of reorganizing the objects: the application profile is determined by a monitoring tool, the object placement is computed from the monitored access statistics utilizing a variety of clustering algorithms and, finally, the reorganizations tool restructures the object base accordingly.

VOODB: A Generic Discrete-Event Random Simulation Model To Evaluate the Performances of OODBs

VOODB has been designed as a generic discrete-event random simulation model by putting to use a modelling approach, and has been validated by simulating the behavior of the O2 OODB and the Texas persistent object store.

Local Disk Caching for Client-Server Database Systems

The study shows that significant performance gains can be obtained through client disk caching and investigates the tradeoffs inherent in keeping a large volume of disk-cached data consistent using a detailed simulation model.

Data caching tradeoffs in client-server DBMS architectures

This paper presents a range of lock-based cache consistency algorithms that arise by viewing cache consistency as aiant of the well-understood problem of replicated data management, and uses a detailed simulation model to study the performance of these algorithm over a wide range of workloads end system resource configurations.