The View Selection Problem for XML Content Based Routing

tivities, n is the largest number of XPath expressions in any query in the workload. Since n can be around 10 20 in practice, the algorithm may generate header sizes that are four times larger than needed, which is unacceptable in practice. Ourthirdcontributionconsists inprovingthatthesame greedy algorithm performs much better on constant- ................
................