154 search results - page 12 / 31 » Space efficient dynamic stabbing with fast queries |
DEXA
2003
Springer
14 years 3 months ago
2003
Springer
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
JGTOOLS
2006
13 years 10 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
PVLDB
2010
13 years 8 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
SIGMOD
2004
ACM
14 years 10 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...