This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms for Asynchronous Parallel Processing of Object-Oriented Databases
June 1995 (vol. 7 no. 3)
pp. 487-504

Abstract—Management of large quantities of complex data is essential in many advanced application areas. Object-oriented (OO) database management systems have been developed to effectively model and process the complex domain knowledge. They have been shown to outperform some existing relational systems. The existing implementations of OO database management systems attempt to improve the efficiency of OO queries by explicitly capturing the relationships among objects. However, the execution of complex queries involving the retrieval of objects from many classes and relationships among them causes the existing systems to operate inefficiently. In this paper, we present parallel algorithms for the processing of queries against a large OO database. The algorithms are based on a closed model of query processing using pattern-based access instead of the conventional value-based access. During processing, the algorithms avoid the execution of time-consuming join operations by making use of the explicitly stored object associations. Generation of large quantities of temporary data is avoided by marking objects using their identifiers and by employing a two-phase query processing strategy. A query is processed by concurrent multiple waves, thereby improving parallelism and avoiding the complexities introduced in their sequential implementation. The correctness and the performance of the parallel algorithms have been tested and analyzed by running parallel programs on a 32-node Transputer based parallel machine designed and developed at the IBM Research Center at Yorktown Heights, New York. Benchmark queries of different semantic complexities are generated, and their performance is analyzed for various data and query parameters.

