785 search results - page 5 / 157 » Binary Join Trees |
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
184
Voted
ICDE
2003
IEEE
15 years 11 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...
ICIP
1999
IEEE
15 years 1 months ago
1999
IEEE
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
VLDB
1992
ACM
15 years 1 months ago
1992
ACM
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...