1376 search results - page 48 / 276 » Searching Trees: An Essay |
COLING
1996
15 years 1 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
104
click to vote
SODA
2008
ACM
15 years 1 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 [...
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
PKDD
2007
Springer
15 years 6 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
ECAI
1998
Springer
15 years 4 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...