Methods for Evaluating Iceberg Queries

No abstract is available for this paper.

• Publication year

  2013

• Venue

  International Journal of Computer Applications

• Publication date

  2013-04-18

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.5120/11605-6971
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Exploiting query views for static index pruning in web search engines

  2009cited by this paper
• Static index pruning for information retrieval systems

  2001cited by this paper
• Iceberg-cube computation with PC clusters

  2001cited by this paper
• Expressive power of SQL

  2001cited by this paper
• APIC: An Efficient Algorithm for Computing Iceberg Datacubes

  2001cited by this paper
• Efficient computation of Iceberg cubes with complex measures

  2001cited by this paper
• Partitioning Algorithms for the Computation of Average Iceberg Queries

  2000influential reference
• A Framework for the Investigation of Aggregate Functions in Database Queries

  1999cited by this paper
• Probabilistic Optimization of Top N Queries

  1999cited by this paper
• Bottom-up computation of sparse and Iceberg CUBE

  1999cited by this paper
• Computing Iceberg Queries Efficiently

  1998cited by this paper
• Fast Algorithms for Mining Association Rules

  1998cited by this paper
• Fast Computation of Sparse Datacubes

  1997cited by this paper
• OLAP and statistical databases: similarities and differences

  1997cited by this paper
• An overview of data warehousing and OLAP technology

  1997cited by this paper
• Dynamic itemset counting and implication rules for market basket data

  1997cited by this paper
• Data reduction through early grouping

  1994cited by this paper
• Query evaluation techniques for large databases

  1993cited by this paper
• Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions

  1982cited by this paper
• Ubiquitous B-Tree

  1979cited by this paper
• Access path selection in a relational database management system

  1979cited by this paper
• A theory of indexing

  1975cited by this paper

• Iceberg Clique queries in large graphs

  2017cites this paper