Skip to content
Snippets Groups Projects
Commit 4db5a30e authored by Andreas Schärtl's avatar Andreas Schärtl
Browse files

review q3

parent 2f399560
No related branches found
No related tags found
No related merge requests found
...@@ -291,9 +291,9 @@ solve algorithmic problems. ...@@ -291,9 +291,9 @@ solve algorithmic problems.
\subsubsection{Contributors and Number of References} \subsubsection{Contributors and Number of References}
Finally, query~$\mathcal{Q}_3$ from literature~\cite{tetra} wants to Finally, query~$\mathcal{Q}_3$ from literature wants to
know ``\emph{[a]ll areas of math that {Nicolas G.\ de Bruijn} has know ``\emph{[a]ll areas of math that {Nicolas G.\ de Bruijn} has
worked in and his main contributions.}'' $\mathcal{Q}_3$~is asking worked in and his main contributions}''~\cite{tetra}. $\mathcal{Q}_3$~is asking
for works of a given author~$A$. It also asks for their main for works of a given author~$A$. It also asks for their main
contributions, for example which particularly interesting paragraphs contributions, for example which particularly interesting paragraphs
or code~$A$ has authored. We picked this particular query as it or code~$A$ has authored. We picked this particular query as it
...@@ -301,19 +301,18 @@ is asking for metadata, something that should be easily serviced by ...@@ -301,19 +301,18 @@ is asking for metadata, something that should be easily serviced by
organizational knowledge. organizational knowledge.
\noindent\emph{Organizational Aspect.} ULO has no concept of authors, \noindent\emph{Organizational Aspect.} ULO has no concept of authors,
contributors, dates and so on. Rather, the idea is to take contributors, dates and so on. Rather, the idea is to take advantage
advantage of the Dublin Core project which provides an ontology of the Dublin Core project which provides an ontology for such
for such metadata~\cite{dcreport, dcowl}. For example, Dublin Core metadata~\cite{dcreport, dcowl}. For example, Dublin Core provides us
provides us with the \texttt{dcterms:creator} and with the \texttt{dcterms:creator} and \texttt{dcterms:contributor}
\texttt{dcterms:contributor} predicates. Servicing~$\mathcal{Q}_3$ predicates. Servicing~$\mathcal{Q}_3$ requires us to look for
requires us to look for creator~$A$ and then list all associated creator~$A$ and then list all associated objects that they have worked
objects that they have worked on. Of course this on. Of course this requires above authorship predicates to actually be
requires above authorship predicates to actually be in use. With in use. With the Isabelle and Coq exports this was hardly the case;
the Isabelle and Coq exports this was hardly the case; running running some experiments we found less than 15 unique contributors and
some experiments we found less than 15 unique contributors and creators, raising suspicion that metadata is missing in the original
creators, raising suspicion that metadata is missing in the library files. Regardless, existing ULO exports allow us to query for
original library files. Regardless, in theory ULO allows us to objects ordered by authors.
query for objects ordered by authors.
\input{applications-q3.tex} \input{applications-q3.tex}
...@@ -324,11 +323,12 @@ of~$A$, that is those works that~$A$ authored that are the most ...@@ -324,11 +323,12 @@ of~$A$, that is those works that~$A$ authored that are the most
important. Sorting the result by number of references might be a good important. Sorting the result by number of references might be a good
start. To get the main contributions, we rate each individual work by start. To get the main contributions, we rate each individual work by
its number of \texttt{ulo:uses} references. Extending the previous its number of \texttt{ulo:uses} references. Extending the previous
{SPARQL}, we can query the database for a ordered list of works, {SPARQL} query, we can ask the database for an ordered list of works,
starting with the one that has the most starting with the one that has the most
references~(Figure~\ref{fig:q2b}). We can formulate~$\mathcal{Q}_3$ references~(Figure~\ref{fig:q2b}). We see that one can
with just one SPARQL query. Because everything is handled by the formulate~$\mathcal{Q}_3$ with just one SPARQL query. Because
database, access should be about as quick as we can hope it to be. everything is handled by the database, access should be about as quick
as we can hope it to be.
While the sparse data set available to use only returned a handful of While the sparse data set available to use only returned a handful of
results, we see that queries like~$\mathcal{Q}_3$ are easily serviced results, we see that queries like~$\mathcal{Q}_3$ are easily serviced
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment