Add to ORKGIn this paper, we motivate four different user defined window query classes and derive a probabilistic model for each of them. For each model, we characterize the efficiency of spatial data structures in terms of the expected number of data bucket accesses needed to perform a window query. Our analytical approach exhibits the performance phenomena independent of data structure and implementation details and whether the objects are points or non-point objects.
Let S be a set of n points in d dimensions, such that each point is assigned a color. Given a query ...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
A range aggregate query returns summarized information about the points falling in a hyper-rectangle...
In this paper, we motivate four different user defined window query classes and derive a probabilist...
: Spatial relations are becoming an important aspect of spatial access methods because of the increa...
During the last decade various spatial data structures have been designed and compared against each ...
: In this paper we present an analytical model that predicts the performance of R-trees (and its var...
With the boom of spatial databases, more and more spatial queries, which play a significant role in ...
With the boom of spatial databases, more and more spatial queries, which play a significant role in ...
The processing of multi-dimensional range queries involving spatial relations arises in many applica...
The ubiquity of location-aware devices has resulted in a plethora of location-based services in whic...
Abstract — In sensor environments and moving robot applica-tions, the position of an object is often...
AbstractIn spatial database systems, there is a gap between the high-level query language required i...
An overview is presented of the issues in building spatial databases. The focus is on data models an...
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage ...
Let S be a set of n points in d dimensions, such that each point is assigned a color. Given a query ...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
A range aggregate query returns summarized information about the points falling in a hyper-rectangle...
In this paper, we motivate four different user defined window query classes and derive a probabilist...
: Spatial relations are becoming an important aspect of spatial access methods because of the increa...
During the last decade various spatial data structures have been designed and compared against each ...
: In this paper we present an analytical model that predicts the performance of R-trees (and its var...
With the boom of spatial databases, more and more spatial queries, which play a significant role in ...
With the boom of spatial databases, more and more spatial queries, which play a significant role in ...
The processing of multi-dimensional range queries involving spatial relations arises in many applica...
The ubiquity of location-aware devices has resulted in a plethora of location-based services in whic...
Abstract — In sensor environments and moving robot applica-tions, the position of an object is often...
AbstractIn spatial database systems, there is a gap between the high-level query language required i...
An overview is presented of the issues in building spatial databases. The focus is on data models an...
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage ...
Let S be a set of n points in d dimensions, such that each point is assigned a color. Given a query ...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
A range aggregate query returns summarized information about the points falling in a hyper-rectangle...