Results 11 to 20 of about 3,015 (169)
SPARQL beyond Subgraph Matching [PDF]
, 2010 We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS, and OWL. The proposed extensions are part of the SPARQL 1.1 Entailment Regimes working draft which is currently being developed as part of the W3C standardization process of SPARQL 1.1.
Glimm, B, Krötzsch, M
openaire +3 more sources
A novel top‐k key node query problem in subgraph matching and its greedy strategy
Engineering Reports, 2022 Top‐k node selection in graph data is an essential problem in computer science and applications. In view of an important issue in the field of graph data, subgraph matching issue, we define the problem and propose its method for the top‐k key node query ...
Zhengyuan Xue
doaj +1 more source
Enhanced subgraph matching for large graphs using candidate region-based decomposition and ordering
Journal of King Saud University: Computer and Information Sciences, 2023 The subgraph matching problem associated with large graphs is an emerging research challenge in graph search due to the growing size of the web, social, and metabolic graphs, and the wide availability of graph databases. Such problems involve finding all
Zubair Ali Ansari +3 more
doaj +1 more source
Determining the Hausdorff Distance Between Trees in Polynomial Time [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 The Hausdorff distance is a relatively new measure of similarity of graphs. The notion of the Hausdorff distance considers a special kind of a common subgraph of the compared graphs and depends on the structural properties outside of the common subgraph.
Aleksander Kelenc
doaj +1 more source
Distributed Subgraph Matching on Big Knowledge Graphs Using Pregel
IEEE Access, 2019 With RDF becoming the de facto standard for representing knowledge graphs, it is indispensable to develop scalable subgraph matching algorithms over big RDF graphs stored in distributed clusters.
Qiang Xu +4 more
doaj +1 more source
Spatiotemporal RDF Data Query Based on Subgraph Matching
ISPRS International Journal of Geo-Information, 2021 Resource Description Framework (RDF), as a standard metadata description framework proposed by the World Wide Web Consortium (W3C), is suitable for modeling and querying Web data.
Xiangfu Meng +3 more
doaj +1 more source
, 2020 Subgraph matching is the problem of determining the presence and location(s) of a given query graph in a large target graph. Despite being an NP-complete problem, the subgraph matching problem is crucial in domains ranging from network science and database systems to biochemistry and cognitive science.
Rex +6 more
openaire +2 more sources
Journal of Cloud Computing: Advances, Systems and Applications, 2020 With the rapid development of mobile edge computing, mobile social networks are gradually infiltrating into our daily lives, in which the communities are an important part of social networks.
Liang Jiang +3 more
doaj +1 more source
Complexity, 2021 Interesting subgraph query aims to find subgraphs that are isomorphic to the given query graph from a data graph and rank the subgraphs according to their interestingness scores.
Xiaohuan Shan +4 more
doaj +1 more source
Supervised chemical graph mining improves drug-induced liver injury prediction
iScience, 2023 Summary: Drug-induced liver injury (DILI) is the main cause of drug failure in clinical trials. The characterization of toxic compounds in terms of chemical structure is important because compounds can be metabolized to toxic substances in the liver ...
Sangsoo Lim +5 more
doaj +1 more source