55 search results - page 8 / 11 » Evaluating rank joins with optimal cost |
IUI
1993
ACM
14 years 2 months ago
1993
ACM
The goal of this paper is to model an agent who dislikes large choice sets because of the “cost of thinking” involved in choosing from them. We take as a primitive a preferenc...
APNOMS
2006
Springer
14 years 2 months ago
2006
Springer
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
EDBT
2012
ACM
12 years 1 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
SIGMOD
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of pipelined filters, where a continuous stream of tuples is processed by a set of commutative filters. Pipelined filters are common in stream applications...
ECOOP
1999
Springer
14 years 3 months ago
1999
Springer
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debu...