306 search results - page 13 / 62 » Mining tree queries in a graph |
158
Voted
IPL
2010
15 years 4 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
142
click to vote
PKDD
2007
Springer
15 years 12 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
171
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
220
click to vote
PSD
2004
Springer
15 years 11 months ago
2004
Springer
In an on-line statistical database, the query-answering system should prevent answers to statistical queries from leading to disclosure of confidential data. On the other hand, a s...
284
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a system towards the integration of data mining into relational databases. To this end, a relational database model is proposed, based on the so called virtual mining vi...