Skip to main content
Book cover

International Conference on Web Information Systems Engineering

WISE 2012: Web Information Systems Engineering - WISE 2012 pp 696–703Cite as

Memory-Efficient Index for Cache Invalidation Mechanism with OpenJPA

  • Conference paper

  • 2415 Accesses

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

Abstract

OpenJPA is an implementation of the Java Persistence API (JPA) for Apache, with a caching layer for database queries. However the caching performance is poor when an application includes write transactions, because the OpenJPA cache-invalidation mechanism is coarse-grained and this results in a low cache hit rate. In this research, we implemented an index mechanism for cache invalidation optimized for the data access patterns. The sizes of the index can be adjusted for the available cache memory. The results of our benchmark indicated that the optimized index drastically improved the performance of OpenJPA even with a small index size in various data access pattern scenarios.

Keywords

  • EJB3.0
  • JPA
  • OpenJPA
  • Index
  • Cache invalidation

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-35063-4_55
  • Chapter length: 8 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-642-35063-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.99
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. EJB 3.0 Expert Group, JSR 220: Enterprise JavaBeans Version 3.0 Java Persistence API, Sun Microsystems, Santa Clara, CA (2006)

    Google Scholar 

  2. Amiri, K., Park, S., Tewari, R., Padmanabhan, S.: DBProxy: A dynamic data cache for Web applications. In: ICDE, pp. 821–831 (2003)

    Google Scholar 

  3. Luo, Q., Krishnamurthy, S., Mohan, C., Pirahesh, H., Woo, H., Lindsay, B.G., Naughton, J.F.: Middle-tier database caching for e-business. In: SIGMOD, pp. 600–611 (2002)

    Google Scholar 

  4. Larson, P.A., Goldstein, J., Zhou, J.: MTCache: Transparent mid-tier database caching in SQL server. In: ICDE, pp. 177–188 (2004)

    Google Scholar 

  5. Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally. In: SIGMOD, pp. 157–166 (1993)

    Google Scholar 

  6. Enoki, M., Ozawa, Y., Onodera, T.: Performance Improvement of OpenJPA by Query Dependency Analysis. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5982, pp. 370–379. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  7. Seshadri, P., Swami, A.: Generalized Partial Indexes. In: ICDE, pp. 420–427 (1995)

    Google Scholar 

  8. Ross, K.A., Srivastava, D., Sudarshan, S.: Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time. In: SIGMOD, pp. 447–458 (1996)

    Google Scholar 

  9. Transaction Processing Council. TPC-W specification, http://www.tpc.org.tpcw

  10. Narula, A.: Ubs Publishers Distributors Ltd, ”80/20 Rule of Communicating Your Ideas Effectively” (2005)

    Google Scholar 

  11. Stonebraker, M.: The case for partial indexes. In: Proceedings of the 34th Very Large Databases, VLDB 1989 (1998)

    Google Scholar 

  12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  13. Karmarkar, N., Karp, R.: The differencing method of set partitioning. Technical Report UCB/CSD 82/113, University of California, Berkeley, CA (1982)

    Google Scholar 

  14. Korf, R.: A complete anytime algorithm for number partitioning. Artificial Intelligence 106(2), 181–203 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Partition (database), http://en.wikipedia.org/wiki/Partition_%28database%29

Download references

Author information

Authors and Affiliations

  1. IBM Research, Tokyo, Japan

    Miki Enoki, Yosuke Ozawa, Hiroshi Horii & Tamiya Onodera

Authors
  1. Miki Enoki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yosuke Ozawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroshi Horii
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tamiya Onodera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Fudan University, 825 Zhangheng Rd., Shanghai, 201203, China

    X. Sean Wang

  2. Department of Computer Science, College of Engineering, Science and Engineering Offices, The University of Illinois at Chicago, 851 South Morgan Street (M/C 152), 60607-7053, Chicago, Illinois, USA

    Isabel Cruz

  3. Department of Informatics and Telecommunications, University of Athens, GR15784, Ilisia, Athens, Greece

    Alex Delis

  4. Centre for Applied Informatics, Victoria University, PO Box 14428, 8001, Melbourne, VIC, Australia

    Guangyan Huang

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Enoki, M., Ozawa, Y., Horii, H., Onodera, T. (2012). Memory-Efficient Index for Cache Invalidation Mechanism with OpenJPA. In: Wang, X.S., Cruz, I., Delis, A., Huang, G. (eds) Web Information Systems Engineering - WISE 2012. WISE 2012. Lecture Notes in Computer Science, vol 7651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35063-4_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35063-4_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35062-7

  • Online ISBN: 978-3-642-35063-4

  • eBook Packages: Computer ScienceComputer Science (R0)