메뉴 건너뛰기




Volumn , Issue , 2005, Pages 2-11

Close pair queries in moving object databases

Author keywords

Algorithms; Experimentation; Performance

Indexed keywords

ALGORITHMS; PERFORMANCE; PROBLEM SOLVING; TRAFFIC CONTROL; TREES (MATHEMATICS);

EID: 33644587262     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1097064.1097067     Document Type: Conference Paper
Times cited : (35)

References (31)
  • 2
    • 0018515704 scopus 로고
    • Algorithms for reporting and counting geometric intersections
    • J. L. Bentley and T. Ottmann. Algorithms for Reporting and Counting Geometric Intersections. IEEE Transactions on Computers, 28(9):643-647, 1979.
    • (1979) IEEE Transactions on Computers , vol.28 , Issue.9 , pp. 643-647
    • Bentley, J.L.1    Ottmann, T.2
  • 8
    • 33644588401 scopus 로고    scopus 로고
    • A generic plane-sweep for intersecting line segments
    • W. Freiseisen and P. Pau. A Generic Plane-Sweep for Intersecting Line Segments. In RISC-Technical Report no 98-18, 1998.
    • (1998) RISC-technical Report No 98-18 , vol.98 , Issue.18
    • Freiseisen, W.1    Pau, P.2
  • 16
    • 0040273832 scopus 로고    scopus 로고
    • B-tree page size when caching is considered
    • David B. Lomet. B-tree page size when caching is considered. SIGMOD Record, 27(3):28-32, 1998.
    • (1998) SIGMOD Record , vol.27 , Issue.3 , pp. 28-32
    • Lomet, D.B.1
  • 19
    • 33644600865 scopus 로고    scopus 로고
    • Minutes of the Research, Engineering and Development Advisory Committee
    • FAA Report. Minutes of the Research, Engineering and Development Advisory Committee.
    • FAA Report


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