505 search results - page 1 / 101 » Efficient Temporal Join Processing Using Indices |
ICDE
2002
IEEE
14 years 5 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
NGITS
1997
Springer
13 years 8 months ago
1997
Springer
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
ICDE
2003
IEEE
14 years 5 months ago
2003
IEEE
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
VLDB
1994
ACM
13 years 8 months ago
1994
ACM
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
VLDB
2005
ACM
14 years 4 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...