Algorithms for creating indexes for very large tables without quiescing updates
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Amortization results for chromatic search trees, with an application to priority queues
Journal of Computer and System Sciences
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
Hybrid Index Organizations for Text Databases
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Performance of On-Line Index Construction Algorithms
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Relaxed Balance through Standard Rotations
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Concurrency and Recovery in Full-Text Indexing
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Design of a signature file method that accounts for non-uniform occurrence and query frequencies
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Amortized Complexity of Bulk Updates in AVL-Trees
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
| Hi-index | 0.00 |
If several keys are inserted into a search structure (or deleted from it) at the same time, it is advantageous to sort the keys and perform a group update that brings the keys into the structure as a single transaction. A typical application of group updates is full-text indexing for document databases. Then the words of an inserted or deleted document, together with occurrence information, form the group to be inserted into or deleted from the full-text index. In the present paper a new group update algorithm is presented for red-black search trees. The algorithm is designed in such a way that the concurrent use of the structure is possible.