메뉴 건너뛰기




Volumn 3202, Issue , 2004, Pages 255-266

Mining thick skylines over large databases

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; SAMPLING;

EID: 35048903758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30116-5_25     Document Type: Article
Times cited : (49)

References (16)
  • 1
    • 85028870288 scopus 로고    scopus 로고
    • Fast linear expected-time alogorithms for computing maxima and convex hulls
    • J. L. Bentley, K. L. Clarkson, D. B. Levine. Fast linear expected-time alogorithms for computing maxima and convex hulls. In SODA 1990.
    • SODA 1990
    • Bentley, J.L.1    Clarkson, K.L.2    Levine, D.B.3
  • 2
    • 79956329427 scopus 로고    scopus 로고
    • Efficient Distributed Skylining for Web Information Systems
    • W.-T. Balke, U. Güntzer, J. X. Zheng. Efficient Distributed Skylining for Web Information Systems In EBDT 2004.
    • EBDT 2004
    • Balke, W.-T.1    Güntzer, U.2    Zheng, J.X.3
  • 5
    • 1542381961 scopus 로고    scopus 로고
    • Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
    • Alexander Hinneburg, Daniel A. Keim Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering. VLDB 1999: 506-517
    • VLDB 1999 , pp. 506-517
    • Hinneburg, A.1    Keim, D.A.2
  • 6
    • 84942892810 scopus 로고    scopus 로고
    • Mining Top-n Local Outliers in Very Large Databases
    • W. Jin, K. H. Tung, and J. Han. Mining Top-n Local Outliers in Very Large Databases. In KDD 2001.
    • KDD 2001
    • Jin, W.1    Tung, K.H.2    Han, J.3
  • 7
    • 0016564037 scopus 로고
    • On finding the maxima of a set of vectors
    • H. T. Kung et. al. On finding the maxima of a set of vectors. JACM, 22(4), 1975.
    • (1975) JACM , vol.22 , Issue.4
    • Kung, H.T.1
  • 8
    • 23944480086 scopus 로고    scopus 로고
    • Shooting Stars in the Sky: An Online Algorithm for Skyline Queries
    • D. Kossmann, F. Ramsak, and S. Rost. Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. In VLDB 2002.
    • VLDB 2002
    • Kossmann, D.1    Ramsak, F.2    Rost, S.3
  • 13
    • 77954726179 scopus 로고    scopus 로고
    • An Optimal and Progressive Algoroithm for Skyline Queries
    • D. Papadias, Y. Tao, G. Fu, and B. Seeger. An Optimal and Progressive Algoroithm for Skyline Queries. In SIGMOD'03.
    • SIGMOD'03
    • Papadias, D.1    Tao, Y.2    Fu, G.3    Seeger, B.4
  • 14
    • 0024031511 scopus 로고
    • An Optimal Parallel Algorithm for Solving the Maximal Elements Problem in the Plane
    • I. Stojmenovic and M. Miyakawa. An Optimal Parallel Algorithm for Solving the Maximal Elements Problem in the Plane. In Parallel Computing, 7(2), 1988.
    • (1988) Parallel Computing , vol.7 , Issue.2
    • Stojmenovic, I.1    Miyakawa, M.2
  • 15
    • 0344756892 scopus 로고    scopus 로고
    • Efficient Progressive Skyline Computation
    • K. Tan et al. Efficient Progressive Skyline Computation. In VLDB 2001.
    • VLDB 2001
    • Tan, K.1
  • 16
    • 0030157145 scopus 로고    scopus 로고
    • BIRCH: An efficient data clustering method for very large databases
    • T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In SIGMOD'96.
    • SIGMOD'96
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3


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