Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Survey of graph database models
Graph database models can be defined as those in which data structures for the schema
and instances are modeled as graphs or generalizations of them, and data manipulation is …
and instances are modeled as graphs or generalizations of them, and data manipulation is …
Provenance and scientific workflows: challenges and opportunities
Provenance in the context of workflows, both for the data they derive and for their
specification, is an essential component to allow for result reproducibility, sharing, and …
specification, is an essential component to allow for result reproducibility, sharing, and …
Graph matching networks for learning the similarity of graph structured objects
This paper addresses the challenging problem of retrieval and matching of graph structured
objects, and makes two key contributions. First, we demonstrate how Graph Neural …
objects, and makes two key contributions. First, we demonstrate how Graph Neural …
A comparison of current graph database models
R Angles - 2012 IEEE 28th International Conference on Data …, 2012 - ieeexplore.ieee.org
The limitations of traditional databases, in particular the relational model, to cover the
requirements of current applications has lead the development of new database …
requirements of current applications has lead the development of new database …
A survey of frequent subgraph mining algorithms
Graph mining is an important research area within the domain of data mining. The field of
study concentrates on the identification of frequent subgraphs within graph data sets. The …
study concentrates on the identification of frequent subgraphs within graph data sets. The …
Scalable SPARQL querying of large RDF graphs
The generation of RDF data has accelerated to the point where many data sets need to be
partitioned across multiple machines in order to achieve reasonable performance when …
partitioned across multiple machines in order to achieve reasonable performance when …
An in-depth comparison of subgraph isomorphism algorithms in graph databases
J Lee, WS Han, R Kasperovics, JH Lee - Proceedings of the VLDB …, 2012 - dl.acm.org
Finding subgraph isomorphisms is an important problem in many applications which deal
with data modeled as graphs. While this problem is NP-hard, in recent years, many …
with data modeled as graphs. While this problem is NP-hard, in recent years, many …
A survey of schema-based matching approaches
P Shvaiko, J Euzenat - Journal on data semantics IV, 2005 - Springer
Schema and ontology matching is a critical problem in many application domains, such as
semantic web, schema/ontology integration, data warehouses, e-commerce, etc. Many …
semantic web, schema/ontology integration, data warehouses, e-commerce, etc. Many …
Graph indexing: a frequent structure-based approach
Graph has become increasingly important in modelling complicated structures and
schemaless data such as proteins, chemical compounds, and XML documents. Given a …
schemaless data such as proteins, chemical compounds, and XML documents. Given a …
Comparing stars: On approximating graph edit distance
Graph data have become ubiquitous and manipulating them based on similarity is essential
for many applications. Graph edit distance is one of the most widely accepted measures to …
for many applications. Graph edit distance is one of the most widely accepted measures to …