Paper Info
Title
Continuous RDF query processing over DHTs
Abstract
We study the continuous evaluation of conjunctive triple pattern queries over RDF data stored in distributed hash tables. In a continuous query scenario network nodes subscribe with long-standing queries and receive answers whenever RDF triples satisfying their queries are published. We present two novel query processing algorithms for this scenario and analyze their properties formally. Our performance goal is to have algorithms that scale to large amounts of RDF data, distribute the storage and query processing load evenly and incur as little network traffic as possible. We discuss the various performance tradeoffs that occur through a detailed experimental evaluation of the proposed algorithms.
Year
DOI
Venue
2007
10.1007/978-3-540-76298-0_24
ISWC/ASWC
Keywords
Field
DocType
rdf data,continuous query scenario network,conjunctive triple pattern query,continuous evaluation,continuous rdf query processing,rdf triple,novel query processing algorithm,network traffic,detailed experimental evaluation,query processing load,long-standing query,satisfiability,distributed hash table
Query optimization,Data mining,RDF query language,Query language,Query expansion,Computer science,Range query (data structures),Web query classification,Theoretical computer science,SPARQL,Spatial query,Database
Conference
Volume
ISSN
ISBN
4825
0302-9743
3-540-76297-3
Citations 
PageRank 
References 
18
0.95
16
Authors
3
Name
Order
Citations
PageRank
Erietta Liarou118410.81
Stratos Idreos2107963.03
Manolis Koubarakis32790322.32