Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Neumann, Thomas
Weikum, Gerhard

dblp
dblp



Editor(s):

Binning, Carsten
Dageville, Benoit

dblp
dblp

Not MPII Editor(s):

Binning, Carsten
Dageville, Benoit

BibTeX cite key*:

Neumann2009SIGMODb

Title, Booktitle

Title*:

Scalable Join Processing on Very Large RDF Graphs

Booktitle*:

SIGMOD-PODS'09 : Compilation Proceedings of the International Conference on Management of Data & 28th Symposium on Principles of Database Systems

Event, URLs

URL of the conference:

http://www.sigmod09.org/

URL for downloading the paper:

http://doi.acm.org/10.1145/1559845.1559911

Event Address*:

Providence, USA

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

29 June 2009

Event End Date:

2 July 2009

Publisher

Name*:

ACM

URL:


Address*:

New York, NY

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

627-640

Year*:

2009

VG Wort Pages:

46

ISBN/ISSN:

978-1-60558-554-3

Sequence Number:


DOI:

10.1145/1559845.1559911



Note, Abstract, ©


(LaTeX) Abstract:

With the proliferation of the RDF data format, engines for
RDF query processing are faced with very large graphs that contain
hundreds of millions of RDF triples. This paper addresses the
resulting scalability problems. Recent prior work along these lines
has focused on indexing and other physical-design issues.
The current paper focuses on join processing, as the fine-grained
and schema-relaxed use of RDF often entails star- and chain-shaped
join queries with many input streams from index scans.

We present two contributions for scalable join processing.
First, we develop very light-weight methods for sideways information
passing between separate joins at query run-time, to provide highly effective filters
on the input streams of joins.
Second, we improve previously proposed algorithms for join-order optimization
by more accurate selectivity estimations for very large RDF graphs.
Experimental studies with several RDF datasets, including the UniProt
collection, demonstrate the performance gains of our approach,
outperforming the previously fastest systems by more than an order of magnitude.

Keywords:

RDF, Query Processing



Download
Access Level:

Institute

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Neumann2009SIGMODb,
AUTHOR = {Neumann, Thomas and Weikum, Gerhard},
EDITOR = {Binning, Carsten and Dageville, Benoit},
TITLE = {Scalable Join Processing on Very Large {RDF} Graphs},
BOOKTITLE = {SIGMOD-PODS'09 : Compilation Proceedings of the International Conference on Management of Data & 28th Symposium on Principles of Database Systems},
PUBLISHER = {ACM},
YEAR = {2009},
PAGES = {627--640},
ADDRESS = {Providence, USA},
ISBN = {978-1-60558-554-3},
DOI = {10.1145/1559845.1559911},
}


Entry last modified by Anja Becker, 03/17/2011
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
03/23/2009 04:29:59 PM
Revisions
7.
6.
5.
4.
3.
Editor(s)
Anja Becker
Anja Becker
Thomas Neumann
Martin Theobald
Martin Theobald
Edit Dates
17.03.2011 16:10:54
23.03.2010 13:15:36
01/26/2010 04:34:46 PM
04/16/2009 01:57:57 PM
04/16/2009 01:57:45 PM