Pankaj K. Agarwal, Lars Arge, Jeff Erickson  Home/Search
Context Related
| uiuc.edu/~jeffe/pubs/ps....kindex.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~jeffe/pubs/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose three indexing schemes for storing a set S of N points in the plane, each moving along a linear trajectory, so that a query of the following form can be answered quickly: Given a rectangle R and a real value t q , report all K points of S that lie inside R at time t q . We first present an indexing structure that, for any given constant " ? 0, uses O(N=B) disk blocks, where B is the block size, and answers a query in O((N=B) 1=2+" + K=B) I/Os. It can also report all the points ... (Update)
Cited by: More
Towards Quadtree-based - Moving Objects Databases (Correct)
Real-Time Processing of Range-Monitoring - Queries In Heterogeneous (Correct)
Processing Range-Monitoring Queries on Heterogeneous Mobile.. - Ying Cai Kien (2004) (Correct)
Similar documents (at the sentence level):
18.9%: Indexing Moving Points - Agarwal, Arge, Erickson (2000) (Correct)
Active bibliography (related documents): More All
1.1: Time Responsive Indexing Schemes for Moving Points - Agarwal, Arge, Vahrenhold (2001) (Correct)
0.6: Time Responsive External Data Structures for Moving Points - Agarwal, Arge, Vahrenhold (2001) (Correct)
0.4: Indexing Problems in Spatiotemporal Databases - Kollios (2000) (Correct)
Similar documents based on text: More All
0.5: CRB-Tree: An Efficient Indexing Scheme for.. - Govindarajan, Agarwal.. (2003) (Correct)
0.1: Efficient Searching with Linear Constraints - Agarwal, Arge, Erickson.. (1998) (Correct)
0.1: Geometric Range Searching and Its Relatives - Agarwal, Erickson (1997) (Correct)
Related documents from co-citation: More All
51: On Indexing Mobile Objects - Kollios, Gunopolos et al. - 1999
49: Indexing the Positions of Continuously Moving Objects - Saltenis, Jensen et al. - 2000
26: A quadtree based dynamic attribute indexing method - Tayeb, Ulusoy et al. - 1998
BibTeX entry: (Update)
P.K. Agarwal, L. Arge and J. Erickson. Indexing Moving Points. In Proc. of 19th ACM-PODS, Dallas, Texas, 2000. http://citeseer.ist.psu.edu/article/agarwal00indexing.html More
@inproceedings{ agarwal00indexing,
author = "Pankaj K. Agarwal and Lars Arge and Jeff Erickson",
title = "Indexing Moving Points",
booktitle = "Symposium on Principles of Database Systems",
pages = "175-186",
year = "2000",
url = "citeseer.ist.psu.edu/article/agarwal00indexing.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
335 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
262 Multidimensional Access Methods - Gaede, Gunther - 1998
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
229 Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 1997
214 Davenport-Schinzel Sequences and Their Geometric Application.. - Sharir, Agarwal - 1995
133 Geometric range searching and its relatives - Agarwal, Erickson - 1999
129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989
127 Maintenance of configurations in the plane (context) - Overmars, van Leeuwen - 1981
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
121 Data structures for mobile data - Basch, Guibas et al. - 1997
110 Modeling and querying moving objects - Sistla, Wolfson et al. - 1997
106 Priority search trees (context) - McCreight - 1985
106 Indexing the positions of continuously moving objects - Saltenis, Jensen et al. - 2000
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1996
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
75 A deterministic view of random sampling and its use in geome.. (context) - Chazelle, Friedman - 1990
74 Moving objects databases: Issues and solutions - Wolfson, Xu et al. - 1998
72 Efficient partition trees (context) - Matousek - 1992
62 Optimal dynamic interval management in external memory - Arge, Vitter - 1996
56 Updating and querying databases that track mobile units - Wolfson, Sistla et al. - 1999
53 Path Caching: A Technique for Optimal External Searching - Ramaswamy, Subramanian - 1994
52 A quadtree-based dynamic attribute indexing method - Tayeb, Ulusoy et al. - 1998
50 Cost and imprecision in modeling the position of moving obje.. - Wolfson, Chamberlain et al. - 1998
45 A data model and data structures for moving objects database.. - Forlizzi, Guting et al. - 2000
43 Novel approaches in query processing for moving objects (context) - Pfoser, Jensen et al. - 2000
41 Randomized optimal algorithm for slope selection (context) - Matousek - 1991
30 On two-dimensional indexability and optimal range search ind.. - Arge, Samoladas et al. - 1999
27 Spatial data structures: Concepts and design choices (context) - Nievergelt, Widmayer - 1997
26 Proximity problems on moving points - Basch, Guibas et al. - 1997
25 Efficient searching with linear constraints - Agarwal, Arge et al. - 1998
25 A Comparison of Access Methods for Temporal Data (context) - Salzberg, Tsotras - 1997
25 Temporal conditions and integrity constraints in active data.. - Sistla, Wolfson - 1995
21 An efficient multiversion access structure (context) - Varman, Verma - 1997
20 Nearest neighbor queries in a mobile environment - Kollios, Gunopulos et al. - 1999
20 OODB indexing by class division - Ramaswamy, Kanellakis - 1995
19 A geometric framework for specifying spatiotemporal objects - Chomicki, Revesz - 1999
17 Abstract and discrete modeling of spatiotemporal data types (context) - Erwig, Guting et al. - 1998
15 The complexity of query evaluation in indefinite temporal co.. - Koubarakis - 1997
15 DOMINO: Databases for moving objects tracking - Wolfson, Sistla et al. - 1999
14 Developments in spatio-temporal query languages - Erwig, Schneider - 1999
12 Databases for tracking mobile units in real time - Wolfson, Jiang et al. - 1999
11 Kinetic binary space partitions for intersecting segments an.. - Agarwal, Erickson et al. - 1998
11 Online data structures in external memory - Vitter - 1999
8 Model-based battle command: A paradigm whose time has come (context) - Chamberlain - 1995
7 ArcView Tracking Analyst (context) - GIS - 1998
5 Principles Database Syst (context) - Kollios, Gunopulos et al. - 1999
5 Tractable query answering in indefinite constraint databases.. - Koubarakis, Skiadopoulos - 1999
4 Principles Database Syst (context) - Agarwal, Arge et al. - 2000
3 An asymptotic optimal multiversion B-tree (context) - Becker, Gschwind et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.uiuc.edu/~jeffe/pubs/index.html): More
Reconfiguring Convex Polygons - Aichholzer, Demaine, Erickson.. (2000) (Correct)
Preprocessing Chains for Dihedral Rotations is Difficult - Soss, Erickson, Overmars (2001) (Correct)
Kinetic Collision Detection Between Two Simple Polygons - Basch, Erickson, Guibas, .. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC