Sciweavers

7 search results - page 1 / 2
» Optimizing OID Indexing Cost in Temporal Object-Oriented Dat...
Sort
View
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
13 years 8 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
VLDB
1999
ACM
149views Database» more  VLDB 1999»
13 years 8 months ago
The Persistent Cache: Improving OID Indexing in Temporal Object-Oriented Database Systems
In a temporal OODB, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal OODB, the OIDX should also index the objec...
Kjetil Nørvåg
EWDW
1994
13 years 8 months ago
Optimization of Object-Oriented Queries by Inverse Methods
For object-oriented databases we propose a new technique for optimizing queries containing method invocations. This technique is based on the definition of inverse methods and que...
Johann Eder, Heinz Frank, Walter Liebhart
NATO
1993
13 years 8 months ago
METU Object-Oriented DBMS
METU Object-Oriented DBMS 1 includes the implementation of a database kernel, an object-oriented SQL-like language and a graphical user interface. Kernel functions are divided bet...
Asuman Dogac, Cetin Ozkan, Ismailcem Budak Arpinar...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
13 years 9 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...