18 search results - page 3 / 4 » Pruning Relations for Substructure Discovery of Multi-relati... |
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
KAIS
2006
13 years 5 months ago
2006
Generating captions or annotations automatically for still images is a challenging task. Traditionally, techniques involving higher-level (semantic) object detection and complex f...
ICDM
2009
IEEE
13 years 3 months ago
2009
IEEE
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...