Modular Web Queries — From Rules to Stores

Uwe, Aßmann; Berger, Sacha; Bry, François; Furche, Tim; Henriksson, Jakob; Johannes, Jendrik (2007): Modular Web Queries — From Rules to Stores. OTM 2007 Workshops, 25. - 30. November 2007, Vilamoura, Portugal.

Abstract

Even with all the progress in Semantic technology, accessing Web data remains a challenging issue with new Web query languages and approaches appearing regularly. Yet most of these languages, including W3C approaches such as XQuery and SPARQL, do little to cope with the explosion of the data size and schemata diversity and richness on the Web. In this paper we propose a straightforward step toward the improvement of this situation that is simple to realize and yet effective: Advanced module systems that make partitioning of (a) the evaluation and (b) the conceptual design of complex Web queries possible. They provide the query programmer with a powerful, but easy to use high-level abstraction for packaging, encapsulating, and reusing conceptually related parts (in our case, rules) of a Web query. The proposed module system combines ease of use thanks to a simple core concept, the partitioning of rules and their consequences in flexible “stores”, with ease of deployment thanks to a reduction semantics. We focus on extending the rule-based Semantic Web query language Xcerpt with such a module system though the same approach can be applied to other (rule-based) languages as well.

• Item Type: Conference or Workshop Item (Paper)
• Form of publication: Postprint
• Published in: Lecture Notes in Computer Science, No. 4806, 2007: pp. 1165-1175
• Faculties: Mathematics, Computer Science and Statistics > Computer Science
• Subjects: 000 Computer science, information and general works > 004 Data processing computer science
• Place of Publication: Berlin u.a.
• Annotation: The final publication is available at link.springer.com
• Language: English