115 search results - page 13 / 23 » Versioning Tree Structures by Path-Merging |
VLDB
2005
ACM
14 years 4 months ago
2005
ACM
The major relational database systems have been providing XML support for several years, predominantly by mapping XML to existing concepts such as LOBs or (object-)relational tabl...
FOCS
2005
IEEE
14 years 4 months ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
TALG
2008
13 years 10 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
ISAAC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...