CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Dynamic Interpolation B-Tree: A New Access Metho

by P. Dinadayalan, Gnanambigai Dinadayalan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 17 - Number 4
Year of Publication: 2011
Authors: P. Dinadayalan, Gnanambigai Dinadayalan
10.5120/2206-2804

P. Dinadayalan, Gnanambigai Dinadayalan . Dynamic Interpolation B-Tree: A New Access Metho. International Journal of Computer Applications. 17, 4 ( March 2011), 39-43. DOI=10.5120/2206-2804

@article{ 10.5120/2206-2804,
author = { P. Dinadayalan, Gnanambigai Dinadayalan },
title = { Dynamic Interpolation B-Tree: A New Access Metho },
journal = { International Journal of Computer Applications },
issue_date = { March 2011 },
volume = { 17 },
number = { 4 },
month = { March },
year = { 2011 },
issn = { 0975-8887 },
pages = { 39-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume17/number4/2206-2804/ },
doi = { 10.5120/2206-2804 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:04:45.308362+05:30
%A P. Dinadayalan
%A Gnanambigai Dinadayalan
%T Dynamic Interpolation B-Tree: A New Access Metho
%J International Journal of Computer Applications
%@ 0975-8887
%V 17
%N 4
%P 39-43
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The performance of Object-Oriented Database depends on the access method implemented in the data model. Dynamic Interpolation B-tree (DIB) is a new indexing technique supporting query processing in Object-Oriented Databases which is effective and efficient for multimedia databases. This is a new access method which supports range queries on Object-Oriented Databases. DIB supports inheritance and aggregation hierarchies. DIB has the structure of Dynamic Interpolation B-tree. Dynamic Interpolation B-tree consists of hashing and B-tree. Both hashing and B-tree are dynamic. DIB technique is compared with other techniques obtained from more traditional organizations. In this new technique all the operations are done efficiently. The result shows that the Dynamic Interpolation B-tree is significantly better than the traditional indexing methods over a wide range of parameters in terms of range of parameters, retrieval and update cost so that the storage overhead grows slowly with the number of indexed attributes.

References
  1. Awais Rashid, Peter Sawyer, “A database evolution taxonomy for object-oriented databases”, Journal of Software Maintenance and Evolution: Research and Practice, Volume 17, I ssue 2, p.p.93–141, March/April 2005.
  2. A.V. Aho, J.E. Hopcroft, J.D. Ullman, “The Data Structures & Algorithms,” Addition –Wesley,1998.
  3. E. Bertino, “An Indexing Technique for Object-Oriented Databases,” Proc. Seventh Int’l Conf. Data Eng., pp. 160–170, Kobe, Japan, 1991.
  4. E. Bertino and W. Kim, “Indexing Techniques for Queries on Nested Objects,“ IEEE Trans. Knowledge and Data Eng., vol. 1, no. 2, pp. 196–214, June 1989.
  5. R.J.Enbody, “Dynamic Hashing Schemes”, ACM Computing Surveys, Vol.20, No.2, April 1998.
  6. A. Kemper and G. Moerkotte, “Advanced Query Processing in Object Bases Using Access Support Relations,” Proc. 16th Int’l Conf. Very Large Data Bases, pp. 290–301, Brisbane, Australia, Aug. 1990.
  7. A. Kemper and G. Moerkotte, “Access Support in Object Bases,” Proc. 1990 SIGMOD Conf., pp. 364–374, Atlantic City, N.J., May 1990.
  8. W. Kim, “A Model of Queries for Object-Oriented Databases,” Proc. IEEE Int’l Conf. Very Large Data Bases, pp. 423–432, Amsterdam, 1989.
  9. W. Kim, K.C Kim, and A. Dale, “Indexing Techniques for Object-Oriented Databases,” W. Kim and F.H. Lochovsky, eds., Object-Oriented Concepts, Databases, and Applications, pp. 371–394, Reading,Mass., Addison-Wesley, 1989.
  10. 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.
  11. 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.
  12. W.C. Lee and D.L. Lee, “Path Dictionary: A New Approach to Query Processing in Object-Oriented Database”, IEEE Transaction on Knowledge and Data Engineering (TKDE), Volume 10, No. 3, May/June 1998, pp. 371-388.
  13. Paul Rodrigues, S.Kuppuswami, ”Concurrency of Operations on IB-trees”, Pondicherry University, Pondicherry, 2000.
  14. Paul Rodrigues, “Performance Amelioration of Object-Oriented Databases ”, Ph.D report, 1999, Pondicherry University, Pondicherry, India.
  15. Pichayotai Mahatthanapiwat, Wanchai Rivepiboon ,”Virtual path signature: An approach for flexible searching in object-oriented databases”, International Journal of Intelligent Systems, Volume 19, Issue 1-2, p.p. 51–63, January/ February 2004.
Index Terms

Computer Science
Information Sciences

Keywords

B-tree DIB interpolation hashing OODBS databases and index

Powered by PhDFocusTM