25041 search results - page 4469 / 5009 » Algorithms for Clustering Data |
278
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
In-network sensor query processing systems (ISQPs), or sensor databases, have been developed to acquire, process and aggregate data from wireless sensor networks (WSNs). Because W...
271
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
264
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
338
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
193
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...