Publication:3853109
From MaRDI portal
zbMath0419.68034MaRDI QIDQ3853109
Publication date: 1979
Related Items
Skip trees, an alternative data structure to skip lists in a concurrent approach, I/O-efficient point location using persistent B-trees, External memory planar point location with logarithmic updates, ISB-tree: A new indexing scheme with efficient expected behaviour, The cost of cache-oblivious searching, Global parallel index for multi-processors database systems, Optimal external memory planar point enclosure, A B\(^+\)-tree based indexing technique for fuzzy numerical data, Execution time analysis of a top-down R-tree construction algorithm, Distributing a \(B^+\)-tree in a loosely coupled environment, Performance analysis of file organizations that use multi-bucket data leaves, Enhancing the \(B^{+}\)-tree by dynamic node popularity caching, Cache-oblivious R-trees, On the average internal path length of m-ary search trees, Modeling B-tree insertion activity, Modeling splits in file structures, Expected behaviour of \(B^+\)-trees under random insertions, Maintaining range trees in secondary memory. Part I: Partitions, Unsafe operations in B-trees, Multidimensional B-trees: Analysis of dynamic behavior, On the allocation of binary trees to secondary storage, Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra, Dynamic dictionary matching in external memory, \(B\)-trees with lazy parent split, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep, Efficient searching with linear constraints, A deterministic skip list for \(k\)-dimensional range search, The SB-tree: An index-sequential structure for high-performance sequential access, Operation-specific locking in balanced structures, Insertion-safeness in balanced trees, On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation, I/O-efficient dynamic planar point location, Cost-optimal parallel algorithms for constructing B-trees, Space saving generalization of \(B\)-trees with \(2/3\) utilization, Variance of storage requirements for B+-trees, A comparative study of 2-3 trees and AVL trees
