Sciweavers

128 search results - page 11 / 26
» Plan Selection Based on Query Clustering
Sort
View
VLDB
2002
ACM
91views Database» more  VLDB 2002»
13 years 7 months ago
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
Arvind Hulgeri, S. Sudarshan
JIPS
2006
129views more  JIPS 2006»
13 years 7 months ago
ASVMRT: Materialized View Selection Algorithm in Data Warehouse
: In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view select...
Jin-Hyuk Yang, In-Jeong Chung
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
PPDP
2010
Springer
13 years 6 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
ICDE
2008
IEEE
125views Database» more  ICDE 2008»
14 years 9 months ago
Just-In-Time Processing of Continuous Queries
In a data stream management system, a continuous query is processed by an execution plan consisting of multiple operators connected via the "consumer-producer" relationsh...
Yin Yang, Dimitris Papadias