1888 search results - page 45 / 378 » Algorithms for Querying by Spatial Structure |
86
Voted
VLDB
1994
ACM
15 years 2 months ago
1994
ACM
Global clustering has rarely been investigated in the area of spatial database systems although dramatic performance improvements can be achieved by using suitable techniques. In ...
DBPL
1999
Springer
15 years 2 months ago
1999
Springer
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
132
click to vote
DCOSS
2008
Springer
15 years 1 hour ago
2008
Springer
We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
115
click to vote
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
92
Voted
DATESO
2009
14 years 8 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....