#relationalalgebra — Public Fediverse posts

Query about keys in relational algebra.

Does relational algebra actually talk about keys (especially "candidate keys")? I think it just describes relations as sets of tuples?

> A search for "key" in the wikipedia relation algebra page only has it as part of "keyword" – https://en.wikipedia.org/wiki/Relational_algebra

But relation elements typically aren't _just_ set members. Keys on a relation typically provide much stronger constraints than that.

The "candidate keys" at least, often seem like the really interesting part:

* Keys provide identity for relation elements.
* In a relation with several candidate keys, the keys are isomorphic identifiers for elements.

Is there a theory and account of keys in (or outside of) relational algebra?

Are there search terms I can use to jump in to this?

#RelationalAlgebra

Query about keys in relational algebra.

Does relational algebra actually talk about keys (especially "candidate keys")? I think it just describes relations as sets of tuples?

> A search for "key" in the wikipedia relation algebra page only has it as part of "keyword" – https://en.wikipedia.org/wiki/Relational_algebra

But relation elements typically aren't _just_ set members. Keys on a relation typically provide much stronger constraints than that.

The "candidate keys" at least, often seem like the really interesting part:

* Keys provide identity for relation elements.
* In a relation with several candidate keys, the keys are isomorphic identifiers for elements.

Is there a theory and account of keys in (or outside of) relational algebra?

Are there search terms I can use to jump in to this?

#RelationalAlgebra

Query about keys in relational algebra.

Does relational algebra actually talk about keys (especially "candidate keys")? I think it just describes relations as sets of tuples?

> A search for "key" in the wikipedia relation algebra page only has it as part of "keyword" – https://en.wikipedia.org/wiki/Relational_algebra

But relation elements typically aren't _just_ set members. Keys on a relation typically provide much stronger constraints than that.

The "candidate keys" at least, often seem like the really interesting part:

* Keys provide identity for relation elements.
* In a relation with several candidate keys, the keys are isomorphic identifiers for elements.

Is there a theory and account of keys in (or outside of) relational algebra?

Are there search terms I can use to jump in to this?

#RelationalAlgebra

Query about keys in relational algebra.

Does relational algebra actually talk about keys (especially "candidate keys")? I think it just describes relations as sets of tuples?

> A search for "key" in the wikipedia relation algebra page only has it as part of "keyword" – https://en.wikipedia.org/wiki/Relational_algebra

But relation elements typically aren't _just_ set members. Keys on a relation typically provide much stronger constraints than that.

The "candidate keys" at least, often seem like the really interesting part:

* Keys provide identity for relation elements.
* In a relation with several candidate keys, the keys are isomorphic identifiers for elements.

Is there a theory and account of keys in (or outside of) relational algebra?

Are there search terms I can use to jump in to this?

#RelationalAlgebra

Query about keys in relational algebra.

Does relational algebra actually talk about keys (especially "candidate keys")? I think it just describes relations as sets of tuples?

> A search for "key" in the wikipedia relation algebra page only has it as part of "keyword" – https://en.wikipedia.org/wiki/Relational_algebra

But relation elements typically aren't _just_ set members. Keys on a relation typically provide much stronger constraints than that.

The "candidate keys" at least, often seem like the really interesting part:

* Keys provide identity for relation elements.
* In a relation with several candidate keys, the keys are isomorphic identifiers for elements.

Is there a theory and account of keys in (or outside of) relational algebra?

Are there search terms I can use to jump in to this?

#RelationalAlgebra

Compositional Datalog on SQL: Relational Algebra of the Environment

https://www.philipzucker.com/compose_datalog/

#HackerNews #Compositional #Datalog #SQL #RelationalAlgebra #Environment

Compositional Datalog on SQL: Relational Algebra of the Environment

https://www.philipzucker.com/compose_datalog/

#HackerNews #Compositional #Datalog #SQL #RelationalAlgebra #Environment

Compositional Datalog on SQL: Relational Algebra of the Environment

