59 search results - page 3 / 12 » Finger Search Trees with Constant Insertion Time |
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
COCOON
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
FOCS
1989
IEEE
13 years 11 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...