306 search results - page 37 / 62 » Mining tree queries in a graph |
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
BMCBI
2006
13 years 8 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
CONCUR
2006
Springer
13 years 10 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
DMIN
2006
13 years 9 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...