The advent of various XML query processing engines has led to the development of many benchmarks. These benchmarks evaluate the system mainly based on the data set (XML document) and a set of queries to be performed on them. The queries are grouped under different categories like join, selection, exact match etc. But these queries do not comprise of all characteristics. An efficient method of testing XML database management systems must involve query sets that deal with the XML data characteristics such as tree fanout and tree depth; and various query characteristics like predicate selectivity. In this project, we will study the important features of XML queries, design and develop a requirement driven query generator based on sub-algebra. To our knowledge it is one of the first such query generator which focuses on generating all possible set of queries matching input characteristics.
Use Patent Claims
These details are provided for information only. No information here is legal advice and should not be used as such.