Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey of community search over big graphs
With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …
many real applications (eg, social media and knowledge bases). An important component of …
Keyword search on large graphs: A survey
With the prevalence of Internet access and online services, various big graphs are
generated in many real applications (eg, online social networks and knowledge graphs). An …
generated in many real applications (eg, online social networks and knowledge graphs). An …
[PDF][PDF] Effective community search for large attributed graphs
Given a graph G and a vertex q∈ G, the community search query returns a subgraph of G
that contains vertices related to q. Communities, which are prevalent in attributed graphs …
that contains vertices related to q. Communities, which are prevalent in attributed graphs …
Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data
Conventional keyword search engines are restricted to a given data model and cannot
easily adapt to unstructured, semi-structured or structured data. In this paper, we propose an …
easily adapt to unstructured, semi-structured or structured data. In this paper, we propose an …
Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying
information needs. Recently, answering keyword queries on graph-structured data has …
information needs. Recently, answering keyword queries on graph-structured data has …
TEDI: efficient shortest path query answering on graphs
Efficient shortest path query answering in large graphs is enjoying a growing number of
applications, such as ranked keyword search in databases, social networks, ontology …
applications, such as ranked keyword search in databases, social networks, ontology …
Mechanisms for searching enterprise data graphs
N Raghavan, R Murthy, A Naimat - US Patent 8,682,932, 2014 - Google Patents
Highly relevant search results for unstructured queries are efficiently identified from
normalized data. A server graphs relationships between each of the data objects. For each …
normalized data. A server graphs relationships between each of the data objects. For each …
Naga: Searching and ranking knowledge
The Web has the potential to become the world's largest knowledge base. In order to
unleash this potential, the wealth of information available on the Web needs to be extracted …
unleash this potential, the wealth of information available on the Web needs to be extracted …
Effective and efficient attributed community search
Given a graph G and a vertex q ∈ G q∈ G, the community search query returns a subgraph
of G that contains vertices related to q. Communities, which are prevalent in attributed …
of G that contains vertices related to q. Communities, which are prevalent in attributed …
Nema: Fast graph search with label similarity
It is increasingly common to find real-life data represented as networks of labeled,
heterogeneous entities. To query these networks, one often needs to identify the matches of …
heterogeneous entities. To query these networks, one often needs to identify the matches of …