返回
Algorithms and applications for universal quantification in relational databases
DOI:10.1016/S0306-4379(02)00047-9.png)
摘要
En 中文
Queries containing universal quantification are used in many applications, including business intelligence applications and in particular data mining. We present a comprehensive survey of the structure and performance of algorithms for universal quantification. We introduce a framework that results in a complete classification of input data for universal quantification. Then we go on to identify the most efficient algorithm for each such class. One of the input data classes has not been covered so far. For this class, we propose several new algorithms. Thus, for the first time, we are able to identify the optimal algorithm to use for any given input dataset. These two classifications of optimal algorithms and input data are important for query optimization. They allow a query optimizer to make the best selection when optimizing at intermediate steps for the quantification problem. In addition to the classification, we show the relationship between relational division and the set containment join and we illustrate the usefulness of employing universal quantifications by presenting a novel approach for frequent itemset discovery. (C) 2002 Elsevier Science Ltd. All rights reserved.
Keyword:
query operators
grouping
relational division
set containment join
frequent itemset discovery
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
暂无机构信息
引用论文
Structual Priming and L2 Proficiency Effects on Bilingual Syntanctic Processing in Production结构启动和二语熟练度对双语者产出中句法处理的影响
EFFECT OF THE ANION ON THE SORPTION OF POTASSIUM BY SOME HUMIC AND HYDROL HUMIC LATOSOLS
Soil Science
IF0
The Impact of Engagement in Large-Scale Assessment on Teachers' Professional Development: The Emergent Literacy Baseline Assessment Project大规模评估中的参与对教师专业发展的影响:早期读写能力基线评估项目

