Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Linked data on the web (LDOW2008)
Proceedings of the 17th international conference on World Wide Web
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Compact representation of large RDF data sets for publishing and exchange
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Compressed string dictionaries
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Characterizing the semantic web on the web
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Compression of RDF dictionaries
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Querying RDF dictionaries in compressed space
ACM SIGAPP Applied Computing Review
Towards an architecture for managing big semantic data in real-time
ECSA'13 Proceedings of the 7th European conference on Software Architecture
| Hi-index | 0.00 |
Huge RDF datasets are currently exchanged on textual RDF formats, hence consumers need to post-process them using RDF stores for local consumption, such as indexing and SPARQL query. This results in a painful task requiring a great effort in terms of time and computational resources. A first approach to lightweight data exchange is a compact (binary) RDF serialization format called HDT . In this paper, we show how to enhance the exchanged HDT with additional structures to support some basic forms of SPARQL query resolution without the need of "unpacking" the data. Experiments show that i) with an exchanging efficiency that outperforms universal compression, ii) post-processing now becomes a fast process which iii) provides competitive query performance at consumption.