Universal Quantification in Relational Databases: A Classification of Data and Algorithms-Reference-Cited by-同舟云学术

Universal Quantification in Relational Databases: A Classification of Data and Algorithms

Published:2002 Issue: Volume: Page:445-463
ISSN:0302-9743
Container-title:Advances in Database Technology — EDBT 2002
language:
Short-container-title:

Author:

Rantzau Ralf,Shapiro Leonard,Mitschang Bernhard,Wang Quan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45876-X_29

Reference12 articles.

1. Bry, F.: Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited. SIGMOD 1989: 193–204

2. Clauβen, J., Kemper, A., Moerkotte, G., Peithner, K: Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases. VLDB 1997: 286–295

3. Dayal, U.: Processing Queries with Quantifiers: A Horticultural Approach. PODS 1983: 125–136

4. Dayal, U.: Of Nests and Trees: A Unified Approach to Processing Queries that Contain Nested Subqueries, Aggregates, and Quantifiers. VLDB 1987: 197–208

5. Graefe, G.: Query Evaluation Techniques for Large Databases. ACM Computing Surveys 25(2): 73–170 (1993)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unified-Processing of Flexible Division Dealing with Positive and Negative Preferences;Computational Intelligence and Its Applications;2018

2. New Variants of Hash-Division Algorithm for Tolerant and Stratified Division;Flexible Query Answering Systems;2017

3. Universal Quantification in Relational Databases: A Classification of Data and Algorithms;Advances in Database Technology — EDBT 2002;2002