1168 计 算机 学 报 2011年 [16]Robinson J T.The K-D-B-Tree:A search structure for large [31] Saltenis S.Jensen C S.Indexing of moving objects for loca- multidimensional dynamic indexes//Proceedings of the 1981 tion-based services//Proceedings of the 18th International ACM SIGMOD International Conference on Management of Conference on Data Engineering.San Jose.2002:463-472 Data.Ann Arbor.1981:10-18 [32]Prabhakar S.Xia Y,Kalashnikov D V.Aref W G.Hambr- [17]Samet H.The quadtree and related hierarchical data struc- usch S E.Query indexing and velocity constrained indexing: tures.ACM Computing Surveys,1984.16(2):187-260 Scalable techniques for continuous queries on moving objects. IEEE Transactions on Computers,2002.51(10):1124-1140 [18]Theodoridis Y,Vazirgiannis M.Sellis T.Spatio-temporal [33]Jensen C S.Lin D.Ooi B C.Query and update efficient B+- indexing for large multimedia applications//Proceedings of tree based indexing of moving objects//Proceedings of the the IEEE International Conference on Multimedia Computing 30th International Conference on Very Large Data Bases. and Systems.Hiroshima,Japan.1996:441-448 Toronto,2004:768-779 [19]Nascimento M A,Silva J R O.Towards historical R-trees// [34]Jensen C S,Tiesyte D,Tradisauskas N.Robust B+-tree- Proceedings of the 1998 ACM Symposium on Applied Com- based indexing of moving objects//Proceedings of the 7th In- puting.Atlanta.1998:235-240 ternational Conference on Mobile Data Management.Nara. [20]Tao Y.Papadias D.Efficient historical R-trees//Proceedings 2006:12 of the 13th International Conference on Scientific and Statisti- [35]Yiu M L.Tao Y,Mamoulis N.The BA-tree:Indexing cal Database Management.Fairfax.2001:223-232 moving objects by space filling curves in the dual space.The [21]Tao Y.Papadias D.MV3R-Tree:A spatio-temporal access International Journal of Very Large Data Bases.2008.17 method for timestamp and interval queries//Proceedings of (3):379-400 the 27th International Conference on Very Large Data Bases. [36]Chen S,Ooi B C,Tan K L.Nascimento M A.The ST2B- Roma,2001:431-440 tree:A self-tunable spatio-temporal B+-tree index for mov- [22]Pfoser D.Jensen C S.Theodoridis Y.Novel approaches in ing objects//Proceedings of the 2008 ACM SIGMOD Interna- query processing for moving object trajectories//Proceedings tional Conference on Management of Data.Vancouver. of the 26th International Conference on Very Large Data Ba- 2008:29-42 ses.Cairo,2000:395-406 [37]Patel J M,Chen Y.Chakka V P.STRIPES:An efficient in- [23]Chakka V P.Everspaugh A.Patel J M.Indexing large traj- dex for predicted trajectories//Proceedings of the 2004 ACM ectory data sets with SETI//Proceedings of the 1st Biennial SIGMOD International Conference on Management of Data. Conference on Innovative Data Systems Research.Asilomar. Paris,2004:637-646 2003 [38]Chen S.Jensen C S.Lin D.A benchmark for evaluating [24]Song Z.Roussopoulos N.Hashing moving objects//Proceed- moving object indexes//Proceedings of the VLDB Endow- ings of the 2nd International Conference on Mobile Data ment.Auckland,2008,1(2):1574-1585 Management.Hong Kong,China,2001:161-172 [39]Roxin A M,Dumez C,Gaber J.Wack M.Middleware mod- [25]Song Z,Roussopoulos N.SEB-tree:An approach to index els for location-based services:A survey//Proceedings of the continuously moving objects//Proceedings of the 4th Interna- 2nd International Workshop on Agent-Oriented Software En- tional Conference on Mobile Data Management.Melbourne. gineering Challenges for Ubiquitous and Pervasive Compu- 2003:340-344 ting.2008 [26]Nascimento MA.Silva J R O.Theodoridis Y.Evaluation of [40]Leung H K Y,Burcea I.Jacobsen H A.Modeling location- based services with subject spaces//Proceedings of the 2003 access structures for discretely moving points//Proceedings of the International Workshop on Spatio-Temporal Database Conference of the Centre for Advanced Studies Conference on Management.Edinburgh.1999:171-188 Collaborative Research.Toronto,Ontario.Canada.2003: 171-181 [27]Kwon D.Lee S.Lee S.Indexing the current positions of [41]Gelernter D.Generative communication in Linda.ACM moving objects using the lazy update R-tree//Proceedings of Transactions on Program.Lang.Syst.,1985.7(1):80-112 the 3rd International Conference on Mobile Data Manage- [42]Mokbel M F.Xiong X.Aref W G.SINA:Scalable incre- ment.Singapore,2002:113-120 mental processing of continuous queries in spatio-temporal [28]Xiong X.Aref W G.R-trees with update memos//Proceed- databases//Proceedings of the ACM 2004 SIGMOD Interna- ings of the 22nd International Conference on Data Engineer- tional Conference on Management of Data.Paris,2004:623- ing.Atlanta.2006:22 634 [29]Saltenis S,Jensen C S.Leutenegger S T.Lopez M A.Inde- [43]Hu H.Xu J,Lee D L.A generic framework for monitoring xing the positions of continuously moving objects//Proceed- continuous spatial queries over moving objects//Proceedings ings of the 2000 ACM SIGMOD International Conference on of the 2005 ACM SIGMOD International Conference on Man- Management of Data.Dallas.2000:331-342 agement of Data.Baltimore.2005:479-490 [30]Tao Y.Papadias D.Sun J.The TPR'-Tree:An optimized [44] Mouratidis K.Yiu ML.Papadias D.Mamoulis N.Continu- spatio-temporal access method for predictive queries//Pro- ous nearest neighbor monitoring in road networks//Proceed- ceedings of the 29th International Conference on Very Large ings of the 32nd International Conference on Very Large Data Data Bases.Berlin.2003:790-801 Bases.Seoul.2006:43-54[16]RobinsonJT.TheKDBTree:Asearchstructureforlarge multidimensionaldynamicindexes//Proceedingsofthe1981 ACMSIGMODInternationalConferenceonManagementof Data.AnnArbor,1981:1018 [17]SametH.Thequadtreeandrelatedhierarchicaldatastruc tures.ACMComputingSurveys,1984,16(2):187260 [18]TheodoridisY,VazirgiannisM,SellisT.Spatiotemporal indexingforlargemultimediaapplications//Proceedingsof theIEEEInternationalConferenceonMultimediaComputing andSystems.Hiroshima,Japan,1996:441448 [19]NascimentoMA,SilvaJRO.TowardshistoricalRtrees// Proceedingsofthe1998ACMSymposiumonAppliedCom puting.Atlanta,1998:235240 [20]TaoY,PapadiasD.EfficienthistoricalRtrees//Proceedings ofthe13thInternationalConferenceonScientificandStatisti calDatabaseManagement.Fairfax,2001:223232 [21]TaoY,PapadiasD.MV3RTree:Aspatiotemporalaccess methodfortimestampandintervalqueries//Proceedingsof the27thInternationalConferenceonVeryLargeDataBases. Roma,2001:431440 [22]PfoserD,JensenCS,TheodoridisY.Novelapproachesin queryprocessingformovingobjecttrajectories//Proceedings ofthe26thInternationalConferenceonVeryLargeDataBa ses.Cairo,2000:395406 [23]ChakkaVP,EverspaughA,PatelJM.Indexinglargetraj ectorydatasetswithSETI//Proceedingsofthe1stBiennial ConferenceonInnovativeDataSystemsResearch.Asilomar, 2003 [24]SongZ,RoussopoulosN.Hashingmovingobjects//Proceed ingsofthe2ndInternationalConferenceonMobileData Management.HongKong,China,2001:161172 [25]SongZ,RoussopoulosN.SEBtree:Anapproachtoindex continuouslymovingobjects//Proceedingsofthe4thInterna tionalConferenceonMobileDataManagement.Melbourne, 2003:340344 [26]NascimentoMA,SilvaJRO,TheodoridisY.Evaluationof accessstructuresfordiscretelymovingpoints//Proceedings oftheInternationalWorkshoponSpatioTemporalDatabase Management.Edinburgh,1999:171188 [27]KwonD,LeeS,LeeS.Indexingthecurrentpositionsof movingobjectsusingthelazyupdateRtree//Proceedingsof the3rdInternationalConferenceonMobileDataManage ment.Singapore,2002:113120 [28]XiongX,ArefWG.Rtreeswithupdatememos//Proceed ingsofthe22ndInternationalConferenceonDataEngineer ing.Atlanta,2006:22 [29]SaltenisS,JensenCS,LeuteneggerST,LopezMA.Inde xingthepositionsofcontinuouslymovingobjects//Proceed ingsofthe2000ACMSIGMODInternationalConferenceon ManagementofData.Dallas,2000:331342 [30]TaoY,PapadiasD,SunJ.TheTPRTree:Anoptimized spatiotemporalaccessmethodforpredictivequeries//Pro ceedingsofthe29thInternationalConferenceonVeryLarge DataBases.Berlin,2003:790801 [31]SaltenisS,JensenCS.Indexingofmovingobjectsforloca tionbasedservices//Proceedingsofthe18thInternational ConferenceonDataEngineering.SanJose,2002:463472 [32]PrabhakarS,XiaY,KalashnikovDV,ArefWG,Hambr uschSE.Queryindexingandvelocityconstrainedindexing: Scalabletechniquesforcontinuousqueriesonmovingobjects. IEEETransactionsonComputers,2002,51(10):11241140 [33]JensenCS,LinD,OoiBC.QueryandupdateefficientB+ treebasedindexingofmovingobjects//Proceedingsofthe 30thInternationalConferenceonVeryLargeDataBases. Toronto,2004:768779 [34]JensenCS,TiesyteD,TradisauskasN.RobustB+tree basedindexingofmovingobjects//Proceedingsofthe7thIn ternationalConferenceonMobileDataManagement.Nara, 2006:12 [35]YiuML,TaoY,MamoulisN.TheBdualtree:Indexing movingobjectsbyspacefillingcurvesinthedualspace.The InternationalJournalofVeryLargeDataBases,2008,17 (3):379400 [36]ChenS,OoiBC,TanKL,NascimentoMA.TheST2B tree:AselftunablespatiotemporalB+treeindexformov ingobjects//Proceedingsofthe2008ACMSIGMODInterna tionalConferenceonManagementofData.Vancouver, 2008:2942 [37]PatelJM,ChenY,ChakkaVP.STRIPES:Anefficientin dexforpredictedtrajectories//Proceedingsofthe2004ACM SIGMODInternationalConferenceonManagementofData. Paris,2004:637646 [38]ChenS,JensenCS,LinD.Abenchmarkforevaluating movingobjectindexes//ProceedingsoftheVLDBEndow ment.Auckland,2008,1(2):15741585 [39]RoxinAM,DumezC,GaberJ,WackM.Middlewaremod elsforlocationbasedservices:Asurvey//Proceedingsofthe 2ndInternationalWorkshoponAgentOrientedSoftwareEn gineeringChallengesforUbiquitousandPervasiveCompu ting,2008 [40]LeungHKY,BurceaI,JacobsenHA.Modelinglocation basedserviceswithsubjectspaces//Proceedingsofthe2003 ConferenceoftheCentreforAdvancedStudiesConferenceon CollaborativeResearch.Toronto,Ontario,Canada,2003: 171181 [41]GelernterD.GenerativecommunicationinLinda.ACM TransactionsonProgram.Lang.Syst.,1985,7(1):80112 [42]MokbelMF,XiongX,ArefWG.SINA:Scalableincre mentalprocessingofcontinuousqueriesinspatiotemporal databases//ProceedingsoftheACM2004SIGMODInterna tionalConferenceonManagementofData.Paris,2004:623 634 [43]HuH,XuJ,LeeDL.Agenericframeworkformonitoring continuousspatialqueriesovermovingobjects//Proceedings ofthe2005ACMSIGMODInternationalConferenceonMan agementofData.Baltimore,2005:479490 [44]MouratidisK,YiuML,PapadiasD,MamoulisN.Continu ousnearestneighbormonitoringinroadnetworks//Proceed ingsofthe32ndInternationalConferenceonVeryLargeData Bases.Seoul,2006:4354 1168 计 算 机 学 报 2011年