282 search results - page 31 / 57 » Merging Databases Under Constraints |
195
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
215
click to vote
VLDB
2001
ACM
16 years 3 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
120
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
227
click to vote
VLDB
2005
ACM
16 years 3 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
125
click to vote
BTW
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We propose a scaleable multi-user benchmark called XMach-1 (XML Data Management benchmark) for evaluating the performance of XML data management systems. It is based on a...