768 search results - page 31 / 154 » Efficient Correlation Search from Graph Databases |
173
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
142
click to vote
BMCBI
2011
14 years 3 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
206
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
160
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
105
click to vote
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...