메뉴 건너뛰기




Volumn 1262 LNCS, Issue , 1997, Pages 197-220

Orthogonal polygons as bounding structures in filter-refine query processing strategies

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION METHODS; ARBITRARY DIMENSION; CONVENTIONAL METHODS; HIGHER-DIMENSIONAL; MINIMUM BOUNDING RECTANGLE; PROCESSING STRATEGIES; SPATIAL DATABASE; SPATIAL QUERIES;

EID: 84860218645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63238-7_31     Document Type: Conference Paper
Times cited : (12)

References (25)
  • 6
    • 4243735976 scopus 로고
    • PhD thesis, University of Maryland, December (also available as Technical Report TR-3566, University of Maryland, College Park, MD)
    • C. Esperança. Orthogonal Objects and their Application in Spatial Databases. PhD thesis, University of Maryland, December 1995. (also available as Technical Report TR-3566, University of Maryland, College Park, MD).
    • (1995) Orthogonal Objects and their Application in Spatial Databases
    • Esperança, C.1
  • 7
    • 84976683657 scopus 로고
    • Computer processing of line-drawing images
    • March
    • H. Freeman. Computer processing of line-drawing images. ACM Computing Surveys, 6(1):57-97, March 1974.
    • (1974) ACM Computing Surveys , vol.6 , Issue.1 , pp. 57-97
    • Freeman, H.1
  • 8
    • 84883228782 scopus 로고
    • Optimal redundancy in spatial database systems
    • M. J. Egenhofer and J. R. Herring, editors Portland, ME, August (also Springer Verlag Lecture Notes in Computer Science 951)
    • V. Gaede. Optimal redundancy in spatial database systems. In M. J. Egenhofer and J. R. Herring, editors, Advances in Spatial Databases - Fourth International Symposium, SSD'95, pages 96-116, Portland, ME, August 1995. (also Springer Verlag Lecture Notes in Computer Science 951).
    • (1995) Advances in Spatial Databases - Fourth International Symposium, SSD'95 , pp. 96-116
    • Gaede, V.1
  • 11
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Boston, MA, June
    • A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the SIGMOD Conference, pages 47-57, Boston, MA, June 1984.
    • (1984) Proceedings of the SIGMOD Conference , pp. 47-57
    • Guttman, A.1
  • 14
    • 0001909014 scopus 로고
    • Patterns and search statistics
    • J. S. Rustagi, editor Academic Press, New York
    • A. Klinger. Patterns and search statistics. In J. S. Rustagi, editor, Optimizing Methods in Statistics, pages 303-337. Academic Press, New York, 1971.
    • (1971) Optimizing Methods in Statistics , pp. 303-337
    • Klinger, A.1
  • 15
    • 0342783022 scopus 로고
    • A program to determine whether two line segments intersect
    • University of Maryland, College Park, July
    • G. D. Knott and E. D. Jou. A program to determine whether two line segments intersect. Department of Computer Science TR-1884, University of Maryland, College Park, July 1987.
    • (1987) Department of Computer Science TR-1884
    • Knott, G.D.1    Jou, E.D.2
  • 17
    • 0342964300 scopus 로고
    • Das ratsei der verzopften geraden
    • (in German)
    • J. Nievergelt and P. Schorn. Das ratsei der verzopften geraden. Informatik-Spektrum, 11:163-165, 1988. (in German).
    • (1988) Informatik-Spektrum , vol.11 , pp. 163-165
    • Nievergelt, J.1    Schorn, P.2
  • 18
    • 84976738680 scopus 로고
    • Redundancy in spatial databases
    • Portland, OR, June
    • J. A. Orenstein. Redundancy in spatial databases. In Proceedings of the SIGMOD Conference, pages 294-305, Portland, OR, June 1989.
    • (1989) Proceedings of the SIGMOD Conference , pp. 294-305
    • Orenstein, J.A.1
  • 24
    • 2242477398 scopus 로고
    • Master's thesis, Eng. Elétrica, Universidade Federal do Rio de Janeiro, Rio de Janeiro, April
    • J. Shechtman. Processamento geométrico de mascaras VLSI. Master's thesis, Eng. Elétrica, Universidade Federal do Rio de Janeiro, Rio de Janeiro, April 1991.
    • (1991) Processamento Geométrico de Mascaras VLSI
    • Shechtman, J.1


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