
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Edward P.F. Chan, "Buffer Queries," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 895910, July/August, 2003.  
BibTex  x  
@article{ 10.1109/TKDE.2003.1209007, author = {Edward P.F. Chan}, title = {Buffer Queries}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {15}, number = {4}, issn = {10414347}, year = {2003}, pages = {895910}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2003.1209007}, 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  Buffer Queries IS  4 SN  10414347 SP895 EP910 EPD  895910 A1  Edward P.F. Chan, PY  2003 KW  Buffer query KW  distancerelated query KW  minimum distance KW  spatial query evaluation KW  filtering KW  refinement KW  spatial join. VL  15 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—A class of commonly asked queries in a spatial database is known as
[1] L. Arge, S. Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter, Scalable SweepingBased Spatial Join Proc. 24th Very Large Data Bases Conf., pp. 570581, 1998.
[2] L. Becker, A. Giesen, K. Hinrichs, and J. Vahrenhold, Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets Proc. Sixth Int'l Symp. Advances in Spatial Databases, pp. 270285, 1999.
[3] T. Brinkhoff, H.P. Kriegel, and B. Seeger, Efficient Processing of Spatial Joins Using RTrees Proc. ACM SIGMOD, pp. 237246, 1993.
[4] T. Brinkhoff, H.P. Kriegel, R. Schneider, and B. Seeger, MultiStep Processing of Spatial Joins Proc. ACM SIGMOD, pp. 197208, 1994.
[5] A. Carral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, Closest Pair Queries in Spatial Databases Proc. ACM SIGMOD, pp. 189200, 2000.
[6] E.P.F. Chan and J.N.H. Ng, A General and Efficient Implementation of Geometric Operators and Predicates Proc. Fifth Int'l Symp. Advances in Spatial Databases, pp. 6993, 1997.
[7] F. Chin and C.A. Wang, Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons IEEE Trans. Computer, pp. 12031207, 1983.
[8] N. Chrisman, Exploring Geographic Information Systems. Wiley, 1997.
[9] O. Günther, “Efficient Computation of Spatial Joins,” Proc. Ninth Conf. Data Eng., pp. 5060, 1993.
[10] R.H. Guting and W. Schilling, A Practical DivideandConquer Algorithm for the Rectangle Intersection Problem Information Sciences (42), pp. 95112, 1987.
[11] R.H. Guting, T. Ridder, and M. Schneider, Implementation of ROSE Algebra: Efficient Algorithms for RealmBased Spatial Data Types Proc. Advances in Spatial Databases Fourth Int'l Symp. (SSD '95), pp. 216239, 1995.
[12] A. Guttman, RTrees: A Dynamic Index Structure for Spatial Searching Proc. ACM SIGMOD, pp. 4757, 1984.
[13] G.R. Hjaltason and H. Samet, Incremental Distance Join Algorithms for Spatial Databases Proc. ACM SIGMOD, pp. 237248, 1998.
[14] Y.W. Huang, M. Jones, and E. Rundensteiner, Improving Spatial Intersect Using Symbolic Intersect Detection Proc. Fifth Int'l Symp. Advances in Spatial Databases, pp. 165177, 1997.
[15] I. Kamel and C. Faloutsos, Hilbert RTree: An Improved RTree Using Fractals Proc. 20th Very Large Data Bases Conf., pp. 500509, 1994.
[16] R.K. Kothuri and S. Ravada, Efficient Processing of Large Spatial Queries Using Interior Approximations Proc. Seventh Int'l Symp. Spatial and Temporal Databases (SSTD '01), pp. 404421, July 2001.
[17] N. Koudas and K.C. Sevcik, High Dimensional Similarity Joins: Algorithms and Performance Evaluation IEEE Trans. Knowledge and Data Eng., vol. 12, no. 1, pp. 318, Jan./Feb. 2000.
[18] H. Kriegel, T. Brinkhoff, and R. Schneider, An Efficient Map Overlay Algorithm Based on Spatial Access Methods and Computational Geometry Proc. Int'l Workshop DBMS's for Geographic Applications, pp. 194211, 1991.
[19] M.L. Lo and C.V. Ravishankar, Spatial HashJoin Proc. ACM SIGMOD, pp. 247258, 1996.
[20] V.J. Lumelsky, On Fast Computation of Distance Between Line Segments Information Processing Letters, vol. 21, pp. 5561, 1985.
[21] K. Mehlhorn and S. Naher, LEDA, A Platform for Combinatorial and Geometric Computing Comm. ACM, no. 38, pp. 96102, Jan. 1995.
[22] Oracle Spatial User's Guide and Reference. Version 9.0.1, 2001.
[23] J.M. Patel and D. DeWitt, Partition Based SpatialMerge Join Proc. ACM SIGMOD, pp. 259270, 1996.
[24] S. Quinlan, Efficient Distance Computation Between NonConvex Objects Proc. IEEE Int'l Conf. Robotics and Automation, pp. 33253330, 1994.
[25] P. Rigaux, M. Scholl, and A. Voisard, Spatial Databases with Application to GIS. Morgan Kaufmann, 2002.
[26] N. Roussopoulos, S. Kelley, and F. Vincent, Nearest Neighbor Queries Proc. ACM SIGMOD, pp. 7179, 1995.
[27] J. Star and J. Estes, Geographic Information Systems An Introduction. Prentice Hall, 1990.
[28] G. Zimbrao and J.M. de Souza, A Raster Approximation for the Processing of Spatial Joins Proc. 24th Very Large Data Bases Conf., pp. 558569, 1998.