[1] A.M. Alashqur,“A query model and query and knowledge definition languages for object-orienteddatabases,” PhD dissertation, Dept. of Electrical Engineering,Univ. of Florida, 1989.
[2] M. Numao and S. Morishita, "Cooperative Scheduling and its Application to Steelmaking Processes," IEEE Trans. Industrial Electronics, Vol. 38, No. 2, 1991, pp. 150-155.
[3] D. Batory and W. Kim, "Modeling Concepts for VLSI CAD Objects," ACM Trans. Database Systems, vol. 10, no. 3, pp. 322-346, Sept. 1985.
[4] L. Bic and L.R. Hartmann,“Simulated performance of a data-driven database machine,” J. Parallel and Distributed Computing, vol. 3, no. 1, pp. 1-22, Mar. 1986.
[5] L. Bic, and L.R. Hartmann,“AGM: A dataflow database machine,” ACM Trans. Database Systems, vol. 14, no. 1, pp. 114-146, Mar. 1989.
[6] M. Carey,D. DeWitt,D. Frank,G. Graefe,J. Richardson,E. Shekita, and M. Muralikrishna,"The architecture of the EXODUS extensible DBMS," Proc. Int'l Workshop Object-Oriented Database Systems, Sept. 1986.
[7] G.P. Copeland and S. Khoshafian, “A Decomposition Storage Model,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 268-279, May 1985.
[8] O. Dexu et al., "The Story of O2," IEEE Trans. Knowledge and Data Eng., pp. 91-108, Mar. 1990.
[9] D. DeWitt, D. Maier, P. Futtersack, and F. Velez, "A Study of Three Alternative Workstation-Server Architectures for Object-Oriented Database Systems," Proc. 16th Very Large Data Bases Conf., pp. 107-121,Brisbane, Australia, 1990.
[10] M. Hammer and D. McLeod, "Data Base Description with SDM: A Semantic Data Base Model," ACM Trans. Database Systems, vol. 6, no. 3, 1981.
[11] Advanced Database Machine Architecture, D.K. Hsiao, ed., Engelwood Cliffs, N.J.: Prentice Hall, 1983.
[12] S.E. Hudson and R. King, "CACTIS: A Self-Adaptive, Concurrent Implementation of an Object-Oriented Database Management System," Trans. Database Systems, vol. 14, pp. 291-321, Mar. 1988.
[13] R. Hull and R. King, “Semantic Database Modelling: Survey, Applications, and Research Issues,” Computing Surveys, vol. 19, no. 3, pp. 201-260, ACM, Sept. 1987.
[14] W. Kin,“A model of queries for object-oriented databases,” Proc. 15th Int’l Conf. Very Large Databases, pp. 423-432, 1989.
[15] K.-C. Kim, “Parallelism in Object-Oriented Query Processing,” Proc. Sixth Int'l Conf. Data Eng., pp. 209–217, Feb. 1990.
[16] W. Kim, J. Garza, N. Ballou, and D. Woelk, "Architecture of the Orion Next-Generation Database System," IEEE Trans. Knowledge and Data Eng., vol. 2, no. 1, pp. 109-124 Mar. 1990.
[17] C. Lee, H. Lam, and S.Y.W. Su, “An Object Flow Computer for Database Applications: Design and Performance Evaluation,” J. Parallel and Distributed Computing, vol. 17, pp. 298–314, 1993.
[18] D. Maier et al., "Development of an object-oriented DBMS," Proc. Conf. Object-Oriented Programming Systems, Languages, and Applications, pp. 472-482.New York: ACM, Sept. 1986.
[19] E. Ozkarahan, Database Machines and Database Management. Prentice Hall, 1986.
[20] D.G. Shea,R.C. Booth,D.H. Brown,M.E. Giampapa,G.R. Irwin,T.T. Murakami,F.T. Tong,P.R. Varker,W.W. Wilcke,D.J. Zukowski,A.K. Thakore,, and S.Y.W. Su,“Monitoring and simulation of processing strategies for large knowledge bases onthe IBM Victor multiprocessor,” Proc. Second Conf. North Am. Transputer Users Group,Durham, N.C., pp. 11-26, Oct.18-19, 1989.
[21] M. Stonebraker,L. Row, and M. Hirohama,"The implementation of POSTGRES," IEEE Trans. Knowledge and Data Engineering, vol. 2, no. 7, pp. 125-142, Mar. 1990.
[22] S.Y.W. Su,Database Computers: Principles, Architectures, and Techniques,New York: McGraw-Hill, 1988.
[23] S.Y.W. Su,V. Krishnamurthy,, and H. Lam,“An object-oriented semantic association model (OSAM*),” Industrial Eng. and Manufacturing: Theoretical Issues and Applications, S. Kumar, A.L. Soyster, and R.L. Kashyap, eds., American Institute of Industrial Engineeering, 1989.
[24] A.K. Thakore,S.Y.W. Su,H. Lam,, and D.G. Shea,“Asynchronous parallel processing of object bases using multiple wavefronts,” Proc. 1990 Int’l Conf. Parallel Processing,St. Charles, Ill., vol. 1, pp. 127-135, Aug. 1990.
[25] A.K. Thakore,“Data distribution and algorithms for asynchronous parallel processing ofobject-oriented knowledge bases,” PhD dissertation, Dept. of Electrical Engineering, Univ. of Florida, Dec. 1990.
[26] A.K. Thakore and S.Y.W. Su, “Performance Analysis of Parallel Object-Oriented Query Processing Algorithms,” Distributed and Parallel Databases, vol. 2, no. 1, pp. 59–100, 1994.
[27] A.K. Thakore and S.Y.W. Su,“Greedy heuristic mapping of object-oriented semantic schemas onto nodes of aregularly and homogeneously connected parallel architecture,” Proc. 1993 Object-Oriented Simulation Conf.,”La Jolla, Calif., pp. 107-112, Jan. 1993.
[28] P. Valduriez, “Join Indices,” ACM Trans. Database Systems, vol. 12, no. 2, 1987.
[29] K. Wilkinson,P. Lyngbæk,, and W. Hasan,“The IRIS architecture and implementation,” IEEE Trans. Knowledge and Data Eng., vol. 2, no. 1, pp. 63-75, Mar. 1990.

Index Terms:
Asynchronous, object-oriented databases, parallel algorithms, performance evaluation, query processing.
Citation:
Arun K. Thakore, Stanley Y.W. Su, Herman X. Lam, "Algorithms for Asynchronous Parallel Processing of Object-Oriented Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 3, pp. 487-504, June 1995, doi:10.1109/69.390252
Usage of this product signifies your acceptance of the Terms of Use.