Sciweavers

76 search results - page 5 / 16
» Closure-Tree: An Index Structure for Graph Queries
Sort
View
SEMWEB
2007
Springer
14 years 2 months ago
YARS2: A Federated Repository for Querying Graph Structured Data from the Web
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...
Andreas Harth, Jürgen Umbrich, Aidan Hogan, S...
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
12 years 11 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
BMCBI
2010
183views more  BMCBI 2010»
13 years 8 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 10 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 6 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...