1890 search results - page 233 / 378 » Querying Big Data by Accessing Small Data |
SIGMOD
1998
ACM
15 years 3 months ago
1998
ACM
The Web is based on a browsing paradigm that makes it di cult to retrieve and integrate data from multiple sites. Today, the only way to achieve this integration is by building sp...
107
click to vote
KDD
2000
ACM
15 years 2 months ago
2000
ACM
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
KDD
2001
ACM
15 years 11 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
SIGMOD
2009
ACM
15 years 6 months ago
2009
ACM
Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only th...