Sciweavers

529 search results - page 91 / 106
» ideas 2003
Sort
View
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 10 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 10 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 10 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
SIGMOD
2003
ACM
175views Database» more  SIGMOD 2003»
14 years 10 months ago
WinMagic : Subquery Elimination Using Window Aggregation
Database queries often take the form of correlated SQL queries. Correlation refers to the use of values from the outer query block to compute the inner subquery. This is a conveni...
Calisto Zuzarte, Hamid Pirahesh, Wenbin Ma, Qi Che...
EDBT
2004
ACM
139views Database» more  EDBT 2004»
14 years 10 months ago
GRIDS, Databases, and Information Systems Engineering Research
GRID technology, emerging in the late nineties, has evolved from a metacomputing architecture towards a pervasive computation and information utility. However, the architectural de...
Keith G. Jeffery