Abstract
With the success of the semantic web infrastructures for storing and querying RDF data are gaining importance. A couple of systems are available now that provide basic database functionality for RDF data. Compared to modern database systems, RDF storage technology still lacks sophisticated optimization methods for query processing. Current work in this direction is mainly focussed on index structures for speeding up the access at triple level or for special queries. In this paper, we discuss semantic query caching as a high level optimization technique for RDF querying to supplement existing work on lower level techniques. Our approach for semantic caching is based on the notion of similarity of RDF queries determined by the costs of modifying the results of a previous query into the result for the actual one. We discuss the problem of subsumption for RDF queries, present a cost model and derive a similarity measure for RDF queries based on the cost model and the notion of graph edit distance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Broekstra, J., Kampman, A., van Harmelen, F.: Sesame: A generic architecture for storing and querying rdf and rdf schema. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, Springer, Heidelberg (2002)
Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19(3-4), 255–259 (1998)
Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 689–694 (1997)
Chidlovskii, B., Borgho, U.M.: Semantic caching of web querie. VLDB Journal 9(1), 2–17 (2000)
Christophides, V., Plexousakisa, D., Scholl, M., Tourtounis, S.: On labeling schemes for the semantic web. In: Proceedings of the 13th World Wide Web Conference, pp. 544–555 (2003)
Dar, S., Franklin, M.J., Joensson, B., Srivastava, D., Tan, M.: Semantic data caching and replacement. In: Proceedings of VLDB 1996, pp. 330–341 (1996)
Lee, D., Chu, W.W.: Towards intelligent semantic caching for web sources. Journal of Intelligent Information Systems 17(1), 23–45 (2001)
Ren, Q., Dunham, M.H., Kumar, V.: Semantic caching and query processing. IEEE Transactions on Knwoledge and Data Engineering 15(1) (January/February 2003)
Stuckenschmidt, H., Vdovjak, R., Broekstra, J., Houben, G.-J.: Towards distributed RDF querying. International Journal on Web Engineering and Technology (2004) (to appear)
Wang, J.T.L., Zhang, K., Chirn, G.-W.: Algorithms for approximate graph matching. Information Sciences 82, 45–74 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stuckenschmidt, H. (2004). Similarity-Based Query Caching. In: Christiansen, H., Hacid, MS., Andreasen, T., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2004. Lecture Notes in Computer Science(), vol 3055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25957-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-25957-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22160-9
Online ISBN: 978-3-540-25957-2
eBook Packages: Springer Book Archive