A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Queries posed to database systems often involve Universal Quantification. Such queries are typically expensive to evaluate. Although they can be handled by basic access methods, for selection, grouping, and so forth, new access methods specifically tailored to evaluate universal quantification can greatly decrease the computational cost. In this paper, we study the efficient evaluation of universal quantification in an XML database. Specifically, we develop a small taxonomy of universaldoi:10.1109/tkde.2007.190643 fatcat:fqxtzw47ijb4jh4hzrnypr4hgm