A minimum sequence matching scheme for efficient XPath processing
KSII Transactions on Internet and Information Systems, Oct, 2009 by Dong-min Seo, Myung-Ho Yeo, Myoung-Ho Kim, Jae-Soo Yoo
1. Introduction
As XML is gaining complete success in being adopted as universal data representation and exchange format. However, particularly on the World Wide Web, the problem of querying XML documents poses interesting challenges to database researchers. Recently, there have been many studies on the structural join methods to efficiently process the XML queries involving ancestor-descendant relationships [1][2][3]. The structural join methods can efficiently answer simple queries
search engine optimisation suffolk