L. Cheng
A two-tier index architecture for fast processing large RDF data over distributed memory
Cheng, L.; Kotoulas, S.; Ward, T.; Theodoropoulos, G.
Authors
S. Kotoulas
T. Ward
G. Theodoropoulos
Abstract
We propose an efficient method for fast processing large RDF data over distributed memory. Our approach adopts a two-tier index architecture on each computation node: (1) a light-weight primary index, to keep loading times low, and (2) a dynamic, multi-level secondary index, calculated as a by-product of query execution, to decrease or remove inter-machine data movement for subsequent queries that contain the same graph patterns. Experimental results on a commodity cluster show that we can load large RDF data very quickly in memory while remaining within an interactive range for query processing with the secondary index.
Citation
Cheng, L., Kotoulas, S., Ward, T., & Theodoropoulos, G. (2014). A two-tier index architecture for fast processing large RDF data over distributed memory. In HT'14 : proceedings of the 25th ACM Conference on Hypertext and Social Media : September 1-4, 2014, Santiago, Chile (300-302). https://doi.org/10.1145/2631775.2631789
Conference Name | 25th ACM conference on Hypertext and social media - HT '14 |
---|---|
Conference Location | Santiago, Chile |
Start Date | Sep 1, 2014 |
End Date | Sep 4, 2014 |
Online Publication Date | Sep 1, 2014 |
Publication Date | Sep 1, 2014 |
Deposit Date | Apr 21, 2016 |
Publicly Available Date | Apr 28, 2016 |
Pages | 300-302 |
Book Title | HT'14 : proceedings of the 25th ACM Conference on Hypertext and Social Media : September 1-4, 2014, Santiago, Chile. |
DOI | https://doi.org/10.1145/2631775.2631789 |
Files
Accepted Conference Proceeding
(0)
PDF
Copyright Statement
© 2014 ACM. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Long Cheng, Spyros Kotoulas, Tomas E. Ward, and Georgios Theodoropoulos. 2014. A two-tier index architecture for fast processing large RDF data over distributed memory. In Proceedings of the 25th ACM conference on Hypertext and social media (HT '14). ACM, New York, NY, USA, 300-302. DOI=http://dx.doi.org/10.1145/2631775.2631789
You might also like
Efficient Comparison of Massive Graphs Through The Use Of 'Graph Fingerprints'
(2016)
Conference Proceeding
Towards large-scale what-if traffic simulation with exact-differential simulation
(2015)
Conference Proceeding
Data Quality Assessment and Anomaly Detection Via Map / Reduce and Linked Data: A Case Study in the Medical Domain
(2015)
Conference Proceeding
Fast Compression of Large Semantic Web Data using X10
(2015)
Journal Article
Towards an Info-Symbiotic Decision Support System for Disaster Risk Management
(2015)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search