785 search results - page 3 / 157 » Binary Join Trees |
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
KAIS
2007
13 years 10 months ago
2007
We present an adaptive load shedding approach for windowed stream joins. In contrast to the conventional approach of dropping tuples from the input streams, we explore the concept ...
ISAAC
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
UAI
1997
14 years 5 days ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
SSD
2001
Springer
14 years 3 months ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...