Skip to main content

Design and Implementation of Linear Hash Algorithm in a Nested Transaction Environment

  • Conference paper
  • First Online:
  • 433 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1677))

Abstract

In this paper, we present a design and implementation of a linear hashing algorithm in nested transaction environment to handle large amount of data. Nested transactions allow parallel execution of transactions, and handle transaction aborts, thus provides more concurrency and efficient recovery. We design a client/server model using layered system architecture. We have used object-oriented methodology in our system implementation that helps in designing and implementing the programming components independently. In our model, buckets are modeled as objects and linear hash operations are modeled as methods. These methods correspond to nested transactions and are implemented using multithreading paradigm.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Moss, J. E., Nested Transactions: An Approach to Reliable Distributed Computing, MIT Press Cambridge, Massachusetts, 1985.

    Google Scholar 

  2. Sagiv, Y., Concurrent Operations on B-trees with Overtaking, in Proceedings of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 28–37, Mar. 1985.

    Google Scholar 

  3. Lehman, P. L., Yao, S. B., Efficient Locking for Concurrent Operations on B-trees, ACM Transaction on Database Systems, 6(4): 650–670, Dec. 1981.

    Article  MATH  Google Scholar 

  4. Enbody, R. J., Du, H. C., Dynamic Hashing Schemes, ACM Computing Surveys, 20(2): 85–113, Jun. 1988.

    Article  Google Scholar 

  5. Kumar, V., Concurrency Control on Extendible Hashing, Information Processing Letters, 31(1): 35–41, April 1989.

    Article  Google Scholar 

  6. Larson, P. A., Linear Hashing with Separator: A Dynamic Hashing Scheme Achieving One-Access Retrieval, ACM Transaction on Database Systems, 13(3): 366–388, Sep. 1988.

    Article  Google Scholar 

  7. Mohan, C., Aries/LHS: A Concurrency Control and Recovery Method Using Write-Ahead logging for Hashing With Separators, in Proceedings of the 9th IEEE International Conference on Data Engineering, Vienna, Austria, Apr. 1993.

    Google Scholar 

  8. Ellis, C. S., Concurrency in Linear Hashing, ACM Transactions on Database Systems, 12(2): 195–217, Jun. 1987.

    Article  Google Scholar 

  9. Hsu, M., Tung, S. S., Yang, W.P., Concurrent Operations in Linear Hashing, Information Sciences, 51(2): 193–211, 1990.

    Article  MATH  Google Scholar 

  10. Fu, A., Kameda, T., Concurrency Control of Nested Transactions Accessing B-Trees, in Proceedings of the 8th ACM Symposium on Principles of Database Systems, pp. 270–285, 1989.

    Google Scholar 

  11. Madria, S. K., Maheshwari, S. N., Chandra, B., Formalization of a Concurrent Linear Hash Structure Algorithm Using Nested Transactions and I/O Automation Model, in Proceedings of International Workshop on Issues and Applications of Database Technology (IADT’98), Germany, July 1998.

    Google Scholar 

  12. Lynch, N., Merrit, M., Weihl, W., Fekete, A., Atomic Transactions, Morgan Kaufman Publishers, San Mateo, California, 1994.

    Google Scholar 

  13. Madria, S. K., A Study of the Concurrency Control and Recovery Algorithms in Nested Transaction Environment, The Computer Journal, 40(10), 1998.

    Google Scholar 

  14. Madria, S. K., Tubaishat M. A., An Overview of Semantic Concurrency Control in Linear Hash Structures, in Proceedings of 13th Int. Symposium on Computer and Information Systems (ISCIS’98), Turkey, Oct.1998.

    Google Scholar 

  15. Litwin, W., Neimat, M., Schneider, D., LH*-A Scalable, Distributed Data Structure, ACM Transactions on Database Systems, 21(4): 480–525, Dec. 1996.

    Article  Google Scholar 

  16. Weikum, G., Principles and Realization Strategies of Multi-level Transaction Management, ACM Transactions on Database Systems, 16(1): 132–180, 1991.

    Article  Google Scholar 

  17. Madria, S. K., Tubaishat M. A. Design and Implementation of Linear Hash Structures in Nested Transaction Environment, Technical Report, CAIS-TR-98-17, CAIS, School of Applied Science, Nanyang Technological University, Singapore, Oct. 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madria, S.K., Tubaishat, M.A., Bhargava, B. (1999). Design and Implementation of Linear Hash Algorithm in a Nested Transaction Environment. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-48309-8_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66448-2

  • Online ISBN: 978-3-540-48309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics