16082 search results - page 3135 / 3217 » Algorithms for Marketing-Mix Optimization |
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
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...
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
SIGMOD
2001
ACM
14 years 9 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
ICFP
2006
ACM
14 years 9 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...