This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Acceleration of Nonnumeric Operations Using Hardware Support for the Ordered Table Hashing Algorithms
September 2002 (vol. 51 no. 9)
pp. 1026-1040

Abstract—This paper introduces a new approach to acceleration of nonnumeric, database, and information retrieval operations. While traditional techniques accelerate the most time-critical high-level software constructs, we propose novel low-level primitives and demonstrate how these primitives improve database operations. Radix sorting, hashing, and bit-vector operations are used to develop a new class of nonnumeric algorithms—OTHER (Ordered Table Hashing and Radix sort algorithms)—based on low-level hashing operations Init, Mark, and Scan. We have proposed and evaluated two hardware accelerators for OTHER algorithms. It is shown that a low complexity hardware support (less than 10K transistors) can significantly improve the performance of nonnumeric operations.

[1] L.L. Miller, A.R. Hurson, and S.H. Pakzad, Parallel Architectures for Data/Knowledge Based Systems, IEEE Tutorial. IEEE CS Press, 1995.
[2] C.V. Ramamoorthy, J.L. Turner, and B.J. Wah, “A Design of a Fast Cellular Associative Memory for Ordered Retrieval,” IEEE Trans. Computers, vol. 27, no. 9, pp. 800-815, Sept. 1978.
[3] C. Lee, S.Y. Su, and H. Lam, “Algorithms for Sorting and Sort-Based Database Operations Using a Special-Function Unit,” Database Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, eds., pp. 103-116, Kluwer Academic, 1988.
[4] K.C. Lee, T.M. Hickey, V.W. Mak, and G.E. Herman, “VLSI Accelerators for Large Database Systems,” IEEE Micro, pp. 8-20, Dec. 1991.
[5] E. Jovanov, D. Starcevic, T. Aleksic, and Z. Stojkov, “Hardware Implementation of Some DBMS functions Using SPR,” Proc. 25th Hawaii Int'l Conf. System Sciences, vol. 1, pp. 328-337, Jan. 1992.
[6] M. Kitsuregawa, S. Hirano, M. Harada, M. Nakamura, and M. Takagi, “The Super Database Computer (SDC): System Architecture, Algorithm, and Preliminary Evaluation,” Proc. 25th Hawaii Int'l Conf. System Sciences, vol. 1, pp. 308-319, Jan. 1992.
[7] B. Parhami and D.M. Kwai, “Data Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 1, pp. 23-28, Jan. 1999.
[8] E. Babb, “Implementing a Relational Database by Means of Specialized Hardware,” ACM Trans. Database Systems, vol. 4, no. 1, pp. 1-29, Mar. 1979.
[9] U. Inoue, T. Satoh, H. Hayami, H. Takeda, T. Nakamura, and H. Fukuoka, “RINDA: A Relational Database Processor with Hardware Specialized for Searching and Sorting,” IEEE Micro, pp. 61-70, Dec. 1991.
[10] M. Kitsuregawa, W. Yang, T. Suzuki, and M. Takagi, “Design and Implementation of High Speed Pipeline Merge Sorter with Run Length Tuning Mechanism,” Database Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, eds., pp. 89-102, Kluwer Academic, 1987.
[11] D.H. Andrews et al., “The AS/400 Alternative,” ADM Inc., 1990.
[12] 80386 Programmer's Reference Manual. Santa Clara, Calif.: Intel, 1986.
[13] E. Jovanov, “The Architecture of Accelerator for Database Operations,” PhD thesis, School of Electrical Eng., Univ. of Belgrade, Yugoslavia, 1993.
[14] R.D. Sloan, “A Practical Implementation of the Database Machine—Teradata DBC/1012,” Proc. 25th Hawaii Int'l Conf. System Sciences, vol. 1, pp. 320-327, 1992.
[15] W.D. Maurer and T.G. Lewis, “Hash Table Methods,” ACM Computing Surveys, vol. 7, no. 1, pp. 5-19, Mar. 1975.
[16] E. Isaac and R. Singleton, “Sorting by Address Calculation,” J. ACM, vol. 3, pp. 169-174, 1956.
[17] M.D. MacLaren, “Internal Sorting by Radix Plus Sifting,” J. ACM, vol. 13, no. 3, pp. 404-411, July 1966.
[18] T. Aleksic, Internal Reports DBC/1-DBC/15, School of Electrical Eng., Univ. of Belgrade, Yugoslavia, 1986.
[19] E. Jovanov, T. Aleksic, Z. Stojkov, and D. Starcevic, “A Sorting Processor for Microcomputers,” Microprocessing and Microprogramming, vol. 23, nos. 1-5, pp. 273-278, 1988.
[20] Z. Stojkov, “An Implementation of Relational Algebra Operations,” MS thesis, School of Electrical Eng., Univ. of Belgrade, Yugoslavia, 1993.
[21] M.V. Ramakrishna, E. Fu, and E. Bahcekapili, "Efficient Hardware Hashing Functions for High Performance Computers," IEEE Trans. Computers, vol. 46, no. 12, pp. 1,378-1,381, Dec. 1997.
[22] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[23] W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1. New York: John Wiley&Sons, 1968.
[24] L. Raschid, T. Fei, H. Lam, and Y.W. Stanley, “A Special Function Unit for Sorting and Sort-Based Database Operations,” IEEE Trans. Computers, vol. 35, no. 12, pp. 1071-1077, Dec. 1986.
[25] C.J. Date, An Introduction to Database Systems. Addison-Wesley, 1995.
[26] C.J. Date and H. Darwen, A Guide to SQL Standard. Reading, Mass.: Addison-Wesley, 1993.
[27] B.H. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Comm. ACM, vol. 13, no. 7, pp. 422-426, July 1970.
[28] J.K. Mullin, “Optimal Semijoins for Distributed Database Systems,” IEEE Trans. Software Eng., vol. 16, no. 5, pp. 558-560, May 1990.
[29] J.L. Bentley and M.D. McIlroy, “Engineering a Sort Function,” Software Practice and Experience, vol. 23, no. 11, pp. 1249-1265, Nov. 1993.
[30] J. Henessy, N. Jouppi, S. Przybylski, C. Rowen, and T. Gross, “Design of a High Performance VLSI Processor,” Technical Report no. 236, Stanford Univ., Palo Alto, Calif., Feb. 1983.
[31] http://www.ece.uah.edu/~jovan/equipmentAlphaau-series.htm , 2002.
[32] A. Eustace and A. Srivastava, “ATOM: A Flexible Interface for Building High Performance Program Analysis Tools,” DEC WRL Technical Note TN-44, July 1994.
[33] H. Boral and D.J. DeWitt, “A Methodology for Database Performance Evaluation,” Proc. Fourth Int'l Workshop Database Machines, pp. 166-187, 1984.
[34] D.J. DeWitt, S. Ghandeharizadeh, D. Schneider, R. Jauhari, M. Muralikrishna, and A. Sharma, “A Single User Evaluation of the Gamma Database Machine,” Database Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, eds., pp. 370-386, Kluwer Academic, 1987.
[35] P.S. Yu,M.-S. Chen,H. Heiss,, and S.H. Lee,“On workload characterization of relational database environments,” IEEE Trans on Software Engineering, vol. 18, no. 4, pp. 347-355, Apr. 1992.

Index Terms:
Database operations, hashing, sorting, searching, nonnumeric processing, hardware accelerators.
Citation:
Emil Jovanov, Veljko Milutinovic, Ali R. Hurson, "Acceleration of Nonnumeric Operations Using Hardware Support for the Ordered Table Hashing Algorithms," IEEE Transactions on Computers, vol. 51, no. 9, pp. 1026-1040, Sept. 2002, doi:10.1109/TC.2002.1032623
Usage of this product signifies your acceptance of the Terms of Use.