https://www.philipzucker.com/compose_datalog/

#HackerNews #Compositional #Datalog #SQL #RelationalAlgebra #Environment

Compositional Datalog on SQL: Relational Algebra of the Environment

https://www.philipzucker.com/compose_datalog/

#HackerNews #Compositional #Datalog #SQL #RelationalAlgebra #Environment

Compositional Datalog on SQL: Relational Algebra of the Environment

https://www.philipzucker.com/compose_datalog/

#HackerNews #Compositional #Datalog #SQL #RelationalAlgebra #Environment

Congrats to @codydunne & Wolfgang Gatterbauer for their #SIGMOD 2024 best paper honorable mention (one of 3 for the conference)!

Check out "On the reasonable effectiveness of Relational Diagrams: explaining relational query patterns and the pattern expressiveness of relational languages" here:

https://vis.khoury.northeastern.edu/pubs/Gatterbauer2024ReasonableEffectiveness/

#SQL #RDBMS #RelationalDatabases #RelationalAlgebra #RelationalCalculus #Logic #Visualization #HCI

Congrats to @codydunne & Wolfgang Gatterbauer for their #SIGMOD 2024 best paper honorable mention (one of 3 for the conference)!

Check out "On the reasonable effectiveness of Relational Diagrams: explaining relational query patterns and the pattern expressiveness of relational languages" here:

https://vis.khoury.northeastern.edu/pubs/Gatterbauer2024ReasonableEffectiveness/

#SQL #RDBMS #RelationalDatabases #RelationalAlgebra #RelationalCalculus #Logic #Visualization #HCI

Congrats to @codydunne & Wolfgang Gatterbauer for their #SIGMOD 2024 best paper honorable mention (one of 3 for the conference)!

Check out "On the reasonable effectiveness of Relational Diagrams: explaining relational query patterns and the pattern expressiveness of relational languages" here:

https://vis.khoury.northeastern.edu/pubs/Gatterbauer2024ReasonableEffectiveness/

#SQL #RDBMS #RelationalDatabases #RelationalAlgebra #RelationalCalculus #Logic #Visualization #HCI

Congrats to @codydunne & Wolfgang Gatterbauer for their #SIGMOD 2024 best paper honorable mention (one of 3 for the conference)!

Check out "On the reasonable effectiveness of Relational Diagrams: explaining relational query patterns and the pattern expressiveness of relational languages" here:

https://vis.khoury.northeastern.edu/pubs/Gatterbauer2024ReasonableEffectiveness/

#SQL #RDBMS #RelationalDatabases #RelationalAlgebra #RelationalCalculus #Logic #Visualization #HCI

Congrats to @codydunne & Wolfgang Gatterbauer for their #SIGMOD 2024 best paper honorable mention (one of 3 for the conference)!

Check out "On the reasonable effectiveness of Relational Diagrams: explaining relational query patterns and the pattern expressiveness of relational languages" here:

https://vis.khoury.northeastern.edu/pubs/Gatterbauer2024ReasonableEffectiveness/

#SQL #RDBMS #RelationalDatabases #RelationalAlgebra #RelationalCalculus #Logic #Visualization #HCI

https://arxiv.org/pdf/2404.18795

When Lawvere meets Peirce: an equational
presentation of boolean hyperdoctrines

by Filippo Bonchi, Alessandro Di Giorgio, Davide Trotta

Pushing algebraization of logic another step forward.

With this approach logical deductions can be made using straightforward equation manipulations.

This kind of bridge will eventually become very useful for knowledge representation!
As knowledge representation is mostly built on description logics, the community so far doesn’t appreciate the potential to enrich its toolset with algebraic methods and other existing mathematical machinery.

#categorytheory #logic #knowledgeRepresentation #cartesianBicategories #relationalAlgebra #Lawvere #Peirce #hyperdoctrines

https://arxiv.org/pdf/2404.18795

When Lawvere meets Peirce: an equational
presentation of boolean hyperdoctrines

