6004 search results - page 717 / 1201 » Parallelizing query optimization |
123
click to vote
ISMIR
2004
Springer
15 years 10 months ago
2004
Springer
Time series representations are common in MIR applications such as query-by-humming, where a sung query might be represented by a series of ‘notes’ for database retrieval. Whi...
152
click to vote
WAIM
2004
Springer
15 years 9 months ago
2004
Springer
Selectivity estimation of path expressions in querying XML data plays an important role in query optimization. A path expression may contain multiple branches with predicates, each...
153
click to vote
SSDBM
2003
IEEE
15 years 9 months ago
2003
IEEE
In many application contexts, like statistical databases, scientific databases, query optimizers, OLAP, and so on, data are often summarized into synopses of aggregate values. Su...
128
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
142
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...