Kenneth A. Ross, Kazi A. Zaman  Home/Search
Context Related
| columbia.edu/report...cucs01898.ps.gz columbia.edu/~libra...cucs01898.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: columbia.edu/~library/1998 (more) Homepages: K.Zaman |
Rate this article:      (best)Comment on this article |
Abstract: Datacube queries compute aggregates over database relations at a variety of granularities, and they constitute an important class of decision support queries. Often one wants only datacube output tuples whose aggregate value satisfies a certain condition, such as exceeding a given threshold. For example, one might ask for all combinations of model, color, and year of cars (including the special value "ALL" for each of the dimensions) for which the total sales exceeded a given amount of money.... (Update)
Context of citations to this paper: More
.... In recent independent work, researchers at Columbia University also found that pushing the HAVING clause into CUBE computation is beneficial [15]. They describe how to take advantage of HAVING predicates in PartitionedCube MemoryCube. Procedure BottomUpCube(input, dim)...
...of sorting tuples immediately. In a similar fashion to 1 Specialization we can define n Specialization which is described in detail in [16]. The basic idea is to specialize on n cuboids for larger values of n. We believe that this optimization is not as useful as...
Cited by: More
Computing and Querying Datacubes - Zaman (Correct)
Optimizing Selections over Datacubes - Ross, Zaman (1998) (Correct)
Bottom-Up Computation of Sparse and Iceberg CUBEs - Beyer, Ramakrishnan (1999) (Correct)
Active bibliography (related documents): More All
0.2: Finding Replicated Web Collections - Cho, Shivakumar, Garcia-Molina (2000) (Correct)
0.2: Scalable Techniques for Clustering the Web (Extended.. - Haveliwala, Gionis, Indyk (2000) (Correct)
0.2: Predicting the cost-quality trade-off for.. - Blok, de Jong.. (Correct)
Similar documents based on text: More All
0.5: Serving Datacube Tuples from Main Memory - Columbia (Correct)
0.4: Computing Partial Data Cubes for Parallel Data.. - Dehne, Eavis.. (2001) (Correct)
0.3: Fast Computation of Sparse Datacubes - Ross, Srivastava (1997) (Correct)
Related documents from co-citation: More All
7: Fast computation of sparse datacubes - Ross, Srivastava - 1997
6: Data cube: A relational aggregation operator generalizing group-by - Gray, Bosworth et al. - 1996
4: Fast Algorithms for Mining Association Rules - Agrawal, Srikant - 1994
BibTeX entry: (Update)
K. A. Ross and K. A. Zaman. Optimizing selections over data cubes. Technical Report CUCS-018-98, Columbia University, Nov 1998. http://www.cs.- columbia.edu/ library/1998.html. http://citeseer.ist.psu.edu/article/ross98optimizing.html More
@inproceedings{ ross00optimizing,
author = "Kenneth A. Ross and Kazi A. Zaman",
title = "Optimizing Selections over Datacubes",
booktitle = "Statistical and Scientific Database Management",
pages = "139-152",
year = "2000",
url = "citeseer.ist.psu.edu/article/ross98optimizing.html" }
Citations (may not include all citations):910 Fast algorithms for mining association rules - Agrawal, Srikant - 1994
393 Datacube: A relational aggregation operator generalizing gro.. - Gray, Bosworth et al. - 1996
185 the computation of multidimensional aggregates - Agarwal, Agrawal et al. - 1996
70 Fast computation of sparse datacubes - Ross, Srivastava - 1997 ACM DBLP
70 Fast computation of sparse datacubes - Ross, Srivastava - 1998
61 Monotonic aggregation in deductive databases - Ross, Sagiv - 1997 ACM DBLP
54 Query optimization by predicate movearound - Levy, Mumick et al. - 1994
41 Foundation of aggregation constraints - Ross, Srivastava et al. - 1998
20 Reasoning with aggregation constraints - Levy, Mumick - 1996
7 Implementing data cubes e#ciently (context) - Harinarayan, Rajaraman et al. - 1996
4 Computing iceberg queries e#ciently (context) - Fang, Shivakumar et al. - 1998
3 An array-based algorithm for simultaneous multidimensional a.. (context) - Zhou, Deshpande et al. - 1997 ACM DBLP
Documents on the same site (http://www.cs.columbia.edu/~library/1998.html): More
What is the complexity of Stieltjes integration? - Werschulz (1998) (Correct)
Usenetfs: A Stackable File System for Large Article Directories - Erez Zadok (1998) (Correct)
Synthesis for Logical Initializability of Synchronous Finite.. - Singh, Nowick (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC