Path search and spatial query are considered as two independent topics in database research.The processing of path query with spatial constraint needs both path computation and spatial query.To provide path computation with spatial constraint,two processing strategies are considered:(1) whether pre-processing spatial operation before path computation,and (2) whether pre-filtering spatial objects before path computation.Based on these two strategies,four integrated spatial path query processing approaches are proposed in this paper.
[1]Brinkhoff T,Kriegel H,Seeger B.Efficient processing of spatial joins using R-trees.In:Peter Buneman,Sushil Jajodia eds.Proceedings of the ACM SIGMOD International Conference on Management of Data.New York:ACM Press,1993.237~246
[2]Guttman A.R-tree:a dynamic index structure for spatial searching.In:Beatrice Yormark ed.Proceedings of the ACM SIGMOD International Conference on Management of Data.New York:ACM Press,1984.45~57
[3]Huang Y W,Jing N,Rundensteiner E A.Effective graph clustering for path queries in digital map databases.In:Ken Barker,Tamer Ozsu M eds.Proceedings of the 5th International Conference on Information and Knowledge Managemen.New York:ACM Press,1996.215~222
[4]Agrawal R,Dar S,Jagadish H V.Direct transitive closure algorithms:design and performance evaluation.ACM Transactions on Database Systems,1990,15(3):427~458
[5]Gunther O.Efficient computation of spatial joins.In:Proceedings of the IEEE International Conference on Data Engineering.Los Alamitos:IEEE Computer Society Press,1993.50~59
[6]Huang Y W,Jing N,Rundensteiner E A.Integrated query processing strategies for spatial path queries.In:Proceedings of the IEEE International Conference on Data Engineering.Los Alamitos:IEEE Computer Society Press,1997.477~486
[7]Bechmann N,Kriegel H,Schneider R et al.The R*-tree:an efficient and robust access method for points and rectangles.In:Garcia-Molina Hector,Jagadish H V eds.Proceedings of the ACM SIGMOD International Conference on Management of Data.New York:ACM Press,1990.322~332