552 search results - page 5 / 111 » On the Complexity of Join Predicates |
ICPADS
2000
IEEE
13 years 10 months ago
2000
IEEE
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
VLDB
2001
ACM
13 years 10 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
SDMW
2010
Springer
13 years 4 months ago
2010
Springer
In an outsourced database framework, clients place data management with specialized service providers. Of essential concern in such frameworks is data privacy. Potential clients ar...
CADE
2009
Springer
14 years 1 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
EDBT
2004
ACM
14 years 6 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...