Sciweavers

91 search results - page 5 / 19
» Scalable computation of acyclic joins
Sort
View
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
14 years 8 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
DEBS
2008
ACM
13 years 9 months ago
BFSiena: a communication substrate for StreamMine
StreamMine is a scalable middleware for massive real-time data streaming. In this paper we present the BFSiena: a communication substrate for the StreamMine. BFSiena is a content-...
Zbigniew Jerzak, Christof Fetzer
ICDCS
2007
IEEE
14 years 1 months ago
Protocol Design for Dynamic Delaunay Triangulation
Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to const...
Dong-Young Lee, Simon S. Lam
WWW
2003
ACM
14 years 8 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
IPPS
2006
IEEE
14 years 1 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien