Sciweavers

552 search results - page 12 / 111
» On the Complexity of Join Predicates
Sort
View
DEXA
2003
Springer
193views Database» more  DEXA 2003»
13 years 12 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. 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 t...
Christian Böhm, Florian Krebs
COLING
2008
13 years 8 months ago
Hindi Compound Verbs and their Automatic Extraction
We analyse Hindi complex predicates and propose linguistic tests for their detection. This analysis enables us to identify a category of V+V complex predicates called lexical comp...
Debasri Chakrabarti, Hemang Mandalia, Ritwik Priya...
PODS
2005
ACM
118views Database» more  PODS 2005»
14 years 6 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
14 years 10 days ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SSD
2001
Springer
94views Database» more  SSD 2001»
13 years 11 months ago
Selectivity Estimation of Complex Spatial Queries
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
Nikos Mamoulis, Dimitris Papadias