8 search results - page 2 / 2 » Finding Top-k Min-Cost Connected Trees in Databases |
175
Voted
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
203
Voted
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
178
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...