The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Implementing deletion in B+-trees
ACM SIGMOD Record
On-line reorganization of sparsely-populated B+-trees
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Towards effective and efficient free space management
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Asynchronous shared memory search structures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Restructuring Method for the Concurrent B+-Tree Based on Semantic Consistency
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Boolean Bounding Predicates for Spatial Access Methods
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Performance Evaluation of Lazy Deletion Methods in R-trees
Geoinformatica
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Efficient bulk deletes for multi dimensional clustered tables in DB2
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Deletion without Rebalancing in Multiway Search Trees
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A concurrent Blink-tree algorithm using a cooperative locking protocol
BNCOD'03 Proceedings of the 20th British national conference on Databases
FB-tree: a B+-tree for flash-based SSDs
Proceedings of the 15th Symposium on International Database Engineering & Applications
Privacy-Preserving search and updates for outsourced tree-structured data on untrusted servers
iTrust'05 Proceedings of the Third international conference on Trust Management
Extending SSD lifetime in database applications with page overwrites
Proceedings of the 6th International Systems and Storage Conference
Deletion without rebalancing in multiway search trees
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |