Evaluating the Dynamic Behavior of Database Applications

@article{He2005EvaluatingTD,
  title={Evaluating the Dynamic Behavior of Database Applications},
  author={Zhen He and J{\'e}r{\^o}me Darmont},
  journal={ArXiv},
  year={2005},
  volume={abs/1701.00400}
}
This paper explores the effect that changing access patterns has on the performance of database management systems. Changes in access patterns play an important role in determining the efficiency of key performance optimization techniques, such as dynamic clustering, prefetching, and buffer replacement. However, all existing benchmarks or evaluation frameworks produce static access patterns in which objects are always accessed in the same order repeatedly. Hence, we have proposed the Dynamic… 

Figures and Tables from this paper

Database Benchmarks

  • J. Darmont
  • Computer Science
    Database Technologies: Concepts, Methodologies, Tools, and Applications
  • 2009
An overview of the major families of state-of-the-art database benchmarks, namely, relational benchmarks, object and object-relational benchmarks, XML benchmarks, and decision-support benchmarks is presented; and the issues, tradeoffs, and future trends in database benchmarking are discussed.

USING OBJECT-RELATIONAL DATABASE TECHNOLOGY TO SOLVE PROBLEMS IN DATABASE DEVELOPMENT

The goal of the paper is to present how to use the object-relational database management system (ORDBMS) to overcome relational database (RDB) existing problems and improve database performance in the database development using features of ORDB technology.

Solving Relational Database Problems with ORDBMS in an Advanced Database Course.

The paper presents how to use the specific object-relational database (ORDB) technology to solve normalization problems in 1) Transitive dependency, 2) Multi-value attributes, and 3) Non-1st Normal Form; and provides the solutions to data complexity problems with specific ORDBMS techniques.

Accelerating multi dimensional queries in data warehouses

On Line Analytical Processing or OLAP is the main vehicle for querying data warehouses and a system that provides approximate answers in a timely fashion would suit their requirements better.

A Mobile Application Development Tool based on Object Relational Mapping Solution

A framework of mobile application development tool using Object Relational Mapping (ORM) solution in front-end domain layer, especially for mobile database-driven application system is proposed.

Representing Classes of Things and Properties in General in Conceptual Modelling: An Empirical Evaluation

The authors use ontological theory and cognition theory to provide guidelines about how classification should be represented in conceptual models and describe a cognitive processing study that examined whether clearly distinguishing between classes of things and properties in general impacts the cognitive behaviours of the users.

Intelligent Retrieval Model : Object Oriented Search

The guiding principle of proposed model for intelligent retrieval over World Wide Web is the adequate representation of relevant complex relationships between the various entities in the real world, which approves better hierarchical relationship recognition among web objects leading to less complex computing.

References

SHOWING 1-10 OF 28 REFERENCES

DOEF: A Dynamic Object Evaluation Framework

This paper proposes a dynamic object evaluation framework (DOEF) that accomplishes access pattern change by defining configurable styles of change and compares the performances of four state of the art dynamic clustering algorithms to show that DOEF is indeed effective at determining the adaptability of each dynamic clusters algorithm to changes in access pattern.

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.

OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented Database Systems

A generic object-oriented benchmark that has been designed to evaluate the performances of clustering policies in object- oriented databases, OCB is generic because its sample database may be customized to fit the databases introduced by the main existing benchmarks (e.g., OO1).

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

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

Platypus: Design and Implementation of a Flexible High Performance Object Store

For both medium and small OO7 workloads Platypus outperforms SHORE across a wide range of benchmark operations in both 'hot' and 'cold' settings.

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.

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 BORD Benchmark for Object-Relational Databases

The design philosophy, benchmark database, and test queries of the BORD benchmark are presented, which has been developed to evaluate system performance peculiar to the object-relational data model as well as to the functions of modern database systems.

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.