|
Published Articles >> Table of Contents >> Abstract
21st International Conference on Data Engineering (ICDE'05)
pp. 717-728
RDF Aggregate Queries and Views
Edward Hung, University of Maryland at College Park
Yu Deng, University of Maryland at College Park
V. S. Subrahmanian, University of Maryland at College Park
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.121
Send link to a friend
| 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.
|
 Additional Information
|
Citation:
Edward Hung, Yu Deng, V. S. Subrahmanian,
"RDF Aggregate Queries and Views,"
icde,
pp. 717-728,
21st International Conference on Data Engineering (ICDE'05),
2005
|
|
