6650 search results - page 437 / 1330 » Mutating database queries |
237
click to vote
BMCBI
2011
14 years 10 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...
300
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
196
click to vote
VLDB
2004
ACM
16 years 3 days ago
2004
ACM
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
173
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
185
click to vote
XSYM
2009
Springer
16 years 1 months ago
2009
Springer
Physical structures, for example indexes and materialized views, can improve query execution performance by orders of magnitude. Hence, it is important to choose the right configu...