Sciweavers

720 search results - page 110 / 144
» Evaluating Database Selection Techniques: A Testbed and Expe...
Sort
View
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
14 years 15 days ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
ICDE
2007
IEEE
211views Database» more  ICDE 2007»
14 years 2 months ago
Document Representation and Dimension Reduction for Text Clustering
Increasingly large text datasets and the high dimensionality associated with natural language create a great challenge in text mining. In this research, a systematic study is cond...
M. Mahdi Shafiei, Singer Wang, Roger Zhang, Evange...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
Scalable discovery of hidden emails from large folders
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
EDBT
2004
ACM
187views Database» more  EDBT 2004»
14 years 7 months ago
Hierarchical In-Network Data Aggregation with Quality Guarantees
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 2 months ago
Finding frequent co-occurring terms in relational keyword search
Given a set Q of keywords, conventional keyword search (KS) returns a set of tuples, each of which (i) is obtained from a single relation, or by joining multiple relations, and (i...
Yufei Tao, Jeffrey Xu Yu