Access the full text.
Sign up today, get DeepDyve free for 14 days.
Bruno Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer (1996)
An asymptotically optimal multiversion B-treeThe VLDB Journal, 5
The market potential of the wireless location industry
Jamel Tayeb, Ö. Ulusoy, O. Wolfson (1998)
A Quadtree-Based Dynamic Attribute Indexing MethodComput. J., 41
P. Bernstein, Michael Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcia-Molina, J. Gray, Gerald Held, J. Hellerstein, H. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, J. Ullman (1998)
The Asilomar report on database researchArXiv, cs.DB/9811013
A. Sistla, O. Wolfson, S. Chamberlain, S. Dao (1997)
Modeling and querying moving objectsProceedings 13th International Conference on Data Engineering
Ayse Seydim, M. Dunham, Vijay Kumar (2001)
Location dependent query processing
S. Acharya, R. Alonso, M. Franklin, S. Zdonik (1995)
Broadcast disks: data management for asymmetric communication environments
Panos Chrysanthis, Vijay Kumar, E. Pitoura (2003)
Data engineering for mobile and wireless accessProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
Monowar Bhuyan, D. Bhattacharyya, Hossein Homaei, Hamid Shahriari, Jiankun Hu, Yong Yu, Yi Mu, Guilin Wang, Ying Sun, Hassan Asghar, Josef Pieprzyk, Huaxiong Wang, Jun Zhang, Yang Xiang, Wanlei Zhou, Lei Ye, Lan Zhou, Vijay Varadharajan, M. Hitchens, Lein Harn, Chia-Yin Lee, Changlu Lin, Chin-Chen Chang, Yini Wang, Sheng Wen, Silvio Cesare, Erika Rosas, Olivier Marin, Xavier Bonnaire (1958)
The Computer JournalNature, 181
P. Agarwal, L. Arge, Jeff Erickson (2000)
Indexing moving points (extended abstract)
O. Wolfson, A. Sistla, S. Chamberlain, Y. Yesha (1999)
Updating and Querying Databases that Track Mobile UnitsDistributed and Parallel Databases, 7
D.V. Kalashnikov, S. Prabhakar, W. Aref, S. Hambrusch (2002)
Technical Report TR 02–015
Kihong Kim, S. Cha, Keunjoo Kwon (2001)
Optimizing multidimensional index trees for main memory access
Reynold Cheng, Sunil Prabhakar, D. Kalashnikov (2003)
Querying imprecise data in moving object environmentsProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
Simonas Šaltenis, Christian Jensen, Scott Leutenegger, M. Lopez (2000)
Indexing the positions of continuously moving objects
D. Pfoser, Christian Jensen, Y. Theodoridis (2000)
Novel Approaches in Query Processing for Moving Object Trajectories
Sunil Prabhakar, Yuni Xia, D. Kalashnikov, Walid Aref, Susanne Hambrusch (2002)
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving ObjectsIEEE Trans. Computers, 51
R. Güting, Michael Böhlen, Martin Erwig, Christian Jensen, N. Lorentzos, Markus Schneider, M. Vazirgiannis (2000)
A foundation for representing and querying moving objectsACM Trans. Database Syst., 25
Jun Rao, K. Ross (2000)
Making B+- trees cache conscious in main memory
(1998)
Tsotras , and Christos Faloutsos
D. Kalashnikov, Sunil Prabhakar (2003)
Similarity join for low-and high-dimensional dataEighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings.
P. Agarwal, L. Arge, Jeff Erickson (2003)
Indexing Moving PointsJ. Comput. Syst. Sci., 66
O. Wolfson, Bo Xu, S. Chamberlain, Liqin Jiang (1998)
Moving objects databases: issues and solutionsProceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)
ŠaltenisSimonas, S. JensenChristian, T. LeuteneggerScott, A. LopezMario (2000)
Indexing the positions of continuously moving objectsSigmod Record
D.V. Kalashnikov, S. Prabhakar (2003)
DASFAA'03, Proc. of the 8th International Conference on Database Systems for Advanced Applications
O. Wolfson, S. Chamberlain, S. Dao, Liqin Jiang, Gisela Mendez (1998)
Cost and imprecision in modeling the position of moving objectsProceedings 14th International Conference on Data Engineering
Susanne Hambrusch, Hyeong-Seok Lim (1997)
Minimizing broadcast costs under edge reductions in tree networksProceedings 1997 International Conference on Parallel and Distributed Systems
Anil Kumar, V. Tsotras, C. Faloutsos (1998)
Designing Access Methods for Bitemporal DatabasesIEEE Trans. Knowl. Data Eng., 10
L. Forlizzi, R. Güting, E. Nardelli, Markus Schneider (2000)
A data model and data structures for moving objects databases
Simonas Šaltenis, Christian Jensen, Scott Leutenegger (2000)
Lopez: "Indexing the Positions of Continuously Moving Objects
T. Imielinski, S. Viswanathan, B. Badrinath (1994)
Energy efficient indexing on air
H. Koshima, J. Hoshen (2000)
Personal locator services emergeIEEE Spectrum, 37
G. Kollios, D. Gunopulos, V. Tsotras (1999)
On indexing mobile objects
D. Pfoser, Christian Jensen (1999)
Capturing the Uncertainty of Moving-Object Representations
D. Kalashnikov, Sunil Prabhakar, Susanne Hambrusch, Walid Aref (2002)
Efficient Evaluation of Continuous Range Queries on Moving Objects
Qinglong Hu, Wang-Chien Lee, Lee (2000)
Power conservative multi-attribute queries on data broadcastProceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)
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 or fraction of objects that move at any moment in time. We present a detailed analysis of a grid approach which shows the best results for both skewed and uniform data. A sorting based optimization is developed for significantly improving the cache hit-rate. Experimental evaluation establishes that indexing queries using the grid index yields orders of magnitude better performance than other index structures such as R*-trees.
Distributed and Parallel Databases – Springer Journals
Published: Oct 18, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.