Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Concurrency control in database structures with relaxed balance
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Proceedings of the sixteenth international conference on Very large databases
Optimization for dynamic inverted index maintenance
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
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
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
ACM Computing Surveys (CSUR)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Analysis and performance of inverted data base structures
Communications of the ACM
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
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
Efficient Algorithms for Maintenance of Large Database
Proceedings of the Fourth International Conference on Data Engineering
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Classification algorithms for NETNEWS articles
Proceedings of the eighth international conference on Information and knowledge management
Real-Time Access Control and Reservation on B-Tree IndexedData
Real-Time Systems
Relaxed multi-way trees with group updates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Novel Index Supporting High Volume Data Warehouse Insertion
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Amortized Complexity of Bulk Updates in AVL-Trees
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
The Performance of Concurrent Red-Black Tree Algorithms
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Group Updates for Red-Black Trees
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Feature Reduction and Database Maintenance in NETNEWS Classification
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Relaxed multi-way trees with group updates
Journal of Computer and System Sciences - Special issu on PODS 2001
Single and bulk updates in stratified trees: an amortized and worst-case analysis
Computer Science in Perspective
The partitioned exponential file for database storage management
The VLDB Journal — The International Journal on Very Large Data Bases
Buffering accesses to memory-resident index structures
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Main-memory operation buffering for efficient R-tree update
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Online reorganization of databases
ACM Computing Surveys (CSUR)
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
An efficient B+-tree design for main-memory database systems with strong access locality
Information Sciences: an International Journal
| Hi-index | 0.00 |
In many applications it is important to be able to insert (or delete) keys into a B-tree as a batch, instead of inserting them one by one. Moreover, it may be necessary to search the B-tree concurrently with the batch update. An example of this is a text database system supporting a newspaper house: All words (keys) of each article obtained from a news agency should be inserted at once, and, at the same time, searches for documents containing certain words should be allowed as efficiently as possible. We have designed two solutions to the problem of concurrent batch update. The first solution驴implemented in our commercial text database system驴optimizes the speed of the batch update, and the second solution optimizes the average search time during the batch update.