On Adding a True Predicate Logic Layer to Relation Databases

Created 2004-02-13 / Edited 2004-02-13

See SetDB for more recent work regarding this subject. This predicate logic stuff was interesting and all, but way too complicated. I am now working on a much more simple and programmer-centric theory on how programming a DB should be. The remainder is here as a reminder of a method which doesn't work, or at least needs a lot more work.

Thesis: Relational databases are supposed to be based on Predicate Logic, but they fail to appear that way. It is possible, however, to create a layer which will fix this mis-representation. This layer would have its own interface language, replacing SQL. It would also keep track of data relationships and take those into account for understanding queries. Finally, it would still be able to interface to existing relational databases (by outputting SQL).

References:

Relational Databases (RDBs for short) are intended to provide a predicate logic like view of stored data. In their current state, however, RDBs do not keep track of high-level relationships and instead rely on the user (the programmer or program querying the data) to manage said relationships.

Lets first toy around a cross between some mathematical syntax and perl for our various operations.

Select all people: @people = $${ \forall x | (person(x) \rightarrow x) }$$;. The idea here would be that @people would be a tied array, allowing you to access the returned results arbitrarily without a big performance hit. Similarly we could return just the first result from this like this: $person = $${ \exists x | (person(x) \rightarrow x) }$$ ;. @addresses = $${ a | \forall x (person(x) \rightarrow has_address(x,a) \rightarrow a) }$$; foreach$addr (@addresses) {
print "Street: $addr->{'street'}\n"; } @addresses = $$\forall x \forall a (person(x) \rightarrow has_address(x,a) \rightarrow a)$$; foreach$addr (@addresses) {