Abstract
N-ary conjunctive queries, i.e., queries with any number of answer variables, are the formal core of many Web query languages including XSLT, XQuery, SPARQL, and Xcerpt. Despite a considerable body of research on the optimization of such queries over tree-shaped XML data, little attention has been paid so far to efficient access to graph-shaped XML, RDF, or Topic Maps. We propose the first evaluation technique for n-ary conjunctive queries that applies to both tree- and graph-shaped data and retains the same complexity as the best known approaches that are restricted to tree-shaped data only. Furthermore, the approach treats tree and graph-shaped queries uniformly without sacrificing evaluation complexity on the restricted query class. The core of the evaluation technique is based on dynamic programming using a memoization data structure, called "memoization matrix". It can be populated and consumed in different ways. For each of population and consumption, we propose two resp. three algorithms each having their own advantages. The complexity of the algorithms is compared analytically and experimentally.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-130

BibTeX:

@inproceedings{REWERSE-RP-2006-130,
	author = {Fran\c{c}ois Bry and Tim Furche and Benedikt Linse and Andreas Schroeder},
	title = {Efficient Evaluation of n-ary Conjunctive Queries over Trees and Graphs},
	booktitle = {Proceedings of 8th ACM International Workshop on Web Information and Data Management, Arlington, Virginia, USA (10th November 2006)},
	year = {2006},
	organization = {ACM},
	pages = {11--18},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2006-130}
}