On the complexity of division and set joins in the relational algebra (Q882434): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082271602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal languages and bounded fragments of predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Semi-Joins to Solve Relational Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the guarded fragments by resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Restraining Power of Guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Back and forth between guarded and modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semijoin algebra and the guarded fragment / rank
 
Normal rank

Latest revision as of 18:54, 25 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of division and set joins in the relational algebra
scientific article

    Statements

    On the complexity of division and set joins in the relational algebra (English)
    0 references
    0 references
    0 references
    23 May 2007
    0 references
    database
    0 references
    relational algebra
    0 references
    semijoin algebra
    0 references
    complexity
    0 references

    Identifiers