Full-text support for publish/subscribe ontology systems

0Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this work, we envision a publish/subscribe ontology system that is able to index large numbers of expressive continuous queries and filter them against RDF data that arrive in a streaming fashion. To this end, we propose a SPARQL extension that supports the creation of full-text continuous queries and propose a family of main-memory query indexing algorithms which perform matching at low complexity and minimal filtering time. We experimentally compare our approach against a state-of-the-art competitor (extended to handle indexing of full-text queries) both on structural and full-text tasks using real-world data. Our approach proves two orders of magnitude faster than the competitor in all types of filtering tasks.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Zervakis, L., Tryfonopoulos, C., Skiadopoulos, S., & Koubarakis, M. (2016). Full-text support for publish/subscribe ontology systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9678, pp. 233–249). Springer Verlag. https://doi.org/10.1007/978-3-319-34129-3_15

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 6

60%

Professor / Associate Prof. 2

20%

Researcher 2

20%

Readers' Discipline

Tooltip

Computer Science 9

82%

Economics, Econometrics and Finance 1

9%

Linguistics 1

9%

Save time finding and organizing research with Mendeley

Sign up for free