55 search results - page 6 / 11 » Evaluating rank joins with optimal cost |
ICDE
2003
IEEE
14 years 11 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
GEOINFORMATICA
1998
13 years 9 months ago
1998
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
CIKM
2006
Springer
14 years 1 months ago
2006
Springer
Optimising the parameters of ranking functions with respect to standard IR rank-dependent cost functions has eluded satisfactory analytical treatment. We build on recent advances ...