Log In Sign Up

Compressed Indexes for Fast Search of Semantic Data

by   Raffaele Perego, et al.

The sheer increase in volume of RDF data demands efficient solutions for the triple indexing problem, that is devising a compressed data structure to compactly represent RDF triples by guaranteeing, at the same time, fast pattern matching operations. This problem lies at the heart of delivering good practical performance for the resolution of complex SPARQL queries on large RDF datasets. In this work, we propose a trie-based index layout to solve the problem and introduce two novel techniques to reduce its space of representation for improved effectiveness. The extensive experimental analysis conducted over a wide range of publicly available real-world datasets, reveals that our best space/time trade-off configuration substantially outperforms existing solutions at the state-of-the-art, by taking 30 60 and speeding up query execution by a factor of 2 81X.


page 1

page 2

page 3

page 4


Compressed Indexing with Signature Grammars

The compressed indexing problem is to preprocess a string S of length n ...

String Indexing with Compressed Patterns

Given a string S of length n, the classic string indexing problem is to ...

Using Compressed Suffix-Arrays for a Compact Representation of Temporal-Graphs

Temporal graphs represent binary relationships that change along time. T...

Space/time-efficient RDF stores based on circular suffix sorting

In recent years, RDF has gained popularity as a format for the standardi...

On Slicing Sorted Integer Sequences

Representing sorted integer sequences in small space is a central proble...

Compact Representations of Event Sequences

We introduce a new technique for the efficient management of large seque...

FAST: Frequency-Aware Spatio-Textual Indexing for In-Memory Continuous Filter Query Processing

Many applications need to process massive streams of spatio-textual data...