552 search results - page 35 / 111 » On the Complexity of Join Predicates |
GIS
2006
ACM
14 years 11 months ago
2006
ACM
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
DCG
2006
13 years 10 months ago
2006
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...
CCCG
2010
13 years 11 months ago
2010
We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper un...
FAW
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
MFDBS
1991
14 years 1 months ago
1991
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...