383 search results - page 3 / 77 » Join operations in temporal databases |
ICICS
2009
Springer
14 years 9 days ago
2009
Springer
Privacy-preserving SQL computation in distributed relational database is one of important applications of secure multiparty computation. In contrast with comparatively more works o...
HPCC
2007
Springer
13 years 12 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
ICDE
2002
IEEE
14 years 7 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...
ICDE
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper introduces the hash-merge join algorithm (HMJ, for short); a new non-blocking join algorithm that deals with data items from remote sources via unpredictable, slow, or ...
DASFAA
2010
IEEE
13 years 11 months ago
2010
IEEE
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...