356 search results - page 4 / 72 » Robust and efficient algorithms for rank join evaluation |
VLDB
2005
ACM
14 years 10 months ago
2005
ACM
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
We identify and formalize a novel join operator for two spatial pointsets P and Q. The common influence join (CIJ) returns the pairs of points (p, q), p P, q Q, such that there e...
DEXA
2010
Springer
13 years 10 months ago
2010
Springer
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...