Sciweavers

168 search results - page 4 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
ISCI
2007
141views more  ISCI 2007»
13 years 7 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 8 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 9 months ago
Maintaining Connectivity in Dynamic Multimodal Network Models
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
Petko Bakalov, Erik G. Hoel, Wee-Liang Heng, Vassi...
PODS
1999
ACM
133views Database» more  PODS 1999»
14 years 5 days ago
Processing and Optimization of Multiway Spatial Joins Using R-Trees
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
Dimitris Papadias, Nikos Mamoulis, Yannis Theodori...
ICPADS
2000
IEEE
14 years 8 days ago
Parallel Spatial Joins Using Grid Files
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
Jin-Deog Kim, Bonghee Hong