505 search results - page 3 / 101 » Efficient Temporal Join Processing Using Indices |
DASFAA
2006
IEEE
14 years 1 months 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...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
SIGMOD
1999
ACM
13 years 11 months ago
1999
ACM
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...