![]() This article describes the design, implementation in addition to the performance evaluation of DG-SPARQL, a distributed, hybrid and adaptive parallel execution engine of G-SPARQL queries. In general, a main limitation of centralized systems is that their vertical scalability is always restricted by the physical limits of computer systems. G-SPARQL supports various types of graph querying operations including reachability, pattern matching and shortest path where any G-SPARQL query may include value-based predicates on the descriptive information (attributes) of the graph edges/vertices in addition to the structural predicates. G-SPARQL has been proposed as an expressive language, with a centralized execution engine, for querying attributed graphs. Such type of graphs are referred to as attributed graphs. In practice, in many real-world graphs, the graph vertices and edges need to be associated with descriptive attributes. A distributed query execution engine of big attributed graphs.īatarfi, Omar Elshawi, Radwa Fayoumi, Ayman Barnawi, Ahmed Sakr, SherifĪ graph is a popular data model that has become pervasively used for modeling structural relationships between objects.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |