A Two-tier Index Architecture for Fast Processing Large RDF Data over Distributed Memory

Aus International Center for Computational Logic
Version vom 26. Oktober 2014, 19:35 Uhr von Long Cheng (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorNachname=Cheng |ErsterAutorVorname=Long |FurtherAuthors=Spyros Kotoulas ; Tomas E. Ward ; Georgios Theodoropoulos }} {{I…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

A Two-tier Index Architecture for Fast Processing Large RDF Data over Distributed Memory

Long ChengLong Cheng,  Spyros KotoulasSpyros Kotoulas,  Tomas E. WardTomas E. Ward,  Georgios TheodoropoulosGeorgios Theodoropoulos
Long Cheng, Spyros Kotoulas, Tomas E. Ward, Georgios Theodoropoulos
A Two-tier Index Architecture for Fast Processing Large RDF Data over Distributed Memory
Proc. 25th ACM International Conference on Hypertext and Social Media (HT'14), November 2014. ACM
  • KurzfassungAbstract
    The performance of parallel distributed data management systems becomes increasingly important with the rise of Big Data. Parallel joins have been widely studied both in the parallel processing and the database communities. Nevertheless, most of the algorithms so far developed do not consider the data skew, which naturally exists in various applications. State of the art methods designed to handle this problem are based on extensions to either of the two prevalent conventional approaches to parallel joins - the hash-based and duplication-based frameworks. In this paper, we introduce a novel parallel join framework, query-based distributed join (QbDJ), for handling data skew on distributed architectures. Further, we present an efficient implementation of the method based on the asynchronous partitioned global address space (APGAS) parallel programming model. We evaluate the performance of our approach on a cluster of 192 cores (16 nodes) and datasets of 1 billion tuples with different skews. The results show that the method is scalable, and also runs faster with less network communication compared to state-of-art PRPD approach in [1] under high data skew.
  • Weitere Informationen unter:Further Information: Link
  • Forschungsgruppe:Research Group: Knowledge SystemsKnowledge-Based Systems
@inproceedings{CKWT2014,
  author    = {Long Cheng and Spyros Kotoulas and Tomas E. Ward and Georgios
               Theodoropoulos},
  title     = {A Two-tier Index Architecture for Fast Processing Large {RDF}
               Data over Distributed Memory},
  booktitle = {Proc. 25th {ACM} International Conference on Hypertext and Social
               Media (HT'14)},
  publisher = {ACM},
  year      = {2014},
  month     = {November},
  doi       = {10.1145/2631775.2631789}
}