Sciweavers

611 search results - page 31 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
BMCBI
2008
208views more  BMCBI 2008»
13 years 7 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
SIGMOD
2010
ACM
250views Database» more  SIGMOD 2010»
13 years 8 months ago
Expressive and flexible access to web-extracted data: a keyword-based structured query language
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
Jeffrey Pound, Ihab F. Ilyas, Grant E. Weddell
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 7 months ago
Hierarchical Bag of Paths for Kernel Based Shape Classification
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
François-Xavier Dupé, Luc Brun
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 10 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...