Sciweavers

3016 search results - page 476 / 604
» The Online Transportation Problem
Sort
View
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 4 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
16 years 4 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
SIGMOD
2002
ACM
91views Database» more  SIGMOD 2002»
16 years 4 months ago
A scalable hash ripple join algorithm
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...
Gang Luo, Curt J. Ellmann, Peter J. Haas, Jeffrey ...
PODS
2001
ACM
167views Database» more  PODS 2001»
16 years 4 months ago
Querying Websites Using Compact Skeletons
Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML docum...
Anand Rajaraman, Jeffrey D. Ullman
EDBT
2004
ACM
110views Database» more  EDBT 2004»
16 years 4 months ago
Using Convolution to Mine Obscure Periodic Patterns in One Pass
The mining of periodic patterns in time series databases is an interesting data mining problem that can be envisioned as a tool for forecasting and predicting the future behavior o...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...