Paper Info
Title
Querying XML data sources that export very large sets of views
Abstract
We study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such families of queries we adopt the Query Set Specifications, a formalism close to context-free grammars. We say that query Q is expressible by the specification P if it is equivalent to some expansion of P. Q is supported by P if it has an equivalent rewriting using some finite set of P's expansions. We study the complexity of expressibility and support and identify large classes of XPath queries for which there are efficient (PTIME) algorithms. Our study considers both the case in which the XML nodes in the results of the queries lose their original identity and the one in which the source exposes persistent node ids.
Year
DOI
Venue
2011
10.1145/1929934.1929939
ACM Trans. Database Syst.
Keywords
DocType
Volume
Querying XML data source,large class,large set,semi-structured data,limited set,P. Q,xml,finite set,querying XML data source,views,specification P,query rewriting,XML node,query Q,Query Set Specifications,limited capabilities,XPath query
Journal
36
Issue
ISSN
Citations 
1
0362-5915
3
PageRank 
References 
Authors
0.38
19
4
Name
Order
Citations
PageRank
Bogdan Cautis124623.35
Alin Deutsch22267247.45
Nicola Onose344424.68
Vasilis Vassalos41189144.02