Just my 2-cents here but I recall reading the the schema of the NoSQL storage (e.g. key and lots of values per row) can significantly impact the ability to support the graph search operations (e.g find all triples that have a given predicate).
If you are creating a NoSQL database to underpin a graph then you should probably spend some time looking at the search requirements on the graph. If you are mapping an existing NoSQL to a graph you may want to consider how you will handle the cases that are not directly supported by the database schema. -- Claude On Fri, Nov 23, 2012 at 6:08 PM, Andy Seaborne <[email protected]> wrote: > On 23/11/12 16:05, Bell, Paul M. wrote: >> >> Hi Andy, >> >> Thanks for your helpful replies. >> >> Some brief follow-up: >> >> 1. I thought that D2RQ could present a virtual RDF graph based on SQL >> DB only. Can it be customized (via some kind of adapter plug-in) to >> handle NoSQL DB? > > > I don't know - that's a question best answered by the D2QR project. They may > have plans. > > It would at least be a good starting point (depending on the NoSQL) because > one NoSQL database often looks like a single table, maybe a bit ragged > (missing values in rows) > > Andy > > >> >> Thanks again. >> >> -paul >> >> Technology Architect Syncsort Data Protection "Heideggerian Magneto >> Reluctance Algorithms risk Sinusoidal Depleneration" > > -- I like: Like Like - The likeliest place on the web Identity: https://www.identify.nu/[email protected] LinkedIn: http://www.linkedin.com/in/claudewarren
