DIPS: an efficient pointer swizzling strategy for incremental uncaching environments

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 753
  • Download : 158
Pointer swizzling improves the performance of OODBMSs by reducing the number of table lookups. However, the object replacement incurs the unswizzling overhead. In this paper, we propose a new pointer swizzling strategy, the dynamic indirect pointer swizzling (DIPS). DIPS dynamically applies pointer swizzling techniques in order to reduce the overhead of unswizzling. DIPS uses the temporal locality information which is gathered by the object buffer manager. The information is used to select the object to whose pointers the pointer swizzling techniques are applied and to dynamically bind the pointer swizzling techniques using the virtual function mechanism. We show the efficiency of the proposed strategy through experiments over various object buffer sizes and workloads. (C) 2003 Elsevier Inc. All rights reserved.
Publisher
ELSEVIER SCIENCE INC
Issue Date
2004-04
Language
English
Article Type
Article
Keywords

OBJECTS; PERSISTENT; DATABASE

Citation

JOURNAL OF SYSTEMS AND SOFTWARE, v.71, no.1-2, pp.189 - 198

ISSN
0164-1212
URI
http://hdl.handle.net/10203/1918
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0