Sciweavers

785 search results - page 12 / 157
» Binary Join Trees
Sort
View
SSD
1999
Springer
97views Database» more  SSD 1999»
15 years 1 months ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
SIAMDM
2008
99views more  SIAMDM 2008»
14 years 9 months ago
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
AOSD
2003
ACM
15 years 2 months ago
A case for statically executable advice: checking the law of demeter with AspectJ
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
Karl J. Lieberherr, David H. Lorenz, Pengcheng Wu
EDBT
2008
ACM
129views Database» more  EDBT 2008»
15 years 9 months ago
Continuous multi-way joins over distributed hash tables
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...
Stratos Idreos, Erietta Liarou, Manolis Koubarakis
DANTE
1999
IEEE
149views Database» more  DANTE 1999»
15 years 1 months ago
Parallel R-Tree Spatial Join for a Shared-Nothing Architecture
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This...
Lawrence Mutenda, Masaru Kitsuregawa