Sciweavers

1127 search results - page 135 / 226
» Perspectives and Complex Aggregates
Sort
View
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 11 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 11 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
GIS
2009
ACM
14 years 11 months ago
Custom Local Search
Many popular online services provide "local" or "yellow-pages" search, but none of them allow users to customize the search over user-specified data. Instead, ...
Naren Datha, Tanuja Joshi, Joseph Joy, Vibhuti S. ...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 11 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz