960 search results - page 55 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
110
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
213
click to vote
VLDB
2005
ACM
16 years 4 months ago
2005
ACM
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
101
Voted
SNPD
2008
15 years 5 months ago
2008
As processing power becomes cheaper and more available in cluster of computers, the need for parallel algorithm that can harness this computing potentials will increase. One applic...
150
Voted
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
178
click to vote
SPAA
1997
ACM
15 years 8 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...