785 search results - page 48 / 157 » Binary Join Trees |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
202
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
101
click to vote
VLDB
1999
ACM
15 years 2 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
BXML
2004
14 years 11 months ago
2004
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...