
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jagan Sankaranarayanan, Hanan Samet, "Query Processing Using Distance Oracles for Spatial Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 8, pp. 11581175, August, 2010.  
BibTex  x  
@article{ 10.1109/TKDE.2010.75, author = {Jagan Sankaranarayanan and Hanan Samet}, title = {Query Processing Using Distance Oracles for Spatial Networks}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {22}, number = {8}, issn = {10414347}, year = {2010}, pages = {11581175}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.75}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Query Processing Using Distance Oracles for Spatial Networks IS  8 SN  10414347 SP1158 EP1175 EPD  11581175 A1  Jagan Sankaranarayanan, A1  Hanan Samet, PY  2010 KW  Road networks KW  distance oracle KW  query processing. VL  22 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] J. Sankaranarayanan and H. Samet, “Distance Oracles for Spatial Networks,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 652663, Apr. 2009.
[2] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, “Query Processing in Spatial Network Databases,” Proc. Conf. Very Large Data Bases (VLDB), pp. 802813, Sept. 2003.
[3] H.J. Cho and C.W. Chung, “An Efficient and Scalable Approach to CNN Queries in a Road Network,” Proc. Conf. Very Large Data Bases (VLDB), pp. 865876, Sept. 2005.
[4] N. Jing, Y.W. Huang, and E.A. Rundensteiner, “Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 3, pp. 409432, May 1998.
[5] S. Jung and S. Pramanik, “An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps,” IEEE Trans. Knowledge and Data Eng., vol. 14, no. 5, pp. 10291046, Sept./Oct. 2002.
[6] H. Samet, Foundations of Multidimensional and Metric Data Structures. MorganKaufmann, 2006.
[7] H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes, “In Transit to Constant Time ShortestPath Queries in Road Networks,” Proc. Workshop Algorithm Eng. and Experiments (ALENEX), pp. 3443, Jan. 2007.
[8] A.V. Goldberg and R.F. Werneck, “Computing PointtoPoint Shortest Paths from External Memory,” Proc. Workshop Algorithm Eng. and Experiments (ALENEX), Jan. 2005.
[9] H. Samet, J. Sankaranarayanan, and H. Alborzi, “Scalable Network Distance Browsing in Spatial Databases,” Proc. ACM SIGMOD, pp. 4354, June 2008.
[10] J. Sankaranarayanan, H. Alborzi, and H. Samet, “Efficient Query Processing on Spatial Networks,” Proc. ACM Int'l Workshop Geographic Information Systems (GIS), pp. 200209, Nov. 2005.
[11] D. Wagner and T. Willhalm, “Geometric SpeedUp Techniques for Finding Shortest Paths in Large Sparse Graphs,” Proc. European Symp. Algorithms (ESA), pp. 776787, Sept. 2003.
[12] J. Sankaranarayanan, H. Alborzi, and H. Samet, “Enabling Query Processing on Spatial Networks,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), p. 163, Apr. 2006.
[13] G.M. Hunter and K. Steiglitz, “Operations on Images Using Quad Trees,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 2, pp. 145153, Apr. 1979.
[14] J. Sankaranarayanan, H. Samet, and H. Alborzi, “Path Oracles for Spatial Networks,” Proc. Conf. Very Large Data Bases (VLDB), vol. 2, no. 1, pp. 12101221, Aug. 2009.
[15] P.B. Callahan and S.R. Kosaraju, “Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions,” Proc. ACMSIAM Symp. Discrete Algorithms (SODA), pp. 291300, Jan. 1993.
[16] J. Gao and L. Zhang, “WellSeparated Pair Decomposition for the UnitDisk Graph Metric and Its Applications,” Proc. Ann. ACM Symp. Theory of Computing (STOC), pp. 483492, July 2003.
[17] J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid, “Approximate Distance Oracles for Geometric Graphs,” Proc. ACMSIAM Symp. Discrete Algorithms (SODA), pp. 828837, Jan. 2002.
[18] G. Narasimhan and M. Smid, “Approximating the Stretch Factor of Euclidean Graphs,” SIAM J. Computing, vol. 30, no. 3, pp.978989, 2000.
[19] C. Shahabi, M.R. Kolahdouzan, and M. Sharifzadeh, “A Road Network Embedding Technique for kNearest Neighbor Search in Moving Object Databases,” GeoInformatica, vol. 7, no. 3, pp. 255273, Sept. 2003.
[20] H.P. Kriegel, P. Kröger, M. Renz, and T. Schmidt, “Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks,” Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM), pp. 150167, July 2008.
[21] N. Linial, E. London, and Y. Rabinovich, “The Geometry of Graphs and Some of Its Algorithmic Applications,” Combinatorica, vol. 15, pp. 215245, 1995.
[22] M. Thorup and U. Zwick, “Approximate Distance Oracles,” Proc. Ann. ACM Symp. Theory of Computing (STOC), pp. 183192, 2001.
[23] P.B. Callahan and S.R. Kosaraju, “A Decomposition of Multidimensional Point Sets with Applications to kNearestNeighbors and nBody Potential Fields,” J. ACM, vol. 42, no. 1, pp. 6790, Jan. 1995.
[24] T.M. Chan, “WellSeparated Pair Decomposition in Linear Time?” Information Processing Letters, vol. 107, no. 5, pp. 138141, Aug. 2008.
[25] J.A. Orenstein, “Multidimensional Tries Used for Associative Searching,” Information Processing Letters, vol. 14, no. 4, pp. 150157, June 1982.
[26] J. Fischer and S. HarPeled, “Dynamic WellSeparated Pair Decomposition Made Easy,” Proc. Canadian Conf. Computational Geometry (CCCG), pp. 235238, Aug. 2005.
[27] G.M. Morton, “A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing,” technical report, IBM Ltd., 1966.
[28] I. Gargantini, “An Effective Way to Represent Quadtrees,” Comm. ACM, vol. 25, no. 12, pp. 905910, Dec. 1982.
[29] G.R. Hjaltason and H. Samet, “Ranking in Spatial Databases,” Proc. Int'l Symp. Advances in Spatial Databases (SSD), pp. 8395, Aug. 1995.
[30] G.R. Hjaltason and H. Samet, “Incremental Distance Join Algorithms for Spatial Databases,” Proc. ACM SIGMOD, pp. 237248, June 1998.
[31] J. Sankaranarayanan, H. Alborzi, and H. Samet, “Distance Join Queries on Spatial Networks,” Proc. ACM Int'l Workshop Geographic Information Systems (GIS), pp. 211218, Nov. 2006.
[32] H. Samet, H. Alborzi, F. Brabec, C. Esperança, G.R. Hjaltason, F. Morgan, and E. Tanin, “Use of the SAND Spatial Browser for Digital Government Applications,” Comm. ACM, vol. 46, no. 1, pp.6366, Jan. 2003.
[33] J.L. Bentley, “Decomposable Searching Problems,” Information Processing Letters, vol. 8, no. 5, pp. 244251, June 1979.
[34] S. Chaudhuri, “An Overview of Query Optimization in Relational Systems,” Proc. Symp. Principles of Database Systems (PODS), pp.3443, June 1998.
[35] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD, pp. 4757, June 1984.
[36] H. Shin, B. Moon, and S. Lee, “Adaptive MultiStage Distance Join Processing,” Proc. ACM SIGMOD, pp. 343354, May 2000.
[37] M.J. Carey and D. Kossmann, “On Saying ‘Enough Already!’ in SQL,” Proc. ACM SIGMOD, pp. 219230, May 1997.
[38] S. HarPeled, “Geometric Approximation Algorithms,” Collection of Lecture Notes, Nov. 2008.
[39] U.S. Census Bureau, “TIGER/Line Files, Census 2000,” http://www.census.gov/geo/www/tiger/tiger2k tiger2000.html, Oct. 2001.
[40] USGS, “Major Roads of the United States,” http://nationalatlas. govatlasftp.html, Nov. 1999.