Sciweavers

856 search results - page 150 / 172
» Location-based Spatial Queries
Sort
View
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 10 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
15 years 8 days ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
W2GIS
2009
Springer
14 years 5 months ago
Database and Representation Issues in Geographic Information Systems (GIS)
Abstract. A review is provided of some database and representation issues involved in the implementation of geographic information systems (GIS). The increasing popularity of web-b...
Hanan Samet
DBA
2004
140views Database» more  DBA 2004»
14 years 10 days ago
A Tool for Transforming Conceptual Schemas of Spatio-Temporal Databases with Multiple Representation
Nowadays, classical conceptual models (such as ER or UML) are used for designing database applications. These classical conceptual models usually come with associated CASE tools a...
Mohammed Minout, Christine Parent, Esteban Zim&aac...
ICPP
2006
IEEE
14 years 5 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru