메뉴 건너뛰기




Volumn 3633, Issue , 2005, Pages 163-180

The optimal-location query

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; TREES (MATHEMATICS);

EID: 26444587471     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11535331_10     Document Type: Conference Paper
Times cited : (91)

References (13)
  • 2
    • 0039845446 scopus 로고    scopus 로고
    • Influence sets based on reverse nearest neighbor queries
    • [KM00]
    • [KM00] F. Korn and S. Muthukrishnan. Influence Sets Based on Reverse Nearest Neighbor Queries. In SIGMOD, pages 201-212, 2000.
    • (2000) SIGMOD , pp. 201-212
    • Korn, F.1    Muthukrishnan, S.2
  • 3
    • 0000191336 scopus 로고
    • ∞) metrics with 2-dimensional storage applications
    • [LW80]
    • ∞) Metrics with 2-Dimensional Storage Applications. SIAM Journal on Computing, 9:200-211, 1980.
    • (1980) SIAM Journal on Computing , vol.9 , pp. 200-211
    • Lee, D.T.1    Wong, C.K.2
  • 4
    • 84944047281 scopus 로고    scopus 로고
    • Efficient OLAP operations in spatial data warehouses
    • [PKZT01]
    • [PKZT01] D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient OLAP Operations in Spatial Data Warehouses. In SSTD, pages 443-459, 2001.
    • (2001) SSTD , pp. 443-459
    • Papadias, D.1    Kalnis, P.2    Zhang, J.3    Tao, Y.4
  • 5
  • 7
    • 0027311630 scopus 로고
    • Path computation algorithms for Advanced Traveller Information System (ATIS)
    • [SKC93]
    • [SKC93] S. Shekhar, A. Kohli, and M. Coyle. Path Computation Algorithms for Advanced Traveller Information System (ATIS). In ICDE, pages 31-39, 1993.
    • (1993) ICDE , pp. 31-39
    • Shekhar, S.1    Kohli, A.2    Coyle, M.3
  • 8
    • 0004616914 scopus 로고    scopus 로고
    • Closest point problems in computational geometry
    • [Smi97]. J.-R. Sack and J. Urrutia, editors, Elsevier Science Publishing
    • [Smi97] M. Smid. Closest Point Problems in Computational Geometry. In J.-R. Sack and J. Urrutia, editors, Handbook on Computational Geometry. Elsevier Science Publishing, 1997.
    • (1997) Handbook on Computational Geometry
    • Smid, M.1
  • 9
    • 26444614367 scopus 로고    scopus 로고
    • Discovery of influence sets in frequently updated databases
    • [SRAE01]
    • [SRAE01] I. Stanoi, M. Riedewald, D. Agrawal, and A. El Abbadi. Discovery of Influence Sets in Frequently Updated Databases. In VLDB, pages 99-108, 2001.
    • (2001) VLDB , pp. 99-108
    • Stanoi, I.1    Riedewald, M.2    Agrawal, D.3    El Abbadi, A.4
  • 10
    • 84861255699 scopus 로고    scopus 로고
    • [The03]. The R-tree-portal
    • [The03] Yannis Theodoridis. The R-tree-portal. http://www.rtreeportal. org, 2003.
    • (2003)
    • Theodoridis, Y.1
  • 11
    • 85028132868 scopus 로고    scopus 로고
    • Reverse kNN search in arbitrary dimensionality
    • [TPL04]
    • [TPL04] Y. Tao, D. Papadias, and X. Lian. Reverse kNN Search in Arbitrary Dimensionality. In VLDB, pages 744-755, 2004.
    • (2004) VLDB , pp. 744-755
    • Tao, Y.1    Papadias, D.2    Lian, X.3
  • 12
    • 0034996301 scopus 로고    scopus 로고
    • An index structure for efficient reverse nearest neighbor queries
    • [YL01]
    • [YL01] C. Yang and K.-I. Lin. An Index Structure for Efficient Reverse Nearest Neighbor Queries. In ICDE, pages 485-492, 2001.
    • (2001) ICDE , pp. 485-492
    • Yang, C.1    Lin, K.-I.2
  • 13
    • 0034998888 scopus 로고    scopus 로고
    • Incremental computation and maintenance of temporal aggregates
    • [YW01]
    • [YW01] J. Yang and J. Widom. Incremental Computation and Maintenance of Temporal Aggregates. In ICDE, pages 51-60, 2001.
    • (2001) ICDE , pp. 51-60
    • Yang, J.1    Widom, J.2


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