333 search results - page 46 / 67 » Read-Once Functions and Query Evaluation in Probabilistic Da... |
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
100
click to vote
BMCBI
2005
14 years 11 months ago
2005
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
104
Voted
VLDB
1994
ACM
15 years 3 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
TPDS
1998
14 years 11 months ago
1998
—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These data...
187
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...