Next:
Contents
Object-Oriented Persistent Storage for C++
Mori Tetsuya /
t2y@kt.rim.or.jp
January 21, 1998
Contents
List of Figures
Introduction
Backgrounds
Basic Functions of Computers
Various Storages
Manipulation Schemes
Advantages and Disadvantages
Programming Interfaces
Assembler Model
C Model
BASIC Model
Lisp Model
C++ Model
Java Model
Spreadsheet Model
SQL Model
Restrictions
Object-Oriented Approaches
Design of Persistent Storage
Design Goals
Interfaces
Addressing
Persistent Pointers
Reference Pointers
Mapping and Address Conversion
mmap()
system call
Allocation Algorithms
C Heap Allocation Model
malloc()
routine
free()
routine
C++ Object Instantiation
new
operator
delete
operator
Generalization of the Algorithms
New Factors in Persistence
Synchronization
Mapping and Unmapping
Window Overlapping
Primitive Operations
Allocate
Destroy
Grab
Release
Synchronize
Sample Flowchart of Operations
Implementation in C++
Naming Conventions
Utility Classes
MMap
Class
SortedTable
Classes
SortableObject
Interface
SortedPointerTable
Class
SortedObjectTable
Class
FileStat
Class
ScanDir
Class
RawFile
Class
Persistent Storage Classes
Comprehensive Description
Condensed Map of Classes
Object Mapping
PersistentStorage
Class
PersistentPointer
Class
Arena
Class
ArenaID
Other Members
Allocation
Mapping
Window Overlapping and Fragmentation
ArenaInitialBlock
Class
Window
Class
Accessors
Constructors
Operations
Comparison Schemes
Chunk
Class
OffsetChunkPair
Class
PersistentOffset
Class
Entry
Class
PersistentObject
Class
PointerPair
Class
Applications
SimpleTree
Class
HtmlIndexer
Class
Performance Analysis
Compiler Options
Optimization
Algorithms
Operation Overheads
Storage Overheads
To Do
Generalized Collection Classes
Atomicity
Security
Robustness
Concurrent/Parallel Operations
Distributed Storage
References
The Sources
PersistentStorage.h
PersistentStorage.cc
MMap.h
SortedTable.h
FileStat.h
Main.cc
Makefile
Index
About this document ...
Mori Tetsuya / t2y@kt.rim.or.jp
