Mirror of the Rel4tion website/wiki source, view at <http://rel4tion.org>

[[ 🗃 ^yEzqv rel4tion-wiki ]] :: [📥 Inbox] [📤 Outbox] [🐤 Followers] [🤝 Collaborators] [🛠 Commits]

Clone

HTTPS: git clone https://vervis.peers.community/repos/yEzqv

SSH: git clone USERNAME@vervis.peers.community:yEzqv

Branches

Tags

master :: projects / naya /

existing.mdwn

Last time I created an abstract model, a mathematical one. Then I decided I want to examine existing query languages and see how they perform compared to my model. I would like to examine two kinds of languages:

  1. Logical programming languages (query real-time in-memory data)
  2. Database query languages (query potentially huge datasets stores on disk)

There’s one more special thing I want to learn, especially from logical programming: How to combine procedural programming with the logic. It is very important because some relations are realized as stored data (e.g. hasLicense for a SourceFile object mapped to its License object), others are computed from these (e.g. does a given file have a license specified) and others are predefined because they operate on primitive type (e.g. number comparison). Others may be more complicated, e.g. string lexicographical comparison or string concatenation.

This is where I should start:

Okay. I went over some Wikipedia articles, and now I want to consider the following:

[See repo JSON]