P-LUPOSDATE: Using Precomputed Bloom Filters to Speed Up SPARQL Processing in the Cloud

Sven Groppe, Thomas Kiencke, Stefan Werner, Dennis Heinrich, Marc Stelzner, Le Gruenwald

Abstract

Increasingly data on the Web is stored in the form of Semantic Web data. Because of today’s information overload, it becomes very important to store and query these big datasets in a scalable way and hence in a distributed fashion. Cloud Computing offers such a distributed environment with dynamic reallocation of computing and storing resources based on needs. In this work we introduce a scalable distributed Semantic Web database in the Cloud. In order to reduce the number of (unnecessary) intermediate results early, we apply bloom filters. Instead of computing bloom filters, a time-consuming task during query processing as it has been done traditionally, we precompute the bloom filters as much as possible and store them in the indices besides the data. The experimental results with data sets up to 1 billion triples show that our approach speeds up query processing significantly and sometimes even reduces the processing time to less than half.
Original languageEnglish
JournalOpen Journal of Semantic Web (OJSW)
Volume1
Issue number2
Pages (from-to)25-55
Number of pages31
ISSN2199-336X
Publication statusPublished - 2014

Research Areas and Centers

  • Research Area: Intelligent Systems
  • Centers: Center for Artificial Intelligence Luebeck (ZKIL)

DFG Research Classification Scheme

  • 409-06 Information Systems, Process and Knowledge Management
  • 409-04 Operating, Communication, Database and Distributed Systems

Fingerprint

Dive into the research topics of 'P-LUPOSDATE: Using Precomputed Bloom Filters to Speed Up SPARQL Processing in the Cloud'. Together they form a unique fingerprint.

Cite this