| Question asked
|
The classic criticism of "Type 2 OBDBs" (a … The classic criticism of "Type 2 OBDBs" (and similarly structured plain triplestores) using a binary representation (vertical partitioning) is the inability to efficiently answer queries with unbound predicates. Similar problems exist with the mentioned "table per class representations" for storing multiple values per resource.
Given that the above mentioned storage schemes are the only ones discussed in the implementation of the proposed annotation and query rewriting mechanisms, could such a system be made to work with a more traditional triples-table storage scheme?
Bounding boxes are inadequate to test geographic subdivisions in the real world (the case of Baarle-Hertog, Belgium being perhaps the most notable and extreme, in which Dutch enclaves exist inside Belgian enclaves which exist inside of the Netherlands, proper). Can this system be made to work with more complicated geographic data than simple bounding boxes/circles, or is it constrained to the domain of simplistic examples? ined to the domain of simplistic examples?
|
