Sciweavers

285 search results - page 17 / 57
» Optimization of Real Conjunctive Queries
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 1 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
BTW
2009
Springer
118views Database» more  BTW 2009»
13 years 10 months ago
Multi-Objective Scheduling for Real-Time Data Warehouses
: The issue of write-read contention is one of the most prevalent problems when deploying real-time data warehouses. With increasing load, updates are increasingly delayed and prev...
Maik Thiele, Andreas Bader, Wolfgang Lehner
PODS
2005
ACM
128views Database» more  PODS 2005»
14 years 6 months ago
Operator placement for in-network stream query processing
In sensor networks, data acquisition frequently takes place at lowcapability devices. The acquired data is then transmitted through a hierarchy of nodes having progressively incre...
Utkarsh Srivastava, Kamesh Munagala, Jennifer Wido...
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 9 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
ICDE
2010
IEEE
233views Database» more  ICDE 2010»
14 years 1 days ago
Polynomial heuristics for query optimization
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
Nicolas Bruno, César A. Galindo-Legaria, Mi...