Sciweavers

122 search results - page 15 / 25
» Spatial Joins and R-trees
Sort
View
DKE
2006
123views more  DKE 2006»
13 years 7 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
GIS
2005
ACM
14 years 8 months ago
Finding corresponding objects when integrating several geo-spatial datasets
When integrating geo-spatial datasets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). Algorithms for...
Catriel Beeri, Yerach Doytsher, Yaron Kanza, Eliya...
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
14 years 1 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....
SSD
1999
Springer
99views Database» more  SSD 1999»
13 years 12 months ago
Algorithms for Joining R-Trees and Linear Region Quadtrees
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
HPDC
1996
IEEE
13 years 12 months ago
Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone
One purpose of the MBone is to study the performance of multicast and real-time protocols in global conferencing applications. Part of this evaluation is dependent on understandin...
Kevin C. Almeroth, Mostafa H. Ammar