Sciweavers

7 search results - page 1 / 2
» Optimizing OID Indexing Cost in Temporal Object-Oriented Dat...
Sort
View
154
Voted
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
15 years 7 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
123
Voted
VLDB
1999
ACM
149views Database» more  VLDB 1999»
15 years 7 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
151
Voted
EWDW
1994
15 years 6 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
180
Voted
NATO
1993
15 years 6 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»
15 years 7 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...