Objects D. Kalashnikov S. Prabhakar S. Hambrusch Department of Computer...  Home/Search
Context
Related
| purdue.edu/homes/sunil/pub/Jmqi.pdf Cached: 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.
PS.gz PS Image Update HelpFrom: purdue.edu/homes/sunil/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we evaluate several in-memory algorithms for efficient and scalable processing of continuous range queries over collections of moving objects. Constant updates to the index are avoided by query indexing. No constraints are imposed on the speed or path of moving objects. We present a detailed analysis of a grid approach which shows the best results for both skewed and uniform data. (Update)
Active bibliography (related documents): More All
0.9: Query Indexing and Velocity Constrained Indexing.. - Prabhakar, Xia.. (2002) (Correct)
0.9: Efficient Querying of Constantly Evolving Data - Kalashnikov (2003) (Correct)
0.7: Query Indexing and Velocity Constrained Indexing.. - Prabhakar, Xia.. (2002) (Correct)
Similar documents based on text: More All
0.2: Evaluating Probabilistic Queries over Imprecise Data - Cheng, Kalashnikov, Prabhakar (2003) (Correct)
0.2: Similarity Join for Low- and High-Dimensional Data - Kalashnikov, Prabhakar (2002) (Correct)
0.1: Data Declustering for Efficient Range and Similarity.. - Prabhakar, Agrawal, Abbadi (Correct)
BibTeX entry: (Update)
@misc{ prabhakar-main,
author = "Objects Kalashnikov Prabhakar",
title = "Main Memory Evaluation of Montoring Queries Over Moving",
url = "citeseer.ist.psu.edu/660654.html" }
Citations (may not include all citations):258 Broadcast disks: Data management for asymmetric communicatio.. - Acharya, Alonso et al. - 1995
110 Modeling and querying moving objects - Sistla, Wolfson et al. - 1997
106 Indexing the position of continuously moving objects - Saltenis, Jensen et al. - 2000
88 An asymptotically optimal multiversion B-tree - Becker, Gschwind et al. - 1996
80 On indexing mobile objects - Kollios, Gunopulos et al. - 1999
75 The asilomar report on database research (context) - Bernstein - 1998
74 Moving objects databases: Issues and solutions - Wolfson, Xu et al. - 1998
64 Indexing moving points - Agarwal, Arge et al. - 2000
56 Designing access methods for bitemporal databases (context) - Kumar, Tsotras et al. - 1998
56 Updating and querying databases that track mobile units - Wolfson, Sistla et al. - 1999
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 A foundation for representing and querying moving objects - Guting, Bohlen et al. - 2000
43 Novel approaches in query processing for moving objects (context) - Pfoser, Jensen et al. - 2000
38 Capturing the uncertainty of moving-objects representations - Pfoser, Jensen - 1999
27 trees cache conscious in main memory (context) - Rao, Ross - 2000
24 Query indexing and velocity constrained indexing: Scalable t.. - Prabhakar, Xia et al.
15 Power conservative multi-attribute queries on data broadcast - Hu, Lee et al. - 2000
14 Indexing trajectories of moving point objects (context) - Pfoser, Theodoridis et al. - 1999
13 Optimizing multidimensional index trees for main memory acce.. (context) - Kim, Cha et al. - 2001
9 Personal locator services emerge (context) - Koshima, Hoshen - 2000
9 Efficient evaluation of continuous range queries on moving o.. (context) - Kalashnikov, Prabhakar et al. - 2002
8 Location dependent query processing - Seydim, Dunham et al. - 2001
4 Minimizing broadcast costs under edge reductions in tree net.. - Hambrusch, Liu et al. - 2001
4 Energy efficient indexing on air (context) - Imielinski, Viswanathan et al. - 1994
http://www.uswcorp.com/USWCMainPages/laby.htm
Documents on the same site (http://www.cs.purdue.edu/homes/sunil/pub.html): More
Efficient Disk Allocation for Fast Similarity Searching - Prabhakar (1997) (Correct)
Scalable Access within the Context of Digital Libraries - Cheng (1997) (Correct)
Data Declustering for Efficient Range and Similarity.. - Prabhakar, Agrawal, Abbadi (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