by Filippo Bonchi, Alessandro Di Giorgio, Davide Trotta

Pushing algebraization of logic another step forward.

With this approach logical deductions can be made using straightforward equation manipulations.

This kind of bridge will eventually become very useful for knowledge representation!
As knowledge representation is mostly built on description logics, the community so far doesn’t appreciate the potential to enrich its toolset with algebraic methods and other existing mathematical machinery.

#categorytheory #logic #knowledgeRepresentation #cartesianBicategories #relationalAlgebra #Lawvere #Peirce #hyperdoctrines

https://arxiv.org/pdf/2404.18795

When Lawvere meets Peirce: an equational
presentation of boolean hyperdoctrines

by Filippo Bonchi, Alessandro Di Giorgio, Davide Trotta

Pushing algebraization of logic another step forward.

With this approach logical deductions can be made using straightforward equation manipulations.

This kind of bridge will eventually become very useful for knowledge representation!
As knowledge representation is mostly built on description logics, the community so far doesn’t appreciate the potential to enrich its toolset with algebraic methods and other existing mathematical machinery.

#categorytheory #logic #knowledgeRepresentation #cartesianBicategories #relationalAlgebra #Lawvere #Peirce #hyperdoctrines

https://arxiv.org/pdf/2404.18795

When Lawvere meets Peirce: an equational
presentation of boolean hyperdoctrines

by Filippo Bonchi, Alessandro Di Giorgio, Davide Trotta

Pushing algebraization of logic another step forward.

With this approach logical deductions can be made using straightforward equation manipulations.

This kind of bridge will eventually become very useful for knowledge representation!
As knowledge representation is mostly built on description logics, the community so far doesn’t appreciate the potential to enrich its toolset with algebraic methods and other existing mathematical machinery.

#categorytheory #logic #knowledgeRepresentation #cartesianBicategories #relationalAlgebra #Lawvere #Peirce #hyperdoctrines

https://arxiv.org/pdf/2404.18795

When Lawvere meets Peirce: an equational
presentation of boolean hyperdoctrines

by Filippo Bonchi, Alessandro Di Giorgio, Davide Trotta

Pushing algebraization of logic another step forward.

With this approach logical deductions can be made using straightforward equation manipulations.

This kind of bridge will eventually become very useful for knowledge representation!
As knowledge representation is mostly built on description logics, the community so far doesn’t appreciate the potential to enrich its toolset with algebraic methods and other existing mathematical machinery.

#categorytheory #logic #knowledgeRepresentation #cartesianBicategories #relationalAlgebra #Lawvere #Peirce #hyperdoctrines

@hn50 this blog post on Datalog and graph algorithms is nicely mindblowing to me.

It's so cool that there's a programming language that abstracts away the impending details of #graphs and graph #algorithms.

Not only that, but it's based on #RelationalAlgebra and is somewhat reminiscent of #SQL 🤯

@hn50 this blog post on Datalog and graph algorithms is nicely mindblowing to me.

It's so cool that there's a programming language that abstracts away the impending details of #graphs and graph #algorithms.

Not only that, but it's based on #RelationalAlgebra and is somewhat reminiscent of #SQL 🤯

@hn50 this blog post on Datalog and graph algorithms is nicely mindblowing to me.

It's so cool that there's a programming language that abstracts away the impending details of #graphs and graph #algorithms.

Not only that, but it's based on #RelationalAlgebra and is somewhat reminiscent of #SQL 🤯

@hn50 this blog post on Datalog and graph algorithms is nicely mindblowing to me.

It's so cool that there's a programming language that abstracts away the impending details of #graphs and graph #algorithms.

Not only that, but it's based on #RelationalAlgebra and is somewhat reminiscent of #SQL 🤯

@hn50 this blog post on Datalog and graph algorithms is nicely mindblowing to me.

It's so cool that there's a programming language that abstracts away the impending details of #graphs and graph #algorithms.

Not only that, but it's based on #RelationalAlgebra and is somewhat reminiscent of #SQL 🤯