Sciweavers

297 search results - page 41 / 60
» Polynomial heuristics for query optimization
Sort
View
EDBT
2010
ACM
184views Database» more  EDBT 2010»
13 years 9 months ago
PARINDA: an interactive physical designer for PostgreSQL
One of the most challenging tasks for the database administrator is to physically design the database to attain optimal performance for a given workload. Physical design is hard b...
Cristina Maier, Debabrata Dash, Ioannis Alagiannis...
VLDB
2007
ACM
146views Database» more  VLDB 2007»
14 years 8 months ago
A Cost-Estimation Component for Statement Sequences
Query generators producing sequences of SQL statements are embedded in many applications. As the execution time of such sequences is often far from optimal, their optimization is ...
Tobias Kraft
FOCS
2004
IEEE
13 years 11 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
ICDT
2009
ACM
150views Database» more  ICDT 2009»
14 years 8 months ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
CVPR
2011
IEEE
13 years 5 months ago
Dynamic Batch Mode Active Learning
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
Shayok Chakraborty, Vineeth Balasubramanian, Sethu...