Results 1  10
of
472,186
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 431 (18 self)
 Add to MetaCart
The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have
Generalized Search Trees for Database Systems
 IN PROC. 21 ST INTERNATIONAL CONFERENCE ON VLDB
, 1995
"... This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensible set of queries and data types. The GiST allows new data types to be indexed in a manner supporting queries natural to the types; this is in contrast to previous work on tree extensibility which only ..."
Abstract

Cited by 237 (18 self)
 Add to MetaCart
This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensible set of queries and data types. The GiST allows new data types to be indexed in a manner supporting queries natural to the types; this is in contrast to previous work on tree extensibility which
On Optimal Binary Search Trees
"... We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary search trees. The obtained upper bound improve on p ..."
Abstract
 Add to MetaCart
We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary search trees. The obtained upper bound improve
Constraint Search Trees
 In L. Naish (Ed.), Proc. Int. Conf. on Logic Programming (CLP'97
, 1997
"... This paper defines constraint search trees, a general tree data structure for storing and accessing items with constraints as keys. Constraint search trees can mimic binary search trees, radix search trees, kd trees, Rtrees and many other kinds of search trees. The unifying framework of constraint ..."
Abstract
 Add to MetaCart
This paper defines constraint search trees, a general tree data structure for storing and accessing items with constraints as keys. Constraint search trees can mimic binary search trees, radix search trees, kd trees, Rtrees and many other kinds of search trees. The unifying framework
Planar Point Location Using Persistent Search Trees
, 1986
"... A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, given a sequence of points, the polygon containing each point can be determined quickly online. Several ..."
Abstract

Cited by 177 (4 self)
 Add to MetaCart
line. Several ways of solving this problem in O(log n) query time and O(n) space are known, but they are all rather complicated. We propose a simple O(log f&querytime, O(n)space solution, using persistent search trees. A persistent search tree differs from an ordinary search tree in that after
Estimating Search Tree Size
 In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI ’06
, 2006
"... We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the unexplored part of the search tree will be simil ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the unexplored part of the search tree
Randomized Binary Search Trees
 Journal of the ACM
, 1997
"... In this paper we present randomized algorithms over binary search trees such that: a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; b) the deletion of any key from a random binary search tree results in a random binary s ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
In this paper we present randomized algorithms over binary search trees such that: a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; b) the deletion of any key from a random binary search tree results in a random binary
DIGITAL SEARCH TREES REVISITED*
"... Abstract. Several algorithms have been proposed which build search trees using digital properties of the search keys. A general approach to the study of the average case performance of such algorithms is discussed, with particular attention to the analysis of the digital search tree structures of Co ..."
Abstract
 Add to MetaCart
Abstract. Several algorithms have been proposed which build search trees using digital properties of the search keys. A general approach to the study of the average case performance of such algorithms is discussed, with particular attention to the analysis of the digital search tree structures
Searching Trees: an Essay
"... We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic.
Treemaps for SearchTree Visualization
, 2002
"... Large AlphaBeta search trees generated by gameplaying programs are hard to represent graphically. This paper describes how treemaps can be applied to the visualization of these trees. The principle of treemaps is presented, and difficulties of its application to the particular structure of search ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Large AlphaBeta search trees generated by gameplaying programs are hard to represent graphically. This paper describes how treemaps can be applied to the visualization of these trees. The principle of treemaps is presented, and difficulties of its application to the particular structure of search
Results 1  10
of
472,186