Skip to main content

A Semantic Model for Hypertext Data Caching

  • Conference paper
  • First Online:
Book cover Conceptual Modeling — ER 2002 (ER 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2503))

Included in the following conference series:

Abstract

In this paper, we propose a semantic model to capture the semantic locality in hypertext access for client-side caching. To characterize hypertext data from the perspective of clients, we define a semantic region as a cluster of semantically related logical documents. A logical document is defined as a sequence of subsequently visited interconnected documents which in turn are composed of a container file and (optionally) a set of component files. This model makes it easy to deal with temporal locality, spatial locality and semantic locality in hypertext access. To verify the proposed model, we use an experimental hypertext system, called HyperDB. We generate a set of workloads and assess the performance of a set of caching algorithms using the synthetic workloads and the experimental hypertext system.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Serge Abiteboul and Victor Vianu. Queries and Computation on the Web. In Proceedings of 6th International Conference on Database Theory (ICDT’97), pages 262–275, January 8–10, Delphi, Greece, 1997.

    Google Scholar 

  2. Foto N. Afrati and Constantinos D. Koutras. A Hypertext Model Supporting Query Mechanisms. In Proceedings of European Conference on Hypertext, pages 52–66, 1990.

    Google Scholar 

  3. Charu Aggarwal, Joel L. Wolf, and Philip S. Yu. Caching on the World Wide Web. IEEE Transactions on Knowledge and Data Engineering, 11(1):95–106, 1999.

    Article  Google Scholar 

  4. Paul S. Bradley, Usama M. Fayyad, and Cory Reina. Scaling Clustering Algorithms to Large Databases. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), pages 9–15, NewYork City, New York, USA, August 1998. AAAI Press.

    Google Scholar 

  5. Andrea Caloini. Matching Hypertext Models to Hypertext Systems: A Com-pilative Approach. In Proceedings of European Conference on Hypertext, pages 91–101, 1992.

    Google Scholar 

  6. Brad Campbell and Joseph M. Goodman. HAM: A General Purpose Hypertext Abstraction Machine. Communications of the ACM, 31(7):856–867, July 1988.

    Google Scholar 

  7. Chris Clifton and Hector Garcia-Molina. Indexing in a Hypertext Database. In Proceedings of the 16th International Conference on Very Large Data Bases (VLDB), pages 36–49, Brisbane, Queensland, Australia, August 1990. Morgan Kaufmann.

    Google Scholar 

  8. Shaul Dar, Michael Franklin, Bjorn Jonsson, Divesh Srivastava, and Michael Tan. Semantic Data Caching and Replacement. In Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB), Bombay, India, September 1996. http://www.cs.umd.edu/projects/dimsum/papers/semanticcaching.ps.gz.

  9. Michael J. Franklin. Client Data Caching. Kluwer Academic Press, Boston, 1996.

    Google Scholar 

  10. Richard Furuta and P. David Stotts. A Functional Meta-Structure for Hypertext Models and Systems. Electronic Publishing, 3(4):179–205, 1990.

    Google Scholar 

  11. Frank G. Halasz and Mayer D. Schwartz. The Dexter Hypertext Reference Model. Communications of the ACM, 37(2):30–39, 1994.

    Article  Google Scholar 

  12. Alberto O. Mendelzon and Tova Milo. Formal Models of Web Queries. In Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems(PODS), pages 134–143, Tucson, Arizona, 1997.

    Google Scholar 

  13. David E. Millard, Luc Moreau, Hugh Davis, and Siegfried Reich. FOHM: a Fundamental Open Hypertext Model for Investigating Interoperability between Hypertext Domains. In Hypertext, pages 93–102, 2000.

    Google Scholar 

  14. Luc Moreau and Wendy Hall. On the Expressiveness of Links in Hypertext Systems. The Computer Journal, 41(7):459–473, 1998.

    Article  MATH  Google Scholar 

  15. Liadan O’Callaghan, Nina Mishra, Adam Meyerson, Sudipto Guha, and Rajeev Motwani. Streaming-Data Algorithms For High-Quality Clustering. In International Conference on Data Engineering (ICDE), 2002.

    Google Scholar 

  16. Elizabeth J. O’Neil, Patrick E. O’Neil, and Gerhard Weikum. The LRU-K Page Replacement Algorithm for Database Disk Buffering. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 297–306, New York, 1993.

    Google Scholar 

  17. Seongbin Park. Structural Properties of Hypertext. In UK Conference on Hypertext, pages 180–187, 1998.

    Google Scholar 

  18. Curt Schimmel. Unix Systems for Modern Architectures. Addison-Wesley, 1994.

    Google Scholar 

  19. Marc Spielmann, Jerzy Tyszkiewicz, and Jan Van den Bussche. Distributed Computation of Web Queries Using Automata. In Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems(PODS), pages 97–108, Madison, Wisconsin, USA, 2002.

    Google Scholar 

  20. P. David Stotts and Richard Furuta. Programmable Browsing Semantics in Trellis. In Hypertext, pages 27–42, New York, 1989.

    Google Scholar 

  21. Frank WM. Tompa. A Data Model for Fexible Hypertext Database Systems. ACM Transations of Information Systems, 7(1):85–100, 1989.

    Article  Google Scholar 

  22. Marcelo Augusto Santos Turine, Maria Cristina Ferreira de Oliveira, and Paulo Cesar Masiero. A Navigation-Oriented Hypertext Model Based on State-charts. In Hypertext, pages 102–111, 1997.

    Google Scholar 

  23. Tian Zhang, Raghu Ramakrishnan, and Miron Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In SIGMOD Conference, pages 103–114, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, K., Kambayashi, Y. (2002). A Semantic Model for Hypertext Data Caching. In: Spaccapietra, S., March, S.T., Kambayashi, Y. (eds) Conceptual Modeling — ER 2002. ER 2002. Lecture Notes in Computer Science, vol 2503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45816-6_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-45816-6_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44277-6

  • Online ISBN: 978-3-540-45816-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics