14649 search results - page 2714 / 2930 » Principles of problem solving |
205
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
224
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
174
click to vote
PODS
2002
ACM
16 years 6 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
170
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
178
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Query-oriented summarization aims at extracting an informative summary from a document collection for a given query. It is very useful to help users grasp the main information rel...