Sciweavers

2546 search results - page 342 / 510
» Managing long-running queries
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
16 years 6 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 6 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
SIGMOD
2007
ACM
198views Database» more  SIGMOD 2007»
16 years 6 months ago
Addressing diverse user preferences in SQL-query-result navigation
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
Zhiyuan Chen, Tao Li
EDBT
2010
ACM
206views Database» more  EDBT 2010»
16 years 1 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...