Organization and maintenance of large ordered indexes
From MaRDI portal
Publication:2549238
DOI10.1007/BF00288683zbMath0226.68008OpenAlexW2901608006WikidataQ56039646 ScholiaQ56039646MaRDI QIDQ2549238
Publication date: 1971
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288683
Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Worst-case efficient external-memory priority queues, How to update a balanced binary tree with a constant number of rotations, Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization, A new algorithm for the construction of optimal B-trees, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep, GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU, A rigorous analysis of concurrent operations on B-trees, Unnamed Item, A verified implementation of \(\mathrm{B}^+\)-trees in Isabelle/HOL, Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines, A SEMANTIC INDEX STRUCTURE FOR MULTIMEDIA RETRIEVAL, Reasoning about B+ Trees with Operational Semantics and Separation Logic, AVL trees with relaxed balance, A process-calculus analysis of concurrent operations on B-trees, Efficient rebalancing of chromatic search trees, Amortization results for chromatic search trees, with an application to priority queues, Belga B-trees, I/O-efficient point location using persistent B-trees, External memory planar point location with logarithmic updates, SORT ORDER PROBLEMS IN RELATIONAL DATABASES, VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE, Unnamed Item, \(B\)-trees with lazy parent split, Optimal multiple key hashing files for orthogonal range queries, On the construction of classes of suffix trees for square matrices: Algorithms and applications, I/O-efficient dynamic planar point location, A B\(^+\)-tree based indexing technique for fuzzy numerical data, Efficient rebalancing of chromatic search trees, Cache-Oblivious Iterated Predecessor Queries via Range Coalescing, Cost-optimal parallel algorithms for constructing B-trees, Insertion anomalies and the justification for 4NF in relational databases, A unified access bound on comparison-based dynamic dictionaries, Modeling B-tree insertion activity, Efficient Construction of Near-Optimal Binary and Multiway Search Trees, Fault Tolerant External Memory Algorithms, When can we sort in \(o(n\log n)\) time?, Space saving generalization of \(B\)-trees with \(2/3\) utilization, Modeling splits in file structures, Expected behaviour of \(B^+\)-trees under random insertions, Amortized Computational Complexity, Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results, HCB-tree: a height compressed B-tree for parallel processing, Range searching in multidimensional databases using navigation metadata, Making data structures persistent, Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm, Space-efficient B trees via load-balancing, Maintaining range trees in secondary memory. Part I: Partitions, Efficient splitting and merging algorithms for order decomposable problems, Unsafe operations in B-trees, Worst-case analysis of the set-union problem with extended backtracking, Randomized search trees, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep, Amortization results for chromatic search trees, with an application to priority queues, Deletion without rebalancing in multiway search trees, ISB-tree: A new indexing scheme with efficient expected behaviour, On the correctness of a lock-free compression-based elastic mechanism for a hash trie design, Optimum multiway search trees, Red-black trees with constant update time, I/O efficient dynamic data structures for longest prefix queries, Relaxed multi-way trees with group updates., Binary search trees in secondary memory, Fast decoding algorithms for variable-lengths codes, Fully persistent B-trees, The cost of cache-oblivious searching, Binary search trees of almost optimal height, Multidimensional B-trees: Analysis of dynamic behavior, Dynamic maintenance of directed hypergraphs, A new data structure for representing sorted lists, Skip lift: a probabilistic alternative to red-black trees, Signature files: An integrated access method for text and attributes, suitable for optical disk storage, Relaxed avl trees, main-memory databases and concurrency, Stratified balanced search trees, I/O-efficient algorithms for computing planar geometric spanners, Self-adjusting multi-way search trees, Skip Lift: A Probabilistic Alternative to Red-Black Trees, An assertional proof of red-black trees using Dafny, Self‐adjusting trees in practice for large text collections, \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half, Unbalanced multiway trees improved by partial expansions, A robust and efficient spatial data structure. The nested interpolation- based grid file, Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying, Signatures: definitions, operators and applications to fuzzy modelling, Cache-oblivious range reporting with optimal queries requires superlinear space, On sorting, heaps, and minimum spanning trees, Global parallel index for multi-processors database systems, Virtuelle Z-Baum-Technik, Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model, B-trees in a system with multiple users, ASA-graphs for efficient data representation and processing, Concurrent operations on \(B^ *\)-trees with overtaking, A general approach for cache-oblivious range reporting and approximate range counting, Optimal \(\alpha -\beta\)-strees with capacity constraint, On random 2-3 trees, Optimal \(\alpha -\beta\) trees with capacity constraint, Height balanced 2-3 trees, Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees, Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra, The design and implementation of a scheme for large ordered indices, Cache-oblivious R-trees, The SB-tree: An index-sequential structure for high-performance sequential access, INDEXING FUZZY NUMERICAL DATA WITH A B+ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS, Transforming unbalanced multiway trees into a practical external data structure, Operation-specific locking in balanced structures, Symmetric binary B-trees: Data structure and maintenance algorithms, A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata, Fusion trees can be implemented with \(AC^0\) instructions only, Heaps and heapsort on secondary storage, A comparative study of 2-3 trees and AVL trees, Insertion-safeness in balanced trees, A distributed indexing method for timeline similarity query, Integrated concurrency control in shared B-trees, Interpolation-based index maintenance, Optimal multiway search trees for variable size keys, Efficient searching with linear constraints, Purely top-down updating algorithms for stratified search trees, Some average performance measures for the B-tree, On the existence and construction of non-extreme \((a,b)\)-trees., \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm, On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation, A comparison of iterative and defined classes of search trees, On generating B-trees with constant average delay and in lexicographic order, Surpassing the information theoretic bound with fusion trees
Cites Work
