[Profile picture of Ruben Verborgh]

Ruben Verborgh

A Linked Data Fragments approach to prefix search

by Dedecker Ruben, Harm Delva, Pieter Colpaert, and Ruben Verborgh

BibTeX other citation formats

To be published in 2021 in Proceedings of the 21th International Conference on Web Engineering.

Keywords:

Read this article online

Cite this article in your work

Cite this article easily using its BibTeX entry:

@inproceedings{dedecker_icwe_2021,
  author = {Ruben, Dedecker and Delva, Harm and Colpaert, Pieter and Verborgh, Ruben},
  title = {A Linked Data Fragments approach to prefix search},
  booktitle = {Proceedings of the 21th International Conference on Web Engineering},
  year = 2021,
  month = may,
}

Alternatively, pick a reference of your choice below:

IEEE
D. Ruben, H. Delva, P. Colpaert, and R. Verborgh, “A Linked Data Fragments approach to prefix search,” in Proceedings of the 21th International Conference on Web Engineering, 2021. Accepted for publication.
ACM
Dedecker Ruben, Harm Delva, Pieter Colpaert, and Ruben Verborgh. 2021. A Linked Data Fragments approach to prefix search. In Proceedings of the 21th International Conference on Web Engineering. Accepted for publication.
LNCS
Ruben, D., Delva, H., Colpaert, P., Verborgh, R.: A Linked Data Fragments approach to prefix search. In: Proceedings of the 21th International Conference on Web Engineering (2021). Accepted for publication.
APA
Ruben, D., Delva, H., Colpaert, P., & Verborgh, R. (2021, May). A Linked Data Fragments approach to prefix search. Proceedings of the 21th International Conference on Web Engineering. Accepted for publication.
MLA
Ruben, Dedecker, et al. “A Linked Data Fragments Approach to Prefix Search.” Proceedings of the 21th International Conference on Web Engineering, 2021. Accepted for publication.

Discuss this article