Sciweavers

1399 search results - page 187 / 280
» New Algorithms for k-Center and Extensions
Sort
View
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
14 years 1 months ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...
DEXAW
1998
IEEE
126views Database» more  DEXAW 1998»
14 years 1 months ago
An Extended Query Reformulation Technique Using Materialized Views
Materialized views offer opportunities for significant performance gain in query evaluation by providing fast access to pre-computed data. The question of when and how to use a ma...
Jae-young Chang, Sang-goo Lee
ICDM
2007
IEEE
155views Data Mining» more  ICDM 2007»
14 years 21 days ago
Transitional Patterns and Their Significant Milestones
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
Qian Wan, Aijun An
DMSN
2006
ACM
14 years 15 days ago
Processing proximity queries in sensor networks
Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we in...
Yannis Kotidis
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
14 years 15 days ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld