390 search results - page 13 / 78 » Approximate Query Answering in Locally Closed Databases |
ICDT
1995
ACM
15 years 1 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
190
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
163
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
DASFAA
2004
IEEE
15 years 1 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...