The ICS-FORTH RDFsuite: managing voluminous RDF description bases

Published 1 May 2001

Sofia Alexaki, Vassilis Christophides, Gregory Karvounarakis, Dimitris Plexousakis, Karsten Tolle

Citations239

TL;DR

This paper advocate the use of database technology to support declarative access, as well as, logical and physical independence for voluminous RDF description bases, and presents RDFSuite, a suite of tools for RDF validation, storage and querying.

Abstract

resources available on corporate intranets or the Internet. The Resource Description Framework (RDF) aims at facilitating the creation and exchange of metadata as any other Web data. The growing number of available information resources and the proliferation of description services in various user communities, lead nowadays to large volumes of RDF metadata. Managing such RDF resource descriptions and schemas with existing low-level APIs and le-based implementations does not ensure fast deployment and easy maintenance of real-scale RDF applications. In this paper, we advocate the use of database technology to support declarative access, as well as, logical and physical independence for voluminous RDF description bases.

Keywords

Computer Science

Data on the Web: From Relations to Semistructured Data and XML

1,064 Citations1999Serge Abiteboul, Peter Buneman +1 more

A Syntax for Data: Typing semistructured data and the Lore system and database products supporting XML are explained.

Information and ComputationA semantics of multiple inheritance

625 Citations1988Luca Cardelli

A Performance Evaluation of Alternative Mapping Schemes for Storing XML Data in a Relational Database

210 Citations1999Daniela Florescu, Donald Kossmann

This paper studies how XML data can be stored and queried using a standard relational database system and presents alternative mapping schemes to store XML data in a relational database and discusses how XML-QL queries can be translated into SQL queries for every mapping scheme.

View PDF

ACM SIGMOD RecordThe design and performance evaluation of alternative XML storage strategies

170 Citations2002Feng Tian, David J. DeWitt +2 more

This paper studies five strategies for storing XML documents including one that leaves documents in the file system, three that use a relational database system, and one that uses an object manager.

Symposium on Discrete AlgorithmsCompact labeling schemes for ancestor queries

155 Citations2001Serge Abiteboul, Haim Kaplan +1 more

This paper proposes a labeling scheme with maximum label size close to 3/2 log n, which is close to the lower bound of log n that follows from the fact that different vertices must have different labels.

Workshops in computingNested Queries in Object Bases

106 Citations1994Sophie Cluet, Guido Moerkotte

This paper contains the first (to the authors' knowledge) proposal to optimize nested queries in the object-oriented context and translates queries to nested algebraic expressions to allow for more efficient evaluation.

Evaluating queries with generalized path expressions

86 Citations1996Vassilis Christophides, Sophie Cluet +1 more

An object algebra is extended with two new operators and some interesting rewriting techniques for queries featuring generalized path expressions are presented and it is shown how a query optimizer can integrate the new techniques.

Query + Metadata + Logic = Metalog.

30 Citations1998Massimo Marchiori, Janne Saarela

This paper will demonstrate how a new querying language, Metalog, allows users to write inference rules and queries in English-like syntax and demonstrate how these reasoning rules have equivalent representation both as RDF descriptions and as logic programs.

IEEE Transactions on Software EngineeringEfficient algorithms for the instantiated transitive closure queries

26 Citations1991Ghassan Z. Qadah, Lawrence J. Henschen +1 more

The study reveals that the relative performance of the algorithms is a strong function of the parameters which characterize the processed TC query and the relation referenced by that query.