arrow
返回

Algorithms and applications for universal quantification in relational databases

delete2003-03-01
delete6
delete
OA
AI
S
Shapiro, LD
B
Bernhard Mitschang
Q
Quan Wang
DOI:10.1016/S0306-4379(02)00047-9delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Enterprise Information Systems 封面图
Enterprise Information Systems
IF:
3.9
论文数:
2.8K
被引数:
1.8K

机构

暂无机构信息
引用论文

引用论文

Modeling the complete chemokine–receptor interaction
err2019-01-01
err0
errOAAI
errMichael J. Wedemeyer; Benjamin K. Mueller; Brian J. Bender; Jens Meiler; Brian F. Volkman
err分享
err收藏
err分享
err收藏
学者 查看更多内容