Sciweavers

8763 search results - page 1452 / 1753
» Querying Database Knowledge
Sort
View
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 6 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 6 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
2003
ACM
196views Database» more  SIGMOD 2003»
16 years 6 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 6 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 6 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
« Prev « First page 1452 / 1753 Last » Next »