RDF aggregate queries and views

Edward Hung*, Yu Deng, V. S. Subrahmanian

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

26 Scopus citations

Abstract

Resource Description Framework (RDF) is a rapidly expanding web standard. RDF databases attempt to track the massive amounts of web data and services available. In this paper, we study the problem of aggregate queries. We develop an algorithm to compute answers to aggregate queries over RDF databases and algorithms to maintain views involving those aggregates. Though RDF data can be stored in a standard relational DBMS (and hence we can execute standard relational aggregate queries and view maintenance methods on them), we show experimentally that our algorithms that operate directly on the RDF representation exhibit significantly superior performance.

Original languageEnglish (US)
Title of host publicationProceedings - 21st International Conference on Data Engineering, ICDE 2005
Pages717-728
Number of pages12
DOIs
StatePublished - 2005
Externally publishedYes
Event21st International Conference on Data Engineering, ICDE 2005 - Tokyo, Japan
Duration: Apr 5 2005Apr 8 2005

Publication series

NameProceedings - International Conference on Data Engineering
ISSN (Print)1084-4627

Conference

Conference21st International Conference on Data Engineering, ICDE 2005
Country/TerritoryJapan
CityTokyo
Period4/5/054/8/05

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Fingerprint

Dive into the research topics of 'RDF aggregate queries and views'. Together they form a unique fingerprint.

Cite this