220
click to vote
ICDE
1995
IEEE
16 years 6 months ago
1995
IEEE
Data compression is one way to alleviate the 1/0bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the ...
254
click to vote
ICDE
1995
IEEE
16 years 6 months ago
1995
IEEE
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we...
247
click to vote
ICDE
1995
IEEE
16 years 6 months ago
1995
IEEE
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...
261
click to vote
ICDE
1995
IEEE
16 years 6 months ago
1995
IEEE
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
263
click to vote
ICDE
1995
IEEE
16 years 6 months ago
1995
IEEE
We describe a two-level client-side cache for composite objects mapped as views of a relational database. A semantic model, the Structural Model, is used to specify joins on the r...