768 search results - page 7 / 154 » Efficient Correlation Search from Graph Databases |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
185
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
BIBM
2009
IEEE
15 years 4 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
175
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...