189 search results - page 8 / 38 » Approximating predicates and expressive queries on probabili... |
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
PODS
2000
ACM
14 years 2 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
PODS
2000
ACM
14 years 2 months ago
2000
ACM
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...