The need to access spatial data at multiple levels of detail is a fundamental requirement of many applications of geographical information, yet conventional spatial database access...
In several applications, data objects are assumed to move on predefined spatial networks such as road segments, railways, invisible air routes. Moving objects may exhibit similar...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...