메뉴 건너뛰기




Volumn 15, Issue 4, 2003, Pages 895-910

Buffer queries

Author keywords

Buffer query; Distance related query; Filtering; Minimum distance; Refinement; Spatial join; Spatial query evaluation

Indexed keywords

ALGORITHMS; BUFFER STORAGE; DATA STRUCTURES; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0041347746     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2003.1209007     Document Type: Article
Times cited : (13)

References (28)
  • 3
    • 0027621672 scopus 로고
    • Efficient processing of spatial joins using R-trees
    • T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient Processing of Spatial Joins Using R-Trees," Proc. ACM SIGMOD, pp. 237-246, 1993.
    • (1993) Proc. ACM SIGMOD , pp. 237-246
    • Brinkhoff, T.1    Kriegel, H.-P.2    Seeger, B.3
  • 7
    • 0020949322 scopus 로고
    • Optimal algorithms for the intersection and the minimum distance problems between planar polygons
    • F. Chin and C.A. Wang, "Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons," IEEE Trans. Computer, pp. 1203-1207, 1983.
    • (1983) IEEE Trans. Computer , pp. 1203-1207
    • Chin, F.1    Wang, C.A.2
  • 9
    • 0027261939 scopus 로고
    • Efficient computation of spatial joins
    • O. Gunther, "Efficient Computation of Spatial Joins," Proc. Int'l Conf. Data Eng., pp. 50-59, 1993.
    • (1993) Proc. Int'l Conf. Data Eng. , pp. 50-59
    • Gunther, O.1
  • 10
    • 0023385392 scopus 로고
    • A practical divide-and-conquer algorithm for the rectangle intersection problem
    • R.H. Guting and W. Schilling, "A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem," Information Sciences (42), pp. 95-112, 1987.
    • (1987) Information Sciences , Issue.42 , pp. 95-112
    • Guting, R.H.1    Schilling, W.2
  • 12
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, pp. 47-57, 1984.
    • (1984) Proc. ACM SIGMOD , pp. 47-57
    • Guttman, A.1
  • 13
    • 0032089982 scopus 로고    scopus 로고
    • Incremental distance join algorithms for spatial databases
    • G.R. Hjaltason and H. Samet, "Incremental Distance Join Algorithms for Spatial Databases," Proc. ACM SIGMOD, pp. 237-248, 1998.
    • (1998) Proc. ACM SIGMOD , pp. 237-248
    • Hjaltason, G.R.1    Samet, H.2
  • 17
    • 0012906001 scopus 로고    scopus 로고
    • High dimensional similarity joins: Algorithms and performance evaluation
    • Jan./Feb.
    • 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. 3-18, Jan./Feb. 2000.
    • (2000) IEEE Trans. Knowledge and Data Eng. , vol.12 , Issue.1 , pp. 3-18
    • Koudas, N.1    Sevcik, K.C.2
  • 20
    • 0022113717 scopus 로고
    • On fast computation of distance between line segments
    • V.J. Lumelsky, "On Fast Computation of Distance Between Line Segments," Information Processing Letters, vol. 21, pp. 55-61, 1985.
    • (1985) Information Processing Letters , vol.21 , pp. 55-61
    • Lumelsky, V.J.1
  • 21
    • 0029184961 scopus 로고
    • LEDA, a platform for combinatorial and geometric computing
    • Jan.
    • K. Mehlhorn and S. Naher, "LEDA, A Platform for Combinatorial and Geometric Computing," Comm. ACM, no. 38, pp. 96-102, Jan. 1995.
    • (1995) Comm. ACM , Issue.38 , pp. 96-102
    • Mehlhorn, K.1    Naher, S.2
  • 23
    • 0030157411 scopus 로고    scopus 로고
    • Partition based spatial-merge join
    • J.M. Patel and D. DeWitt, "Partition Based Spatial-Merge Join," Proc. ACM SIGMOD, pp. 259-270, 1996.
    • (1996) Proc. ACM SIGMOD , pp. 259-270
    • Patel, J.M.1    DeWitt, D.2
  • 24
    • 0027964031 scopus 로고
    • Efficient distance computation between non-convex objects
    • S. Quinlan, "Efficient Distance Computation Between Non-Convex Objects," Proc. IEEE Int'l Conf. Robotics and Automation, pp. 3325-3330, 1994.
    • (1994) Proc. IEEE Int'l Conf. Robotics and Automation , pp. 3325-3330
    • Quinlan, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.