Remembering the Future

Q: Shouldn’t we concentrate more on RDF data and schema than OWL?
A: Maybe – but I’m a logician, not a database guy.

Q: (Klaus Schild) Scalability? OWL is NP-complete.
A: Distribution helps. Certain combinations of operators are deadly, but if the two operators happen to end up on different nodes, things can be much faster. But in general it’s a problem.

Q: But if you take the Web seriously, you need sub-linear complexity.
A: You can’t have that with RDF and OWL.

Topics: RDF | OWL | Web2.0