Sciweavers

792 search results - page 1 / 159
» Computing Iceberg Queries Efficiently
Sort
View
VLDB
1998
ACM
105views Database» more  VLDB 1998»
13 years 9 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
DASFAA
2004
IEEE
95views Database» more  DASFAA 2004»
13 years 9 months ago
On Incorporating Iceberg Queries in Query Processors
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. We present here a performanc...
Krishna P. Leela, Pankaj M. Tolani, Jayant R. Hari...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 5 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
ICCS
2004
Springer
13 years 10 months ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
DKE
2002
218views more  DKE 2002»
13 years 5 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...