메뉴 건너뛰기




Volumn , Issue , 2011, Pages 349-360

Reverse spatial and textual k nearest neighbor search

Author keywords

reverse k nearest neighbor; spatial keyword query

Indexed keywords

BRANCH AND BOUND METHOD; DECISION TREES; FORESTRY; LOCATION; MEMBERSHIP FUNCTIONS; MOTION COMPENSATION; QUERY LANGUAGES; QUERY PROCESSING;

EID: 79959977087     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989361     Document Type: Conference Paper
Times cited : (141)

References (26)
  • 1
    • 34547628496 scopus 로고    scopus 로고
    • Approximate reverse k-nearest neighbor search in general metric spaces
    • E. Achtert, C. Böhm, P. Kröger, and P. Kunath. Approximate reverse k-nearest neighbor search in general metric spaces. In CIKM, pages 788-789, 2006.
    • (2006) CIKM , pp. 788-789
    • Achtert, E.1    Böhm, C.2    Kröger, P.3    Kunath, P.4
  • 2
    • 34250624528 scopus 로고    scopus 로고
    • Efficient reverse k-nearest neighbor search in arbitrary metric spaces
    • E. Achtert, C. Böhm, P. Kröger, and P. Kunath. Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In SIGMOD, pages 515-526, 2006.
    • (2006) SIGMOD , pp. 515-526
    • Achtert, E.1    Böhm, C.2    Kröger, P.3    Kunath, P.4
  • 3
    • 70349127600 scopus 로고    scopus 로고
    • Reverse k-nearest neighbor search in dynamic and general metric databases
    • E. Achtert, H.-P. Kriegel, P. Kröger, M. Renz, and A. Züfle. Reverse k-nearest neighbor search in dynamic and general metric databases. In EDBT, pages 886-897, 2009.
    • (2009) EDBT , pp. 886-897
    • Achtert, E.1    Kriegel, H.-P.2    Kröger, P.3    Renz, M.4    Züfle, A.5
  • 4
    • 84976823410 scopus 로고
    • Order-preserving minimal perfect hash functions and information retrieval
    • E. A.Fox, Q. F. Chen, A. M.Daoud, and L. S.Heath. Order-preserving minimal perfect hash functions and information retrieval. In TOIS, pages 281-308, 1991.
    • (1991) TOIS , pp. 281-308
    • Fox, E.A.1    Chen, Q.F.2    Daoud, A.M.3    Heath, L.S.4
  • 5
    • 79955090786 scopus 로고    scopus 로고
    • Retrieving top-k prestige-based relevant spatial web objects
    • X. Cao, G. Cong, and C. S. Jensen. Retrieving top-k prestige-based relevant spatial web objects. PVLDB, 3(1):373-384, 2010.
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 373-384
    • Cao, X.1    Cong, G.2    Jensen, C.S.3
  • 6
    • 77952774239 scopus 로고    scopus 로고
    • Efficient retrieval of the top-k most relevant spatial web objects
    • G. Cong, C. S.Jensen, and D. Wu. Efficient retrieval of the top-k most relevant spatial web objects. In PVLDB, pages 337-348, 2009.
    • (2009) PVLDB , pp. 337-348
    • Cong, G.1    Jensen, C.S.2    Wu, D.3
  • 7
    • 0034996301 scopus 로고    scopus 로고
    • An index structure for efficient reverse nearest neighbor queries
    • 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
  • 8
    • 85170282443 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial databases with noise
    • M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226-231, 1996.
    • (1996) KDD , pp. 226-231
    • Ester, M.1    Kriegel, H.-P.2    Sander, J.3    Xu, X.4
  • 9
    • 0038504811 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In J.Comput. Syst. Sci., pages 614-656, 2003.
    • (2003) J.Comput. Syst. Sci. , pp. 614-656
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 10
    • 0039845446 scopus 로고    scopus 로고
    • Influenced sets based on reverse nearest neighbor queries
    • F.Korn and S.Muthukrishnan. Influenced sets based on reverse nearest neighbor queries. In SIGMOD, pages 201-212, 2000.
    • (2000) SIGMOD , pp. 201-212
    • Korn, F.1    Muthukrishnan, S.2
  • 11
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
    • (1984) SIGMOD , pp. 47-57
    • Guttman, A.1
  • 12
    • 52649181521 scopus 로고    scopus 로고
    • Keyword search on spatial databases
    • I.D.Felipe, V.Hristidis, and N.Rishe. Keyword search on spatial databases. In ICDE, pages 656-665, 2008.
    • (2008) ICDE , pp. 656-665
    • Felipe, I.D.1    Hristidis, V.2    Rishe, N.3
  • 13
    • 26444614367 scopus 로고    scopus 로고
    • Discovery of influence sets in frequently updated databases
    • I.Stanoi, M.Riedewald, D.Agrawal, and A.E.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    Abbadi, A.E.4
  • 14
    • 0033886806 scopus 로고    scopus 로고
    • Text classification from labeled and unlabeled documents using em
    • K.Nigam, A.K.McCallum, S.Thrun, and T.M.Mitchel. Text classification from labeled and unlabeled documents using em. In Machine Learning, pages 103-134, 2000.
    • (2000) Machine Learning , pp. 103-134
    • Nigam, K.1    McCallum, A.K.2    Thrun, S.3    Mitchel, T.M.4
  • 16
    • 79959919225 scopus 로고    scopus 로고
    • J. Lu, Y. Lu, and G. Cong. Technical report, renmin university of china. 2011
    • J. Lu, Y. Lu, and G. Cong. Technical report, renmin university of china. 2011.
  • 18
    • 45549117987 scopus 로고
    • Term-weighting approaches in automatic text retrieval
    • Salton. Term-weighting approaches in automatic text retrieval. In Information Processing and Management, pages 513-523, 1988.
    • (1988) Information Processing and Management , pp. 513-523
    • Salton1
  • 19
    • 18744363040 scopus 로고    scopus 로고
    • High dimensional reverse nearest neighbor queries
    • A. Singh, H. Ferhatosmanoglu, and A. S. Tosun. High dimensional reverse nearest neighbor queries. In CIKM, pages 91-98, 2003.
    • (2003) CIKM , pp. 91-98
    • Singh, A.1    Ferhatosmanoglu, H.2    Tosun, A.S.3
  • 22
    • 85028132868 scopus 로고    scopus 로고
    • Reverse knn search in arbitrary dimensionality
    • 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
  • 23
    • 0029706786 scopus 로고    scopus 로고
    • A model for the prediction of r-tree performance
    • Y. Theodoridis and T. Sellis. A model for the prediction of r-tree performance. In PODS, pages 161-171, 1996.
    • (1996) PODS , pp. 161-171
    • Theodoridis, Y.1    Sellis, T.2
  • 25
    • 78049399793 scopus 로고    scopus 로고
    • Finch:Evaluating reverse k-nearest-neighbor queries on location data
    • W. Wu, F. Yang, C.-Y. Chan, and K.-L. Tan. Finch:evaluating reverse k-nearest-neighbor queries on location data. In PVLDB, pages 1056-1067, 2008.
    • (2008) PVLDB , pp. 1056-1067
    • Wu, W.1    Yang, F.2    Chan, C.-Y.3    Tan, K.-L.4
  • 26
    • 67649643445 scopus 로고    scopus 로고
    • Keyword search in spatial databases: Towards searching by document
    • D. Zhang, Y. M. Chee, A. Mondal, A. K. H. Tung, and M. Kitsuregawa. Keyword search in spatial databases: Towards searching by document. In ICDE, pages 688-699, 2009.
    • (2009) ICDE , pp. 688-699
    • Zhang, D.1    Chee, Y.M.2    Mondal, A.3    Tung, A.K.H.4    Kitsuregawa, M.5


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