785 search results - page 119 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
175
Voted
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
162
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
173
click to vote
WWW
2003
ACM
16 years 6 months ago
2003
ACM
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
131
click to vote
DEXAW
2003
IEEE
15 years 11 months ago
2003
IEEE
An essential problem for biologists is the processing and evaluation of BLAST results. We advocate the deployment of database technology and describe a userdriven tool, called Bla...
137
click to vote
COLING
1996
15 years 7 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...