Aoran Li1, Xinmeng Wang1, Xueliang Wang4, Bohan Li1,2,3,*
Journal on Big Data, Vol.2, No.4, pp. 157-166, 2020, DOI:10.32604/jbd.2020.010358
- 24 December 2020
Abstract The rigid structure of the traditional relational database leads to data
redundancy, which seriously affects the efficiency of the data query and cannot
effectively manage massive data. To solve this problem, we use distributed
storage and parallel computing technology to query RDF data. In order to
achieve efficient storage and retrieval of large-scale RDF data, we combine the
respective advantage of the storage model of the relational database and the
distributed query. To overcome the disadvantages of storing and querying RDF
data, we design and implement a breadth-first path search algorithm based on the
keyword More >
Login
Register
