Sciweavers

14 search results - page 2 / 3
» Cache-oblivious nested-loop joins
Sort
View
ICDE
2003
IEEE
133views Database» more  ICDE 2003»
14 years 6 months ago
Evaluating Window Joins over Unbounded Streams
We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...
Jaewoo Kang, Jeffrey F. Naughton, Stratis Viglas
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
13 years 10 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...
VLDB
1990
ACM
104views Database» more  VLDB 1990»
13 years 9 months ago
Hash-Based Join Algorithms for Multiprocessor Computers
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
Hongjun Lu, Kian-Lee Tan, Ming-Chien Shan
HPCC
2007
Springer
13 years 11 months ago
Parallel Database Sort and Join Operations Revisited on Grids
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...
Werner Mach, Erich Schikuta
DAMON
2009
Springer
13 years 11 months ago
Join processing for flash SSDs: remembering past lessons
Flash solid state drives (SSDs) provide an attractive alternative to traditional magnetic hard disk drives (HDDs) for DBMS applications. Naturally there is substantial interest in...
Jaeyoung Do, Jignesh M. Patel