552 search results - page 22 / 111 » On the Complexity of Join Predicates |
SSDBM
2005
IEEE
14 years 3 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
PODS
2008
ACM
14 years 10 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
SMA
2009
ACM
14 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
DEXA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. This paper proposes a natural extension of conditional functional dependencies (cfds [14]) and conditional inclusion dependencies (cinds [8]), denoted by cfdp s and cindp...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...