SIGMOD
1993
ACM
13 years 11 months ago
1993
ACM
The OO7 Benchmark represents a comprehensive test of OODBMS performance. In this report we describe the benchmark and present performance results from its implementation in four O...
SIGMOD
1993
ACM
13 years 11 months ago
1993
ACM
SIGMOD
1993
ACM
13 years 11 months ago
1993
ACM
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an e cient algorithm that generates all s...
ICDT
1992
ACM
13 years 11 months ago
1992
ACM
ICDT
1992
ACM
13 years 11 months ago
1992
ACM
ICDE
1992
IEEE
13 years 11 months ago
1992
IEEE
This paper presents two algorithms for maintaining Btree index consistency in a DBMS which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but i...
ICDE
1992
IEEE
13 years 11 months ago
1992
IEEE
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
ICDE
1992
IEEE
13 years 11 months ago
1992
IEEE
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
PODS
1994
ACM
13 years 11 months ago
1994
ACM