Spatial vector data with high-precision and wide-coverage has exploded globally, such as
land cover, social media, and other data-sets, which provides a good opportunity to enhance …

The spatial join is a popular operation in spatial database systems and its evaluation is a
well-studied problem. This paper reviews research and recent trends on spatial join …

Can we quickly explore large multidimensional data in main memory? Adaptive indexing
responds to this need by building an index incrementally, in response to queries; in its …

Each tuple in a valid-time relation includes an interval attribute T that represents the tuple's
valid time. The overlap join between two valid-time relations determines all pairs of tuples …

Many data science applications, most notably Geographic Information Systems, require the
computation of spatial joins between large object collections. The objective is to find pairs of …

Spatial joins are among the most time-consuming queries in spatial data management
systems. In this paper, we propose SwiftSpatial, a specialized accelerator architecture …

We study the in-memory and parallel evaluation of spatial joins, by tuning a classic
partitioning based algorithm. Our study shows that, compared to a straightforward …

With the development of location-based services (LBS), LBS users are generating more and
more spatio-textual data, eg, checkins and attraction reviews. Since a spatio-textual entity …

Non-point spatial objects (eg, polygons, linestrings, etc.) are ubiquitous. We study the
problem of indexing non-point objects in memory for range queries and spatial intersection …

Spatial join is a crucial operation in many spatial analysis applications in scientific and
geographical information systems. Due to the compute-intensive nature of spatial predicate …