Abstract
In this investigation, we propose a new approach for bulk insert under linear hash organization, which is one of the known problems of dynamic hash techniques. Generally Dynamic Hash allows us to adjust the size of hash space dynamically according to the amount of data so that we obtain the nice time/space efficiency of the hash space. One of the typical techniques is linear hash where we can keep the hash space size linearly in terms of the amount of data. However, the technique doesn’t always provide us with suitable properties, especially we face to severe deficiencies at bulk insert/delete operations, because the successive operations cause heavy manipulation (one extension at each operation) so that huge amount of I/O access happen.
Here in this work, we propose a new approach for bulk insert (delete) to relieve the thrashing situation and to reduce total I/O access. We discuss some experimental results and show how well the approach works.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Litwin, W.: Linear hashing - A New Tool for File and Table Addressing. In: VLDB (1980)
Litwin, W., Neimat, M.-A., Schneider, D.: LH* - Linear Hashing for Distributed Files. ACM SIGMOD, 327–336 (1993)
Matsumoto, M., Nishimura, T.: Mersenne twister – a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulations 8(1), 3–30 (1998)
Yasuda, K., Miura, T.: Distributed Processes on Tree Hash, In: COMPSAC (2006)
Rafiei, D., Hu, C.: Bulk Loading a Linear Hash File, DaWaK, pp.23-32 (2006)
Rathi, A., Lu, H., Hedrick, G.E.: Performance Comparison of Extendible Hashing and Linear Hashing Techniques. In: ACM SIGSMALL/PC Symposium on Small Systems (1990)
Severance, C., Paramanik, S., Wolberg, P.: Distributed Linear Hashing and Parallel Projection in Main Memory Databases, In: VLDB (1990)
Shaffer, C.A.: Practical Introduction to Data Structures and Algorithms (Java Edition). Prentice Hall, Englewood Cliffs (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Narata, S., Miura, T. (2011). On Inserting Bulk Data for Linear Hash Files. In: Fong, S. (eds) Networked Digital Technologies. NDT 2011. Communications in Computer and Information Science, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22185-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-22185-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22184-2
Online ISBN: 978-3-642-22185-9
eBook Packages: Computer ScienceComputer Science (R0)