This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Path Dictionary: A New Access Method for Query Processing in Object-Oriented Databases
May/June 1998 (vol. 10 no. 3)
pp. 371-388

Abstract—We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and associative search, respectively, with a path dictionary and a set of attribute indexes built on top of the path dictionary. We discuss issues on indexing and query processing in object-oriented databases; describe the operations of the new mechanism; develop cost models for its storage overhead and query and update costs; and compare the new mechanism to the path index method. The result shows that the path dictionary index method is significantly better than the path index method over a wide range of parameters in terms of retrieval and update costs and that the storage overhead grows slowly with the number of indexed attributes.

[1] B. Jenq et al., "Query Processing in Distributed Orion," Proc. Int'l Conf. Extending Database Technology,Venice, Italy, pp. 169-187, Mar. 1990.
[2] E. Bertino, "An Indexing Technique for Object-Oriented Databases," Proc. Int'l Conf. Data Eng., pp. 160-170,Kobe, Japan, Apr. 1991.
[3] E. Bertino, "Optimization of Queries Using Nested Indices," Proc. Int'l Conf. Extending Database Technology, pp. 44-59,Venice, Italy, Mar. 1990.
[4] E. Bertino and P. Foscoli, "An Analytical Model of Object-Oriented Query Costs," Proc. Fifth Int'l Workshop Persistent Object Systems, pp. 241-261, 1993.
[5] E. Bertino and W. Kim, “Indexing Technique for Queries on Nested Objects,” IEEE Trans. Knowledge and Data Eng., vol. 1, no. 2, pp. 196-214, 1989.
[6] S. Choenni, E. Bertino, H.M. Blanken, and T. Chang, "On the Selection of Optimal Index Configuration in OO Databases," Proc. Int'l Conf. Data Eng., pp. 526-537,Phoenix, Ariz., Feb. 1994.
[7] Y. Ishikawa, H. Kitagawa, and N. Ohbo, "Evaluation Of Signature files as Set Access Facilities in OODBs," Proc. 1993 SIGMOD Conf., pp. 247-256,Washington, D.C., June 1993.
[8] A. Kemper and G. Moerkotte, "Advanced Query Processing in Object Bases Using Access Support Relations," Proc. Int'l Conf. Very Large Databases, pp. 290-301,Brisbane, Australia, Aug. 1990.
[9] A. Kemper and G. Moerkotte, “Access Support in Object Bases,” Proc. ACM-SIGMOD Int'l Conf. Management of Data, pp. 364-374, 1990.
[10] K. Kim, W. Kim, and A. Dale, “A Cyclic Query Processing in Object-Oriented Databases,” Proc. IEEE Int'l Conf. Data Eng., 1989.
[11] K.C. Kim, W. Kim, D. Woelk, and A. Dale, "Acyclic Query Processing in Object-Oriented DBMS," Proc. Entity-Relationship Conf.,Italy, Nov. 1988.
[12] W. Kin,“A model of queries for object-oriented databases,” Proc. 15th Int’l Conf. Very Large Databases, pp. 423-432, 1989.
[13] W. Kim, K.C. Kim, and A. Dale, "Indexing Techniques for Object-Oriented Databases," W. Kim and F. Lochovsky, eds., Object-Oriented Concepts, Databases, and Applications, pp. 371-394, Addison-Wesley, 1989.
[14] D.L. Lee and W.-C. Lee, "Using Path Information for Query Processing in Object-Oriented Database Systems," Proc. Conf. Information and Knowledge Management, pp. 64-71,Gathersberg, Md., Nov. 1994.
[15] W.-C. Lee and D.L. Lee, "Combining Indexing Technique with Path Dictionary for Nested Object Queries," Proc. DASFAA '95, Fourth Int'l Conf. Database Systems for Advanced Applications, pp. 107-114,Singapore, Apr. 1995.
[16] W.-C. Lee and D.L. Lee, "Signature File Methods for Indexing Object-Oriented Database Systems," Proc. Second Int'l Computer Science Conf., pp. 616-622,Hong Kong, Dec. 1992.
[17] W.-C. Lee and D.L. Lee, "Short Cuts for Traversals in Object-Oriented Database Systems," Proc. Int'l Computer Symp., pp. 1,172-1,177,Hsinchu, Taiwan, Dec. 1994.
[18] D. Maier and J. Stein,“Indexing in an object-oriented DBMS,” Proc. IEEE Workshop Object-Oriented DBMS,Asilomar, Calif., Sept. 1986.
[19] E.J. Shekita and M.J. Carey, “Performance Enhancement Through Replication in an Object-Oriented DBMS,” Proc. ACM SIGMOD Conf. Management of Data, pp. 325-336, June 1989.
[20] P. Valduriez, “Join Indices,” ACM Trans. Database Systems, vol. 12, no. 2, 1987.
[21] H.-S. Yong, S. Lee, and H.-J. Kim, "Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases," Proc. SIGMOD Conf., pp. 518-525,Washington, D.C., 1993.

Index Terms:
Object-oriented database, aggregation hierarchy, index method, file structure, nested query.
Citation:
Wang-Chien Lee, Dik Lun Lee, "Path Dictionary: A New Access Method for Query Processing in Object-Oriented Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 3, pp. 371-388, May-June 1998, doi:10.1109/69.687974
Usage of this product signifies your acceptance of the Terms of Use.