Spatial query processing in an object-oriented database system

Orenstein, Jack A.

doi:10.1145/16856.16886

Cited by 229 publications

(106 citation statements)

References 15 publications

Supporting

Mentioning

103

Contrasting

Unclassified

Order By: Relevance

“…Another crucial part is to show the spatiotemporal relationships of the tracks, which can be achieved by spatial join (Orenstein, 1986). Spatial join tool is a technical implementation to compile the functionalities of spatial join.…”

Section: Spatial Joinmentioning

confidence: 99%

On processing GPS tracking data of spatio-temporal car movements: a case study

Zhao

2015

Journal of Location Based Services

View full text Add to dashboard Cite

The advancement of GPS technology has made it possible to use GPS devices as orientation and navigation tools, but also as tools to track spatiotemporal information. GPS tracking data can be broadly applied in location-based services, such as spatial distribution of the economy, transportation routing and planning, traffic management and environmental control. Therefore, knowledge of how to process the data from a standard GPS device is crucial for further use.Previous studies have considered various issues of the data processing at the time. This paper, however, aims to outline a general procedure for processing GPS tracking data. The procedure is illustrated step-by-step by the processing of real-world GPS data of car movements in Borlänge in the centre of Sweden.

show abstract

Section: Spatial Joinmentioning

confidence: 99%

On processing GPS tracking data of spatio-temporal car movements: a case study

Zhao

2015

Journal of Location Based Services

View full text Add to dashboard Cite

show abstract

“…They include approaches that transform rectangles into points in a space of higher dimensionality, Table 1: Tabular Data Linked to vector objects e.g. grid files [8]; approaches that use linear quadtrees [15,5], z-ordering [11] or other space filling curves [9]; and approaches based on trees (R-tree [7], MX quadtrees [13,14], k-d-trees [2], k-d-B trees [12], hB trees [10] and cell trees [6]). In this paper, we propose extension to the MX-CIF quadtree, called MX-RS quadtree, that enables efficient implementation of various privilege modes of GSAM.…”

Section: Background On Geospatial Imagesmentioning

confidence: 99%

Protecting Privacy from Continuous High-Resolution Satellite Surveillance

Chun

Atluri

2002

Data and Application Security

View full text Add to dashboard Cite

Privacy refers to controlling the dissemination and use of personal data, including information that is knowingly disclosed, as well as data that are unintentionally revealed as a byproduct of the use of information technologies. This paper argues that the high resolution geospatial images of our earth's surface, produced from the earth observing satellites, can make a person visually exposed, resulting in a technological invasion of personal privacy. We propose a suitable authorization model for geospatial data (GSAM) where controlled access can be specified based on the region covered by an image with privilege modes that include view, zoom-in, overlay and identify. We demonstrate how access control can be efficiently enforced using a spatial indexing structure, called MX-RS quadtree, a variant of the MX-CIF quadtree.

show abstract

“…If the MBRs however share common points, no conclusion can be drawn about the spatial relation between the objects. For this reason, spatial queries involve the following two-step strategy [33]: (i) A filter step uses the tree to eliminate rapidly objects that could not possibly satisfy the query. The result of this step is a set of candidates which includes all the results and possibly some false hits.…”

Section: Selection Queriesmentioning

confidence: 99%

Constraint-Based Processing of Multiway Spatial Joins

2001

View full text Add to dashboard Cite

Abstract.A multiway spatial join combines information found in three or more spatial relations with respect to some spatial predicates. Motivated by their close correspondence with constraint satisfaction problems (CSPs), we show how multiway spatial joins can be processed by systematic search algorithms traditionally used for CSPs. This paper describes two different strategies, window reduction and synchronous traversal, that take advantage of underlying spatial indexes to prune the search space effectively. In addition, we provide cost models and optimization methods that combine the two strategies to compute more efficient execution plans. Finally, we evaluate the efficiency of the proposed techniques and the accuracy of the cost models through extensive experimentation with several query and data combinations.

show abstract

Spatial query processing in an object-oriented database system

Cited by 229 publications

References 15 publications

On processing GPS tracking data of spatio-temporal car movements: a case study

On processing GPS tracking data of spatio-temporal car movements: a case study

Protecting Privacy from Continuous High-Resolution Satellite Surveillance

Constraint-Based Processing of Multiway Spatial Joins

Contact Info

Product

Resources

About