552 search results - page 6 / 111 » On the Complexity of Join Predicates |
VLDB
1998
ACM
13 years 10 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
SEMWEB
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
DASFAA
2006
IEEE
14 years 19 days ago
2006
IEEE
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
PODS
1999
ACM
13 years 11 months ago
1999
ACM
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
ICDM
2002
IEEE
13 years 11 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...