Database Paper Browser

Back to papers

On Moving Object Queries (Extended Abstract)

Summary: Introduce a constraint-database model for moving objects, classifying queries as past/continuing/future and encoding queries via a generalized distance f: object→(time→R). Show that if f yields polynomial trajectories many distance-based queries (e.g., NN) admit efficient plane-sweep evaluation, motivating new techniques for continuing/future queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1264
Venue
PODS
Year
2002
Pagerank
4.6975478e-05
Overall Rank
7,598 | 47.20%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
3,415 Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates 2003 VLDB 7.1162894e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
97 Maintaining Views Incrementally 1993 SIGMOD 0.00050863077
482 Incremental Maintenance of Views with Duplicates 1995 SIGMOD 0.00022145976
1,004 On Indexing Mobile Objects 1999 PODS 0.00014694512
1,428 Algorithms for Deferred View Maintenance 1996 SIGMOD 0.00012030912
1,764 Indexing Moving Points (Extended Abstract) 2000 PODS 0.0001062234
2,558 Novel Approaches to the Indexing of Moving Object Trajectories 2000 VLDB 8.5441554e-05
6,767 A Data Model and Data Structures for Moving Objects Databases 2000 SIGMOD 4.9277341e-05
Previous Page 1 / 1 Next

Semantically Similar Papers