Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation

Park, Ho-Hyun; Cha, Gueesoo; Chung, Chin-Wan

doi:10.1007/3-540-48482-5_15

Cited by 24 publications

(17 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This technique, however, cannot be effectively employed for configuration similarity queries due to the lack of accurate estimations for the number of solutions in case of arbitrary relations. Park et al [1999] proposed a modified version of MFC, and several optimization techniques, which is efficient for multiway spatial joins involving dense data sets and query graphs.…”

Section: Discussionmentioning

confidence: 99%

Approximate spatio-temporal retrieval

Papadias

Mamoulis

Delis

2001

ACM Trans. Inf. Syst.

View full text Add to dashboard Cite

This paper proposes a framework for the handling of spatio-temporal queries with inexact matches, using the concept of relation similarity. We initially describe a binary string encoding for 1D relations that permits the automatic derivation of similarity measures. We then extend this model to various granularity levels and many dimensions, and show that reasoning on spatio-temporal structure is significantly facilitated in the new framework. Finally, we provide algorithms and optimization methods for four types of queries: (i) object retrieval based on some spatio-temporal relations with respect to a reference object, (ii) spatial joins, i.e., retrieval of object pairs that satisfy some input relation, (iii) structural queries, which retrieve configurations matching a particular spatio-temporal structure, and (iv) special cases of motion queries. Considering the current large availability of multidimensional data and the increasing need for flexible query-answering mechanisms, our techniques can be used as the core of spatio-temporal query processors.

show abstract

Section: Discussionmentioning

confidence: 99%

Approximate spatio-temporal retrieval

Papadias

Mamoulis

Delis

2001

ACM Trans. Inf. Syst.

View full text Add to dashboard Cite

show abstract

“…More importantly, the newly created windows w H for a speci®c combination are calculated only once, by applying IF at the previous level, and are passed as parameters. A method similar to IF which optimizes ST for the processing of multiway spatial joins is proposed in Park et al [22]. Figure 18 shows version 3 of ST_SS that uses IF and replaces the multiple intersection tests at apply-selection and space-restriction by one.…”

Section: Optimization Of St_ssmentioning

confidence: 99%

Complex Spatial Query Processing

2004

View full text Add to dashboard Cite

The user of a Geographical Information System is not limited to conventional spatial selections and joins, but may also pose more complicated and descriptive queries. In this paper, we focus on the ef®cient processing and optimization of complex spatial queries that involve combinations of spatial selections and joins. Our contribution is manifold; we ®rst provide formulae that accurately estimate the selectivity of such queries. These formulae, paired with cost models for selections and joins can be used to combine spatial operators in an optimal way. Second, we propose algorithms that process spatial joins and selections simultaneously and are typically more ef®cient than combinations of simple operators. Finally we study the problem of optimizing complex spatial queries using these operators, by providing (i) cost models, and (ii) rules that reduce the optimization space signi®cantly. The accuracy of the selectivity models and the ef®ciency of the proposed algorithms are evaluated through experimentation.

show abstract

“…This search of object instances is often done on the basis of information that consists of objects stored in relational tables and organized by thematic layers with spatial indexing methods. In these systems, queries are typically answered as cascaded spatial joins [2,26,[29][30][31].…”

Section: Introductionmentioning

confidence: 99%

Defining and Comparing Content Measures of Topological Relations

Godoy

Rodrı́guez

2004

GeoInformatica

View full text Add to dashboard Cite

This work defines and compares three content measures that characterize topological relations between rectangular regions in a two-dimensional space. These content measures use simplified views of spatial objects in order to create an efficient mechanism for capturing the topological content of spatial configurations. The content measures are compared based on the correlation between two similarity rankings: (1) a similarity ranking defined in terms of the distance of content-measure values and (2) a similarity ranking defined in terms of the error of the geometric adjustment between pairs of objects. The correlation between similarity rankings is used as indicator of how well these content measures characterize topological relations. Such content measures provide mechanisms for creating efficient methods to describe and access information on the basis of the topological content of spatial configurations.

show abstract

Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation

Cited by 24 publications

References 19 publications

Approximate spatio-temporal retrieval

Approximate spatio-temporal retrieval

Complex Spatial Query Processing

Defining and Comparing Content Measures of Topological Relations

Contact Info

Product

Resources

About