Algorithms and applications for universal quantification in relational databases.

DOI10.1016/S0306-4379(02)00047-9MaRDI QIDQ1872645zbMATH OpenOpenAlexFDO

Authors Ralf Rantzau, Bernhard Mitschang, Quan Wang, Leonard Shapiro

Publication date 14 May 2003

Published in Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0306-4379(02)00047-9

zbMATH Keywords

FrequentGroupingitemset discoveryQuery operatorsRelational divisionSet containment join

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Universal quantification in relational databases: A classification of data and algorithms
• Frequent itemset discovery with SQL using universal quantification
• Set-oriented data mining in relational databases
• On the foundations of the universal relation model
• Induction of relational algebra expressions

Cited in

(2)

• Universal quantification in relational databases: A classification of data and algorithms
• Frequent itemset discovery with SQL using universal quantification

This page was built for publication: Algorithms and applications for universal quantification in relational databases.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872645)