scientific article
From MaRDI portal
Publication:3853109
zbMath0419.68034MaRDI QIDQ3853109
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (61)
\(B\)-trees with lazy parent split ⋮ Restricted rotation distance between k-ary trees ⋮ Towards optimal two-dimensional indexing for constraint databases ⋮ I/O-efficient dynamic planar point location ⋮ Optimal external memory planar point enclosure ⋮ A B\(^+\)-tree based indexing technique for fuzzy numerical data ⋮ Worst-case efficient external-memory priority queues ⋮ Cost-optimal parallel algorithms for constructing B-trees ⋮ Execution time analysis of a top-down R-tree construction algorithm ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep ⋮ Topology B-trees and their applications ⋮ Modeling B-tree insertion activity ⋮ Space saving generalization of \(B\)-trees with \(2/3\) utilization ⋮ Variance of storage requirements for B+-trees ⋮ Modeling splits in file structures ⋮ Expected behaviour of \(B^+\)-trees under random insertions ⋮ Space-efficient B trees via load-balancing ⋮ Maintaining range trees in secondary memory. Part I: Partitions ⋮ Unsafe operations in B-trees ⋮ The RABTree and RAB\(^-\)Tree: lean index structures for snapshot access in transaction-time databases ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep ⋮ Deletion without rebalancing in multiway search trees ⋮ ISB-tree: A new indexing scheme with efficient expected behaviour ⋮ Multilevel length-based classified index table for IP lookups and updates ⋮ On the correctness of a lock-free compression-based elastic mechanism for a hash trie design ⋮ A verified implementation of \(\mathrm{B}^+\)-trees in Isabelle/HOL ⋮ MDOPE: efficient multi-dimensional data order preserving encryption scheme ⋮ Balancing \(m\)-ary search trees with compressions on the fringe ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ Transitive closure algorithms for very large databases ⋮ Fully persistent B-trees ⋮ Distributing a \(B^+\)-tree in a loosely coupled environment ⋮ The cost of cache-oblivious searching ⋮ Multidimensional B-trees: Analysis of dynamic behavior ⋮ On the allocation of binary trees to secondary storage ⋮ Distance-based index structures for fast similarity search ⋮ Performance analysis of file organizations that use multi-bucket data leaves ⋮ Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Reasoning about B+ Trees with Operational Semantics and Separation Logic ⋮ On indexing evidential data ⋮ Global parallel index for multi-processors database systems ⋮ A deterministic skip list for \(k\)-dimensional range search ⋮ ASA-graphs for efficient data representation and processing ⋮ Index structures for fast similarity search for real vectors. II ⋮ Enhancing the \(B^{+}\)-tree by dynamic node popularity caching ⋮ I/O-efficient point location using persistent B-trees ⋮ Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra ⋮ Cache-oblivious R-trees ⋮ The SB-tree: An index-sequential structure for high-performance sequential access ⋮ External memory planar point location with logarithmic updates ⋮ Dynamic dictionary matching in external memory ⋮ Operation-specific locking in balanced structures ⋮ A comparative study of 2-3 trees and AVL trees ⋮ Insertion-safeness in balanced trees ⋮ A distributed indexing method for timeline similarity query ⋮ Efficient searching with linear constraints ⋮ On the average internal path length of m-ary search trees ⋮ Investigations on Path Indexing for Graph Databases ⋮ On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation ⋮ RAM-Efficient External Memory Sorting
This page was built for publication:
