443 search results - page 78 / 89 » System P: Completeness-driven Query Answering in Peer Data M... |
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
ICDE
2000
IEEE
13 years 11 months ago
2000
IEEE
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...
BIBE
2003
IEEE
14 years 23 days ago
2003
IEEE
We examine the organizational impact on phylogenetic databases of the increasing sophistication in the need and use of phylogenetic data. A primary issue is the use of the unnorma...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...