Most of todays object oriented database systems (OODBS) employ a two-level architecture consisting of an object level and a storage level containing database objects in different formats. Before objects can be used by an application program, they have to be converted from their storage format to an in-memory format. An important aspect in this process is the conversion of references between objects to in-memory pointers so that object access is accelerated. These conversion mechanisms for references are so-called pointer swizzling strategies. Existing pointer swizzling strategies consist of many processing steps, and thus, are cumbersome and timeconsuming. We introduce the physical pointer swizzling strategy which is based on a different ki...
Providing high performance for pointer-intensive programs on modern architectures is an increasingly...
The cost of accessing main memory is increasing. Machine designers have tried to mitigate the conseq...
We present a technique to increase data cache utilization of pointer-based programs. These caches ar...
In this paper we will classify and evaluate different approaches to optimizing the access to main me...
Pointer swizzling is the conversion of database objects between an external form (object identifier...
Persistent programming systems are generally supported by an object store, a conceptually infinite o...
Persistent programming is a known efficient programming model that allows the creation of powerful s...
Swizzling refers to the translation of object references from an external, persistent format to an i...
Introduction Most object-oriented database systems and persistent object stores have been construct...
As the gap between processor power and memory speed continues to widen, cache performance of modern ...
64-bit address spaces come at the price of pointers requiring twice as much memory as 32-bit address...
64-bit address spaces are increasingly important for modern applications, but they come at a price: ...
Swizzling refers to the translation of object references from an external, persistent format to an i...
When a working set fits into memory, the overhead im-posed by the buffer pool renders traditional da...
In a temporal OODB, an OID index (OIDX) is needed to map from OID to the physical location of the ob...
Providing high performance for pointer-intensive programs on modern architectures is an increasingly...
The cost of accessing main memory is increasing. Machine designers have tried to mitigate the conseq...
We present a technique to increase data cache utilization of pointer-based programs. These caches ar...
In this paper we will classify and evaluate different approaches to optimizing the access to main me...
Pointer swizzling is the conversion of database objects between an external form (object identifier...
Persistent programming systems are generally supported by an object store, a conceptually infinite o...
Persistent programming is a known efficient programming model that allows the creation of powerful s...
Swizzling refers to the translation of object references from an external, persistent format to an i...
Introduction Most object-oriented database systems and persistent object stores have been construct...
As the gap between processor power and memory speed continues to widen, cache performance of modern ...
64-bit address spaces come at the price of pointers requiring twice as much memory as 32-bit address...
64-bit address spaces are increasingly important for modern applications, but they come at a price: ...
Swizzling refers to the translation of object references from an external, persistent format to an i...
When a working set fits into memory, the overhead im-posed by the buffer pool renders traditional da...
In a temporal OODB, an OID index (OIDX) is needed to map from OID to the physical location of the ob...
Providing high performance for pointer-intensive programs on modern architectures is an increasingly...
The cost of accessing main memory is increasing. Machine designers have tried to mitigate the conseq...
We present a technique to increase data cache utilization of pointer-based programs. These caches ar...