Reducing redundancy of XPath query over networks by transmitting XML views

Authors:
Yanjun Xu;Shicheng Xu;Chengbao Peng;Zhang Xia
Affiliations:
Neusoft Corporation, Shenyang, China;Neusoft Corporation, Shenyang, China;Neusoft Corporation, Shenyang, China;Northeastern University Research, Shenyang, China
Venue:
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Year:
2010

Citing 3
Cited 0

Answering xpath queries over networks by sending minimal views

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
XML Integrated Environment for Service-Oriented Data Management

ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
Worst-case optimal algorithm for XPath evaluation over XML streams

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

XPath is a language to retrieve information in the XML documents, which is used to traverse their elements and attributes. At the present time there are a large number of optimization techniques on XML applications at home and abroad, including axis join queries, query rewriting, the semantic cache using in the client, redundancy elimination based on marked suffix tree (MST) and so on. However, these techniques are lack of research to eliminate redundancy in the network environments. In this paper, we reduce communication costs and computing costs over networks by rewriting the queries submitted by the client. Given a set of queries, we compute a minimal XML view that can answer all the original queries and eliminate possible redundancy.