117
Voted
WISE
2000
Springer
15 years 8 months ago
2000
Springer
127
click to vote
ESA
1995
Springer
15 years 8 months ago
1995
Springer
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
128
click to vote
ER
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. This paper presents techniques for reverse engineering of relational database applications. The target of such an effort is the definition of a fully equipped object-orie...
198
click to vote
ER
1995
Springer
15 years 8 months ago
1995
Springer
We describe a (meta) formalism for defining a variety of (object oriented) data models in a unified framework based on a variation of first-order logic. As specific example we use...
