de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

On Defining SPARQL with Boolean Tensor Algebra

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons79373

Metzler,  Saskia
Databases and Information Systems, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45046

Miettinen,  Pauli
Databases and Information Systems, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

1503.00301.pdf
(Preprint), 234KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Metzler, S., & Miettinen, P. (2015). On Defining SPARQL with Boolean Tensor Algebra. Retrieved from http://arxiv.org/abs/1503.00301.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0025-054A-9
Abstract
The Resource Description Framework (RDF) represents information as subject-predicate-object triples. These triples are commonly interpreted as a directed labelled graph. We propose an alternative approach, interpreting the data as a 3-way Boolean tensor. We show how SPARQL queries - the standard queries for RDF - can be expressed as elementary operations in Boolean algebra, giving us a complete re-interpretation of RDF and SPARQL. We show how the Boolean tensor interpretation allows for new optimizations and analyses of the complexity of SPARQL queries. For example, estimating the size of the results for different join queries becomes much simpler.