An adaptive updating protocol for reducing moving object database workload
暂无分享,去创建一个
[1] Christian S. Jensen,et al. A benchmark for evaluating moving object indexes , 2008, Proc. VLDB Endow..
[2] Xiaohui Yu,et al. Monitoring k-nearest neighbor queries over moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).
[3] Beng Chin Ooi,et al. Effectively Indexing Uncertain Moving Objects for Predictive Queries , 2009, Proc. VLDB Endow..
[4] Walid G. Aref,et al. SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.
[5] Jianliang Xu,et al. A generic framework for monitoring continuous spatial queries over moving objects , 2005, SIGMOD '05.
[6] Yin Yang,et al. Continuous k-Means Monitoring over Moving Objects , 2008, IEEE Transactions on Knowledge and Data Engineering.
[7] Yufei Tao,et al. Venn sampling: a novel prediction technique for moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).
[8] Christian S. Jensen,et al. Indexing the positions of continuously moving objects , 2000, SIGMOD '00.
[9] Wei Wu,et al. Distributed Processing of Moving K-Nearest-Neighbor Query on Moving Objects , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[10] A. Prasad Sistla,et al. Updating and Querying Databases that Track Mobile Units , 1999, Distributed and Parallel Databases.
[11] Kyriakos Mouratidis,et al. Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring , 2005, SIGMOD '05.
[12] Beng Chin Ooi,et al. Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.
[13] Anthony K. H. Tung,et al. Minimizing the communication cost for continuous skyline maintenance , 2009, SIGMOD Conference.
[14] Vijay V. Vazirani,et al. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..
[15] Thomas Brinkhoff,et al. A Framework for Generating Network-Based Moving Objects , 2002, GeoInformatica.
[16] Jimeng Sun,et al. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.
[17] Yufei Tao,et al. The Bdual-Tree: indexing moving objects by space filling curves in the dual space , 2008, The VLDB Journal.
[18] Beng Chin Ooi,et al. Efficient indexing of the historical, present, and future positions of moving objects , 2005, MDM '05.
[19] Walid G. Aref,et al. SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases , 2005, 21st International Conference on Data Engineering (ICDE'05).
[20] Christos Faloutsos,et al. Prediction and indexing of moving objects with unknown motion patterns , 2004, SIGMOD '04.
[21] Ling Liu,et al. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System , 2004, EDBT.
[22] Beng Chin Ooi,et al. ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects , 2008, SIGMOD Conference.
[23] Tiko Kameda,et al. The R-Link Tree: A Recoverable Index Structure for Spatial Data , 1994, DEXA.
[24] Walid G. Aref,et al. LUGrid: Update-tolerant Grid-based Indexing for Moving Objects , 2006, 7th International Conference on Mobile Data Management (MDM'06).
[25] Beng Chin Ooi,et al. An adaptive updating protocol for reducing moving object database workload , 2010, Proc. VLDB Endow..
[26] Michael J. Carey,et al. Performance of B+ tree concurrency control algorithms , 1993, The VLDB Journal.