Sciweavers

701 search results - page 2 / 141
» Costs Are Expensive!
Sort
View
77
Voted
SBBD
2003
101views Database» more  SBBD 2003»
14 years 10 months ago
Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
Fabio Porto, Eduardo Sany Laber, Patrick Valduriez
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
15 years 1 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
NETCOOP
2007
Springer
15 years 3 months ago
How Expensive Is Link Utilization?
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in unde...
Rade Stanojevic, Robert Shorten
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
15 years 9 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 9 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang