English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  On Defining SPARQL with Boolean Tensor Algebra

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

Item is

Basic

show hide
Genre: Paper
Latex : On Defining {SPARQL} with {B}oolean Tensor Algebra

Files

show Files
hide Files
:
1503.00301.pdf (Preprint), 234KB
Name:
1503.00301.pdf
Description:
File downloaded from arXiv at 2015-03-05 08:34
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Metzler, Saskia1, Author           
Miettinen, Pauli1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: Computer Science, Databases, cs.DB
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2015-03-012015-03-03
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 1503.00301
URI: http://arxiv.org/abs/1503.00301
BibTex Citekey: metzler15defining:arxiv
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show