Abstract
With the internet development, querying data on the Web is an attention problem of involving information from distributed, and often dynamically, related Web sources. Basically, some sub-queries can be effectively cached from previous queries or materialized views in order to achieve a better query performance based on the notion of rewriting queries. In this paper, we propose a novel query-rewriting model, called Hierarchical Query Tree, for representing Web queries. Hierarchical Query Tree is a labeled tree that is suitable for representing the inherent hierarchy feature of data on the Web. Based on Hierarchical Query Tree, we use case-based approach to determine what the query results should be. The definitions of queries and query results are both represented as labeled trees. Thus, we can use the same model for representing cases and the medium query results can also be dynamically updated by the user queries. We show that our case-based method can be used to answer a new query based on the combination of previous queries, including changes of requirements and various information sources.
Similar content being viewed by others
References
Abiteboul S, Segoufin L, Vianu V. Representing and Querying XML with Incomplete Information.In Proc of PODS 2001. Santa Barbara, USA, 2001.
Yang X, Yu G, Wang G. Efficiently Mapping referential integrity constraints from relational databases to XML Document.In Proc of ADBIS 2001. German: Springer-Verlag Press, 2001.
Chaudhuri S, Krishnamurthy R, Potamianos S,et al. Optimizing queries with materialized views.In Proc of ICDE 1995. Taipei, 1995.
Yang X, Wang B, Wang G,et al. A Query Rewriting System for Enhancing the Queriability of Form-Based Interface,In Proc of ICADL 2004. Shanghai, 2004.
Yang X, Li C. Secure XML Publishing without Information Leakage in the Presence of Data Inference.In Proc of VLDB'04. Toronto, Canada, 2004.
Pavlovic D. Guarded induction on final coalgebras.Electronic Notes in Theoretical Computer Science (Vol. 11). Bulletin: Elsevier Press, 1997.
Ullman J. Information Integration Using Logical Views.In Proc of ICDT. German: Springer-Verlag Press, 1997.
Popa L., Deutsch A, Sahuguet A,et al. A chase too far?In Proc of SIGMOD. Dallas, USA, 2000.
Jonsson B, Srivastava D, Dar S,et al. Semantic data caching and replacement.In Proc of the 22nd, Intl Conf on VLDB. Bombay, India, 1996.
Levy A, Mendelzon A, Sagiv A,et al. Answering queries using views.In Proc of PODS 1995. San Jose, USA, 1995.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Fundation of China (60473074) and Natural Science Foundation for Doctoral Career Award of Liaoning Province (20041016)
Biography: WANG Bin(1972-), male, Ph. D. candidate, research direction: distributed database and peer data management.
Rights and permissions
About this article
Cite this article
Bin, W., Xiao-chun, Y., Guo-ren, W. et al. An efficient query rewriting approach for Web cached data management. Wuhan Univ. J. Nat. Sci. 11, 122–126 (2006). https://doi.org/10.1007/BF02831716
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02831716