Sciweavers

363 search results - page 9 / 73
» Analyzing Plan Diagrams of Database Query Optimizers
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 2 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
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 7 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
ER
1999
Springer
105views Database» more  ER 1999»
13 years 12 months ago
Modeling Interactive Web Sources for Information Mediation
We propose a method for modeling complex Web sources that have active user interaction requirements. Here active" refers to the fact that certain information in these sources ...
Bertram Ludäscher, Amarnath Gupta
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
14 years 16 days ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 9 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang