Pre-processing of RDF data for METIS partitioning

被引：0
作者：
Benhamed S. [1 ,2 ]
Nait-Bahloul S. [3 ]
机构：
[1] LITIO Laboratory, University Oran 1, Ahmed Ben Bella, Oran
[2] Department of Computing and Mathematics, University Abdelhamid Ibn Badis – Mostaganem, Mostaganem
[3] LITIO Laboratory, Department of Computer Science, University Oran 1, Ahmed Ben Bella, Oran
来源：
International Journal of Metadata, Semantics and Ontologies | 2023年 / 16卷 / 02期
关键词：
graph partitioning; METIS; pre-processing; RDF data; RDF graph;
D O I：
10.1504/IJMSO.2023.135345
中图分类号：
学科分类号：
摘要：
The partitioning of RDF data on a large scale allows generating a set of RDF data subgraphs. METIS is a graph partitioning technique that minimises the cost of partitioning. METIS applies, among other things, to RDF graphs. However, the semantics introduced in the description of RDF data is not taken into account in the partitioning process in METIS. For this, we propose in this paper a step of pre-processing RDF data before partitioning these data. The objective of this step is to improve the quality of semantic partitioning of RDF graphs. The evaluation of the RDF pre-processing step for METIS was performed on real and synthetic data. Copyright © 2023 Inderscience Enterprises Ltd.
引用
收藏
页码：152 / 171
页数：19
相关论文
共 28 条
  • [1] Barnard S.T., Simon H.D., A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, pp. 711-718, (1993)
  • [2] Benlic A.U., Hao J.K., Breakout local search for the quadratic assignment problem, Applied Mathematics and Computation, 219, 9, pp. 4800-4815, (2013)
  • [3] Berner-Lee T., What the Semantic Web can Represent, (1998)
  • [4] Bok K., Kim J., Yoo J., Dynamic partitioning supporting load balancing for distributed RDF graph stores, Symmetry, 11, 7, (2019)
  • [5] Galicia J., Mesmoudi A., Bellatreche L., Ordonez C., Reverse partitioning for SPARQL queries: principles and performance analysis, Proceedings of the International Conference on Database and Expert Systems Applications, pp. 174-183, (2019)
  • [6] Guo Y., Pan Z., Heflin J., LUBM: a benchmark for OWL knowledge base systems, Journal of Web Semantics, 3, 2, pp. 158-182, (2005)
  • [7] Gurajada S., Seufert S., Miliaraki I., Theobald M., TriAD: a distributed shared-nothing RDF engine based on asynchronous message passing, Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 289-300, (2014)
  • [8] Huang J., Abadi D.J., Ren K., Scalable SPARQL querying of large RDF graphs, Proceedings of the VLDB Endowment, 4, 11, pp. 1123-1134, (2011)
  • [9] Kalogeros E., Gergatsoulis M., Damigos M., Document-based RDF storage method for parallel evaluation of basic graph pattern queries, International Journal of Metadata, Semantics and Ontologies, 14, 1, pp. 63-80, (2020)
  • [10] Karypis G., Kumar V., A coarse-grain parallel formulation of multilevel k-way graph-partitioning algorithm, Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, (1997)
123