This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing
February 1992 (vol. 4 no. 1)
pp. 68-82

A class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as the dynamic random-sequential access method (DRSAM) and is derived from linear hashing. A new logical to physical mapping that is based on sequential bucket allocations in hash order is proposed. With respect to previous methods, this allocation technique has the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order preserving (OPH) schemes should result in performance improvements for range queries and sequential processing; and (2) it adapts elastic buckets for the control of file growth. Under specific conditions, this approach outperforms the partial expansion method previously proposed by P.-A. Larson (1982).

[1] R. A. Baeza-Yates and P.-A. Larson, "Analysis ofB+-trees with partial expansions," Res. Rep. CS-87-04, Dep. Comput. Sci., Univ. of Waterloo, Waterloo, Ont., Canada, Feb., 1987, 20 pp.
[2] R. Bayer and E. McCreight, "Organization and maintenance of large ordered indexes,"Acta Informatica, vol. 1, pp. 173-189, 1972.
[3] P. B. Berra, S. M. Chung, and N. I. Hachem, "Computer architecture for a surrogate file to a very large data/knowledge base,"IEEE Comput. Mag., pp. 25-32, Mar. 1987.
[4] W. A. Burkhard, "Interpolated-based index maintenance,"BIT, vol. 23, pp. 274-294, 1983.
[5] W. A. Burkhard, "Index maintenance for non-uniform record distributions," inProc. ACM SIGACT-SIGMOD 3rd Symp. Principles of Database Syst., Waterloo, Ont., Canada, Apr. 2-4 1984, pp. 173-180.
[6] R. F. Deutsher, P. G. Sorenson, and J. P. Tremblay, "Distribution-dependent hashing functions and their characteristics," inACM SIGMOD Proc. Int. Conf. Management of Data, May 14-16, 1975, pp. 224-236.
[7] R. Fagan et al., "Extendible Hashing--A Fast-Access Method for Dynamic Files,"ACM Trans. Database Systems, Vol. 4, No. 3, Sept. 1979, pp. 315-344.
[8] A. K. Garg and C. S. Gotlieb, "Order preserving key transformations,"ACM Trans. Database Syst., vol. 11, no. 2, pp. 213-234, June 1986.
[9] S. P. Ghosh, "File organization: The consecutive retrieval property,"Commun. ACM, vol. 15, no. 9, pp. 802-808, Sept. 1972.
[10] S. Ghosh,Data Base Organization for Data Management, 2nd ed., Academic Press, New York, 1986.
[11] N. I. Hachem and P. B. Berra, "Back end architecture based on transformed inverted lists, A surrogate file structure for a very large data/knowledge base," inProc. 21st Hawaii Int. Conf. Syst. Sci., vol. I, Jan. 1988, pp. 10-19.
[12] N. I. Hachem, "Dynamic key-ordered file structures for the random and sequential access to very large data/knowledge bases," Ph.D. dissertation, Dep. Elec. and Comput. Eng., Syracuse Univ., Syracuse, NY, Dec. 1988.
[13] N. I. Hachem and P. B. Berra, "Key-sequential access methods for very large files derived from linear hashing," inProc. 5th Int. Conf. Data Eng., Los Angeles, CA, Feb. 7-9, 1989, pp. 305-312.
[14] A. Hutflesz, H-W. Six, and P. Widmayer, "Globally order preserving multidimensional linear hashing," inProc. Int. Conf. Data Eng., 1988, pp. 572-579.
[15] H-P. Kriegel and B. Seeger, "Multidimensional dynamic quantile hashing is very efficient for non-uniform record distributions," inProc. Int. Conf. Data Eng., 1987, pp. 10-17.
[16] P.-A. Larson, "Dynamic hashing,"BIT, vol. 18, no. 2, pp. 184-201, 1978.
[17] P. A. Larson, "Performance analysis of linear hashing with partial expansions,"ACM Trans. Database Syst., vol. 7, no. 4, pp. 566- 587, Dec. 1982.
[18] W. Litwin, "Linear hashing: A new tool for file and table addressing," inProc. Sixth Int. Conf. Very Large Databases, 1980, pp. 212-223.
[19] W. Litwin and D. B. Lomet, "A new method for fast data searches with keys,"IEEE Software, pp 16-24, Mar. 1987.
[20] D. Lomet, "Partial expansions for file organizations with an index,"ACM Trans. Database Syst., vol. 12, no. 1, pp. 65-84, 1987.
[21] D. B. Lomet, "A simple bounded disorder file organization with good performance,"ACM Trans. Database Syst., vol. 13, no. 4, pp. 525-551, Dec. 1988.
[22] J. A. Orenstein, "A dynamic hash file for random and sequential accessing," inProc. Ninth Int. Conf. Very Large Databases, 1983, pp. 132-141.
[23] K. Ramamohanarao and J. W. Lloyd, "Dynamic hashing schemes,"The Comput. J.vol. 25, no. 4, pp. 478-485, 1982.
[24] K. Ramamohanarao and R. Sacks-Davis, "Recursive linear hashing."ACM Trans. Database Syst., vol. 9, no. 3, pp. 369-391, Sept. 1984.
[25] J. T. Robinson, "Order preserving linear hashing using dynamic key statistics," inProc. 5th ACM SIGACT-SIGMOD Symp. Principles of Database Syst., 1986, pp. 91-99.

Index Terms:
order preserving access methods; very large files; linear hashing; dynamic hashing structures; dynamic random-sequential access method; physical mapping; sequential bucket allocations; range queries; sequential processing; elastic buckets; file growth; partial expansion method; file organisation
Citation:
N.I. Hachem, P.B. Berra, "New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing," IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 1, pp. 68-82, Feb. 1992, doi:10.1109/69.124898
Usage of this product signifies your acceptance of the Terms of Use.