A formal framework for prefetching based on the type-level access pattern in object-relational DBMSs

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 366
  • Download : 573
DC FieldValueLanguage
dc.contributor.authorHan, WSko
dc.contributor.authorWhang, Kyu-Youngko
dc.contributor.authorMoon, YSko
dc.date.accessioned2009-09-16T02:56:23Z-
dc.date.available2009-09-16T02:56:23Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2005-10-
dc.identifier.citationIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, v.17, pp.1436 - 1448-
dc.identifier.issn1041-4347-
dc.identifier.urihttp://hdl.handle.net/10203/11244-
dc.description.abstractPrefetching is an effective method for minimizing the number of fetches between the client and the server in a database management system. In this paper, we formally define the notion of prefetching. We also formally propose new notions of the type-level access locality and type-level access pattern. The type-level access locality is a pheonomenon that repetitive patterns exist in the attributes referenced. The type-level access pattern is a pattern of attributes that are referenced in accessing the objects. We then develop an efficient capturing and prefetching policy based on this formal framework. Existing prefetching methods are based on object-level or page-level access patterns, which consist of object-ids or page-ids of the objects accessed. However, the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly. In contrast, even though the same objects are not accessed repeatedly, our technique effectively prefetches objects if the same attributes are referenced repeatedly, i.e., if there is type-level access locality. Many navigational applications in Object-Relational Database Management Systems (ORDBMSs) have type-level access locality. Therefore, our technique can be employed in ORDBMSs to effectively reduce the number of fetches, thereby significantly enhancing the performance. We also address issues in implementing the proposed algorithm. We have conducted extensive experiments in a prototype ORDBMS to show effectiveness of our algorithm. Experimental results using the OO7 benchmark, a real GIS application, and an XML application show that our technique reduces the number of fetches by orders of magnitude and improves the elapsed time by several factors over on-demand fetching and context-based prefetching, which is a state-of-the-art prefetching method. These results indicate that our approach provides a new paradigm in prefetching that improves performance of navigational applications significantly and is a practical method that can be implemented in commercial ORDBMSs.-
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherIEEE COMPUTER SOC-
dc.subjectDATABASE SYSTEM-
dc.titleA formal framework for prefetching based on the type-level access pattern in object-relational DBMSs-
dc.typeArticle-
dc.identifier.wosid000231274600010-
dc.identifier.scopusid2-s2.0-27644503502-
dc.type.rimsART-
dc.citation.volume17-
dc.citation.beginningpage1436-
dc.citation.endingpage1448-
dc.citation.publicationnameIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING-
dc.contributor.localauthorWhang, Kyu-Young-
dc.contributor.nonIdAuthorHan, WS-
dc.contributor.nonIdAuthorMoon, YS-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorprefetching-
dc.subject.keywordAuthortype-level access patterns-
dc.subject.keywordAuthortype-level access locality-
dc.subject.keywordAuthorobject-relational DBMSs-
dc.subject.keywordPlusDATABASE SYSTEM-
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0