Efficient Representation of Very Large Linked Datasets as Graphs

被引:0
|
作者
Krommyda, Maria [1 ]
Kantere, Verena [1 ]
Vassiliou, Yannis [1 ]
机构
[1] Natl Tech Univ Athens, Sch Elect & Comp Engn, Athens, Greece
关键词
Big Data Exploration; Linked Datasets; Graphical Representation;
D O I
10.5220/0009389001060115
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Large linked datasets are nowadays available on many scientific topics of interest and offer invaluable knowledge. These datasets are of interest to a wide audience, people with limited or no knowledge about the Semantic Web, that want to explore and analyse this information in a user-friendly way. Aiming to support such usage, systems have been developed that support such exploration they impose however many limitations as they provide to users access to a limited part of the input dataset either by aggregating information or by exploiting data formats, such as hierarchies. As more linked datasets are becoming available and more people are interested to explore them, it is imperative to provide an user-friendly way to access and explore diverse and very large datasets in an intuitive way, as graphs. We present here an off-line pre-processing technique, divided in three phases, that can transform any linked dataset, independently of size and characteristics to one continuous graph in the two-dimensional space. We store the spatial information of the graph, add the needed indices and provide the graphical information through a dedicated API to support the exploration of the information. Finally, we conduct an experimental analysis to show that our technique can process and represent as one continuous graph large and diverse datasets.
引用
收藏
页码:106 / 115
页数:10
相关论文
共 50 条
  • [1] On the Efficient Representation of Datasets as Graphs to Mine Maximal Frequent Itemsets
    Halim, Zahid
    Ali, Omer
    Khan, Muhammad Ghufran
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (04) : 1674 - 1691
  • [2] Database methods for efficient manipulation of very large datasets
    Ferreira, R
    Sussman, A
    Saltz, J
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, 1999, : 460 - 466
  • [3] Efficient Estimation of Triangles in Very Large Graphs
    Etemadi, Roohollah
    Lu, Jianguo
    Tsin, Yung H.
    CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, : 1251 - 1260
  • [4] Multiresolution representation and deformation of very large volume datasets based on Haar wavelets
    Xavier, Heurtebise
    Sebastien, Thon
    GEOMETRIC MODELING & IMAGING: MODERN TECHNIQUES AND APPLICATIONS, 2008, : 34 - +
  • [5] Improvements to Efficient Retrieval of Very Large Temporal Datasets with the TravelLight Method
    de Carvalho, Alexandre Valle
    Oliveira, Marco Amaro
    Rocha, Artur
    PROCEEDINGS OF THE 2014 9TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI 2014), 2014,
  • [6] Meffil: efficient normalization and analysis of very large DNA methylation datasets
    Min, J. L.
    Hemani, G.
    Smith, G. Davey
    Relton, C.
    Suderman, M.
    BIOINFORMATICS, 2018, 34 (23) : 3983 - 3989
  • [7] Efficient and Effective SPARQL Autocompletion on Very Large Knowledge Graphs
    Bast, Hannah
    Kalmbach, Johannes
    Klumpp, Theresa
    Kramer, Florian
    Schnelle, Niklas
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 2893 - 2902
  • [8] Efficient data representation for a very large pharmaceutical data repository
    Ben-Miled, Z
    Zaitsev, A
    Bukhres, O
    Bem, M
    Jones, R
    Oppelt, R
    COMPUTERS AND THEIR APPLICATIONS, 2000, : 140 - 145
  • [9] Efficient mining of long frequent patterns from very large dense datasets
    Gopalan, RP
    Sucahyo, YG
    DESIGN AND APPLICATION OF HYBRID INTELLIGENT SYSTEMS, 2003, 104 : 652 - 661
  • [10] Multidimensional Scaling With Very Large Datasets
    Paradis, Emmanuel
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2018, 27 (04) : 935 - 939