Sciweavers

493 search results - page 70 / 99
» Graph Database Indexing Using Structured Graph Decomposition
Sort
View
SIGMOD
2009
ACM
139views Database» more  SIGMOD 2009»
14 years 8 months ago
Vispedia: on-demand data integration for interactive visualization and exploration
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
Bryan Chan, Justin Talbot, Leslie Wu, Nathan Sakun...
APBC
2007
110views Bioinformatics» more  APBC 2007»
13 years 9 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
13 years 11 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 23 days ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
IS
2007
13 years 7 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis