.png){kind=icon}
返回
Evaluating universal quantification in XML
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2007.190643.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 universal quantification types and define a family of algorithms suitable for handling each. We experimentally demonstrate the performance benefits of the new family of algorithms.
Keyword:
query processing
XML
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。