The following pages link to (Q3853109):
Displaying 50 items.
- Towards optimal two-dimensional indexing for constraint databases (Q287206) (← links)
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Global parallel index for multi-processors database systems (Q707311) (← links)
- Index structures for fast similarity search for real vectors. II (Q722065) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- A B\(^+\)-tree based indexing technique for fuzzy numerical data (Q835150) (← links)
- Execution time analysis of a top-down R-tree construction algorithm (Q845880) (← links)
- Distributing a \(B^+\)-tree in a loosely coupled environment (Q910190) (← links)
- Performance analysis of file organizations that use multi-bucket data leaves (Q918665) (← links)
- Enhancing the \(B^{+}\)-tree by dynamic node popularity caching (Q991779) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- On the average internal path length of m-ary search trees (Q1060015) (← links)
- Modeling B-tree insertion activity (Q1099971) (← links)
- Modeling splits in file structures (Q1105353) (← links)
- Expected behaviour of \(B^+\)-trees under random insertions (Q1105354) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- Unsafe operations in B-trees (Q1123655) (← links)
- Multidimensional B-trees: Analysis of dynamic behavior (Q1157907) (← links)
- On the allocation of binary trees to secondary storage (Q1157927) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- \(B\)-trees with lazy parent split (Q1331024) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep (Q1384210) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- The SB-tree: An index-sequential structure for high-performance sequential access (Q1813013) (← links)
- Operation-specific locking in balanced structures (Q1823659) (← links)
- Insertion-safeness in balanced trees (Q1838043) (← links)
- On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation (Q1857099) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Cost-optimal parallel algorithms for constructing B-trees (Q1894244) (← links)
- Space saving generalization of \(B\)-trees with \(2/3\) utilization (Q1900545) (← links)
- Variance of storage requirements for B+-trees (Q1902301) (← links)
- On indexing evidential data (Q1999579) (← links)
- ASA-graphs for efficient data representation and processing (Q2023584) (← links)
- Space-efficient B trees via load-balancing (Q2169966) (← links)
- Multilevel length-based classified index table for IP lookups and updates (Q2186815) (← links)
- Fully persistent B-trees (Q2202015) (← links)
- A distributed indexing method for timeline similarity query (Q2331440) (← links)
- The RABTree and RAB\(^-\)Tree: lean index structures for snapshot access in transaction-time databases (Q2408740) (← links)
- On the correctness of a lock-free compression-based elastic mechanism for a hash trie design (Q2676227) (← links)
- RAM-Efficient External Memory Sorting (Q2872113) (← links)
- Deletion without rebalancing in multiway search trees (Q2943570) (← links)
- A comparative study of 2-3 trees and AVL trees (Q3659162) (← links)
- Skip trees, an alternative data structure to skip lists in a concurrent approach (Q4361577) (← links)
- Worst-case efficient external-memory priority queues (Q5054847) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep (Q5057447) (← links)
