Skip to main content

Type-Level Access Pattern View: A Technique for Enhancing Prefetching Performance

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3882))

Included in the following conference series:

Abstract

Navigational applications on Object-Relational DBMSs (ORDBMSs) access objects in the database related to one another via reference and collection attributes. When accessing an object, the applications first look up the object cache in the client and, if the object does not exist, fetch the object from the server. Prefetching is to identify the objects that are highly probable to be accessed in the future by the applications and to save these objects in the object cache in advance. Since prefetching reduces the number of high cost fetches, it is crucial for the performance of the applications. The prefetch method proposed by Han et al.[7] reduces the number of fetches by orders of magnitude compared with the previous methods. However, overall performance enhancement is not as significant as reduction of fetches. Since the performance of prefetching is determined by the number of disk accesses in the server as well as the number of fetches. In this paper, we propose a technique for minimizing the number of disk accesses to enhance the performance of the prefetch method proposed by Han et al. We propose a method for creating materialized views based on the type-level path access logs proposed by Han et al.[6]. We call the materialized view as the type-level access pattern view. We then present an algorithm for minimizing the number of disk accesses when prefetching the objects from the database in the server by using the type-level access pattern view. We perform a series of experiments using a variety of databases to show that the technique proposed in this paper significantly enhances the overall performance of the navigational applications. We show that the proposed technique reduces the number of disk accesses by up to 33.0 times and enhances the performance by up to 21.4 times compared with the original prefetch method by Han et al.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., McHugh, J., Rys, M., Vassalos, V., Wiener, J.: Incremental Maintenance for Materialized Views over Semistructured Data. In: Proc. Int’l Conf. Very Large Data Bases (VLDB), New York, pp. 38–49 (August 1998)

    Google Scholar 

  2. Berstein, P.A., Pal, S., Shutt, D.: Context-Based Prefetch for Implementing Objects on Relations. In: Proc. Int’l Conf. Very Large Data Bases (VLDB), Edinburgh, Scotland, pp. 327–338 (September 1999)

    Google Scholar 

  3. Bowman, I.T., Salem, K.: Optimization of Query Streams Using Semantic Prefetching. In: Proc. Int’l Conf. Management of Data, ACM SIGMOD, Paris, France, pp. 179–190 (June 2004)

    Google Scholar 

  4. Colby, L., Kawaguchi, A., Lieuwen, D., Mumick, I., Ross, K.: Supporting Multiple View Maintenance Policies. In: Proc. Int’l Conf. Management of Data, ACM SIGMOD, Tucson, Arizona, pp. 405–416 (June 1997)

    Google Scholar 

  5. Fraternali, P., Paolini, P.: Model-Driven Development of Web Applications: the AutoWeb System. ACM Trans. Information Systems (TOIS) 18(4), 323–382 (2000)

    Article  Google Scholar 

  6. Han, W.-S., Whang, K.-Y., Moon, Y.-S.: PrefetchGuide: Capturing Navigational Access Patterns for Prefetching in Client/Server Object-Oriented/Object-Relational DBMSs. Information Sciences 152, 47–61 (2003)

    Article  Google Scholar 

  7. Han, W.-S., Whang, K.-Y., Moon, Y.-S.: A Formal Framework for Prefetching Based on the Type-Level Access Pattern in Object-Relational DBMSs. IEEE Trans. Knowledge and Data Engineering (TKDE) (accepted to appear, 2005)

    Google Scholar 

  8. Liskov, B., et al.: Safe and Efficient Sharing of Persistent Objects in Thor. In: Proc. Int’l Conf. Management of Data, ACM SIGMOD, Montreal, Canada, pp. 318–329 (June 1996)

    Google Scholar 

  9. Oracle Corp., Oracle9i SQL Reference, Release 9.2 (Mar 2002)

    Google Scholar 

  10. Stonebraker, M., Moore, D.: Object-Relational DBMSs: The Next Great Wave. Morgan Kaufmann, San Francisco (1999)

    MATH  Google Scholar 

  11. Subramanian, M., Krishnamurthy, V.: Performance Challenges in Object-Relational DBMSs. IEEE Data Engineering Bulletin 22(2), 27–31 (1999)

    Google Scholar 

  12. Taylor, R.G.: Models of Computation and Formal Languages. Oxford University Press, Oxford (1998)

    Google Scholar 

  13. Whang, K.-Y., Lee, M.-J., Lee, J.-G., Kim, M.-S., Han, W.-S.: Odysseus: A High-Performance ORDBMS Tightly-Coupled with IR Features. In: Proc. Int’l Conf. Data Engineering (ICDE), pp. 1104–1105. IEEE, Tokyo, Japan (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, WS., Loh, WK., Whang, KY. (2006). Type-Level Access Pattern View: A Technique for Enhancing Prefetching Performance. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_28

Download citation

  • DOI: https://doi.org/10.1007/11733836_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33337-1

  • Online ISBN: 978-3-540-33338-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics