A non-blocking parallel spatial join algorithm

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2002, Pages 697-705

  Luo, Gang ^a   Naughton, Jeffrey F ^a   Ellmann, Curt J ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; SOFTWARE PROTOTYPING;

NON-BLOCKING PARALLEL SPATIAL JOIN ALGORITHMS;

QUERY LANGUAGES;

EID: 0036203052     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. The R*-Tree: An efficient and robust access method for points and rectangles
2. Parallel database systems: The future of high performance database systems
3. Data redundancy and duplicate detection in spatial join processing
4. Multidimensional access methods
5. Query evaluation techniques for large databases
6. R-trees: A dynamic index structure for spatial searching
7. Techniques for online exploration of large object-relational datasets
8. Interactive data analysis: The control project
9. Adaptive query processing: Technology in evolution
10. Ripple joins for online aggregation
11. Online aggregation
12. Incremental distance join algorithms for spatial databases
13. An adaptive query execution system for data integration
14. Partition based spatial-merge join
15. Building a scaleable geo-spatial DBMS: Technology, implementation, and evaluation
16. Spatial join indices
17. The sequoia 2000 benchmark
18. Designing and mining multi-terabyte astronomy archives: The sloan digital sky survey
19. Adaptive multi-stage distance join processing