552 search results - page 17 / 111 » On the Complexity of Join Predicates |
ER
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Topological relationships between spatial objects in the twodimensional space have been investigated for a long time in a number of disciplines like artificial intellige...
VLDB
2001
ACM
14 years 2 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
CSR
2011
Springer
13 years 1 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...