At the dated check, the references listed below either did not resolve in
Crossref or DataCite, or carried a retraction notice. Each one is shown with the
registry record that put it there.
The 9 references without a DOI — listed, not checked
no DOI — not checkedS. Abiteboul, R. Hull and V. Vianu, Foundations of Databases, Addison-Wesley, 1995, http://webdam.inria.fr/Alice/. ISBN 0-201-53771-0.
no DOI — not checkedZ. Akar, T.G. Halaç, E.E. Ekinci and O. Dikenelli, Querying the web of interlinked datasets using VOID descriptions, in: WWW2012 Workshop on Linked Data on the Web, Lyon, France, 16 April, 2012, C. Bizer, T. Heath, T. Berners-Lee and M. Hausenblas, eds, CEUR Workshop Proceedings, Vol. 937, CEUR-WS.org, 2012, http://ceur-ws.org/Vol-937/ldow2012-paper-06.pdf.
no DOI — not checkedC. Basca and A. Bernstein, Avalanche: Putting the spirit of the web back into semantic web querying, in: Proceedings of the ISWC 2010 Posters & Demonstrations Track: Collected Abstracts, Shanghai, China, November 9, 2010, A. Polleres and H. Chen, eds, CEUR Workshop Proceedings, Vol. 658, CEUR-WS.org, 2010, http://ceur-ws.org/Vol-658/paper527.pdf.
no DOI — not checkedH. Betz, F. Gropengießer, K. Hose and K.-U. Sattler, Learning from the history of distributed query processing – A heretic view on linked data management, in: Proceedings of the Third International Workshop on Consuming Linked Data, COLD 2012, Boston, MA, USA, November 12, 2012, J. Sequeda, A. Harth and O. Hartig, eds, CEUR Workshop Proceedings, Vol. 905, CEUR-WS.org, 2012, http://ceur-ws.org/Vol-905/BetzEtAl_COLD2012.pdf.
no DOI — not checkedX. Chen, H. Chen, N. Zhang and S. Zhang, Sparkrdf: Elastic discreted RDF graph processing engine with distributed memory, in: Proceedings of the ISWC 2014 Posters & Demonstrations Track a Track Within the 13th International Semantic Web Conference, ISWC 2014, Riva del Garda, Italy, October 21, 2014, M. Horridge, M. Rospocher and J. van Ossenbruggen, eds, CEUR Workshop Proceedings, Vol. 1272, CEUR-WS.org, 2014, pp. 261–264, http://ceur-ws.org/Vol-1272/paper_43.pdf.
no DOI — not checkedO. Görlitz and S. Staab, SPLENDID: SPARQL endpoint federation exploiting VOID descriptions, in: Proceedings of the Second International Workshop on Consuming Linked Data (COLD2011), Bonn, Germany, October 23, 2011, O. Hartig, A. Harth and J. Sequeda, eds, CEUR Workshop Proceedings, Vol. 782, CEUR-WS.org, 2011, http://ceur-ws.org/Vol-782/GoerlitzAndStaab_COLD2011.pdf.
no DOI — not checkedG. Montoya, M.-E. Vidal and M. Acosta, A heuristic-based approach for planning federated SPARQL queries, in: Proceedings of the Third International Workshop on Consuming Linked Data, COLD 2012, Boston, MA, USA, November 12, 2012, J. Sequeda, A. Harth and O. Hartig, eds, CEUR Workshop Proceedings, Vol. 905, CEUR-WS.org, 2012, http://ceur-ws.org/Vol-905/MontoyaEtAl_COLD2012.pdf.
no DOI — not checkedA.G. Ryman, A. Le Hors and S. Speicher, OSLC resource shape: A language for defining constraints on linked data, in: Proceedings of the WWW2013 Workshop on Linked Data on the Web, Rio de Janeiro, Brazil, 14 May, 2013, C. Bizer, T. Heath, T. Berners-Lee, M. Hausenblas and S. Auer, eds, CEUR Workshop Proceedings, Vol. 996, CEUR-WS.org, 2013, http://ceur-ws.org/Vol-996/papers/ldow2013-paper-02.pdf.
no DOI — not checkedR. Verborgh, M. Vander Sande, P. Colpaert, S. Coppens, E. Mannens and R. Van de Walle, Web-scale querying through linked data fragments, in: Proceedings of the Workshop on Linked Data on the Web Co-Located with the 23rd International World Wide Web Conference (WWW 2014), Seoul, Korea, April 8, 2014, C. Bizer, T. Heath, S. Auer and T. Berners-Lee, eds, CEUR Workshop Proceedings, Vol. 1184, CEUR-WS.org, 2014, http://ceur-ws.org/Vol-1184/ldow2014_paper_04.pdf.
checked 2026-07-25 — re-checked daily as this page is visited;
titles and statuses come from Crossref and DataCite and are not part of the signed record
Both snippets point at the live badge image and link back to this page. The
badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.