Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
ACM Transactions on Database Systems (TODS)
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
Concurrency control on extendible hashing
Information Processing Letters
Concurrency control of nested transactions accessing B-trees
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrent operations in linear hashing
Information Sciences: an International Journal
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Analysis of linear hashing revisited
Nordic Journal of Computing
Proceedings of the Ninth International Conference on Data Engineering
| Hi-index | 0.00 |
We design and implement a linear hash algorithm in nested transaction environment to handle large amount of data with increased concurrency. Nested transactions allow parallel execution of transactions, and handle transaction aborts, thus provides more concurrency and efficient recovery. We use object-oriented methodology in the implementation which helped in designing the programming components independently. In our model, buckets are modeled as objects and linear hash operations are modeled as methods. The papers contribution is novel in the sense that the system, to our knowledge, is the first to implement linear hashing in a nested transactions environment. We have build a system simulator to analyze the performance. A subtle benefit of the simulator is that it works as the real system with only minor changes.