236
Voted
ICDE
1995
IEEE
16 years 5 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...
255
Voted
ICDE
1995
IEEE
16 years 5 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...
260
click to vote
ICDE
1995
IEEE
16 years 5 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...
208
Voted
ICDE
1995
IEEE
16 years 5 months ago
1995
IEEE
While much work has addressed the problem of maintaining materialized views, the important question of optimizing queries in the presence of materialized views has not been resolv...
215
click to vote
ICDE
1995
IEEE
16 years 5 months ago
1995
IEEE
Active OODBMSs must provide e cient support for event detection, composition, and rule execution. Previous experience, reported here, building active capabilities on top of existi...
285
click to vote
ICDE
1995
IEEE
16 years 5 months ago
1995
IEEE
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...
236
Voted
ICDE
1995
IEEE
16 years 5 months ago
1995
IEEE
233
Voted
ICDE
1995
IEEE
16 years 5 months ago
1995
IEEE
286
Voted
ICDE
1996
IEEE
16 years 5 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...