282 search results - page 37 / 57 » Robust Query Processing through Progressive Optimization |
146
Voted
JMLR
2012
13 years 4 months ago
2012
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
183
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
203
Voted
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
140
click to vote
PPDP
2010
Springer
15 years 1 days ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
181
click to vote
SSD
2007
Springer
15 years 8 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...