ACM Home Page
Please provide us with feedback. Feedback
Transformation-based spatial join
Full text PdfPdf (1.51 MB)
Source Conference on Information and Knowledge Management archive
Proceedings of the eighth international conference on Information and knowledge management table of contents
Kansas City, Missouri, United States
Pages: 15 - 26  
Year of Publication: 1999
ISBN:1-58113-146-1
Authors
Ju-Won Song  Multimedia Technology Research Lab, Korea Telecom, 17 Woomyon-dong, Suchcho-gu, Seoul, 137-792, Korea
Kyu-Young Whang  Department of Computer Science, Advanced Information Technology Research Center, Korea Advanced Institute of Science and Technology
Young-Koo Lee  Department of Computer Science, Advanced Information Technology Research Center, Korea Advanced Institute of Science and Technology
Min-Jae Lee
Sang-Wook Kim  Department of Information and Telecommunications Engineering, Kangwon National University
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGIR: ACM Special Interest Group on Information Retrieval
SIGMIS: ACM Special Interest Group on Management Information Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 24,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/319950.319954
What is a DOI?

ABSTRACT

Spatial join finds pairs of spatial objects having a specific spatial relationship in spatial database systems. A number of spatial join algorithms have recently been proposed in the literature. Most of them, however, perform the join in the original space. Joining in the original space has a drawback of dealing with sizes of objects and thus has difficulty in developing a formal algorithm that does not rely on heuristics. In this paper, we propose a spatial join algorithm based on the transformation technique. An object having a size in the two-dimensional original space is transformed into a point in the four-dimensional transform space, and the join is performed on these point objects. This can be easily extended to n-dimensional cases. We show the excellence of the proposed approach through analysis and extensive experiments. The results show that the proposed algorithm has a performance generally better than that of the R*-based algorithm proposed by Brinkhoff et al. This is a strong indicating that corner transformation preserves clustering among objects and that spatial operations can be performed better in the transform space than in the original space. This reverses the common belief that transformation will adversely affect clustering. We believe that our result will provide a new insight towards transformation-based spatial query processing.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
 
5
 
6
 
7
K. Hinrichs and J. Nievergelt, "The Grid File: A Data Structure Designed to Support Proximity Queries on Spatial Objects," In Proc. Infl Workshop on Graph Theoretic Concepts in Computer Science, pp. 100-113, 1983.
 
8
9
10
 
11
12
13
 
14
15
 
16
 
17
 
18
 
19
 
20
J. W. Song, K. Y. Whang, and S. W. Kim, SpatiaI Join Processing Using Comer Transformation, Tech. Report CS/TR-96-107, Dept. of Computer Science, KAIST, Dec. 1996.
 
21
 
22
K. Y. Whang and R. Krishnamurthy, Multilevel Grid Files, IBM Research Report RC 11516, 1985.
 
23
 
24


Collaborative Colleagues:
Ju-Won Song: colleagues
Kyu-Young Whang: colleagues
Young-Koo Lee: colleagues
Min-Jae Lee: colleagues
Sang-Wook Kim: colleagues