We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server fo...
Sameer Mahajan, Michael J. Donahoo, Shamkant B. Na...
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...