Leveraging the expressivity of grounded conjunctive query languages

Authors:
Alissa Kaplunova;Ralf Möller;Michael Wessel
Affiliations:
Hamburg University of Technology;Hamburg University of Technology;Hamburg University of Technology
Venue:
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Year:
2007

Citing 5
Cited 0

On the decidability of query containment under constraints

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
RQL: a declarative query language for RDF

Proceedings of the 11th international conference on World Wide Web
Querying the Semantic Web: A Formal Approach

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
RACER System Description

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a pragmatic extension of a Semantic Web query language (including so-called grounded conjunctive queries) with a termination safe functional expression language. This addresses problems encountered in daily usage of Semantic Web query languages for which currently no standardized solutions exist, e.g., how to define aggregation operators and used-defined filter predicates. We claim that the solution is very flexible, since users can define and execute ad hoc extensions efficiently and safely on the SemanticWeb reasoning server without having to devise and compile specialized "built-ins" and "plugins" in advance. We also address the scalability aspect by showing how aggregation operators can be realized efficiently in this framework.