Sciweavers

107 search results - page 9 / 22
» Proximity Rank Join
Sort
View
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
14 years 2 months ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
DMSN
2005
ACM
13 years 10 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
WWW
2006
ACM
14 years 9 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
ICDE
2008
IEEE
140views Database» more  ICDE 2008»
14 years 10 months ago
Top-k Spatial Joins of Probabilistic Objects
Probabilistic data have recently become popular in applications such as scientific and geospatial databases. For images and other spatial datasets, probabilistic values can capture...
Vebjorn Ljosa, Ambuj K. Singh
DAM
2010
137views more  DAM 2010»
13 years 8 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...