메뉴 건너뛰기




Volumn , Issue , 2009, Pages 892-903

Distance-based representative skyline

Author keywords

[No Author keywords available]

Indexed keywords

2-D SPACE; COMPUTING DISTANCES; DISTANCE-BASED; DYNAMIC PROGRAMMING ALGORITHM; K POINTS; MULTIDIMENSIONAL ACCESS METHODS; NP-HARD; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME ALGORITHMS; SKYLINE POINT;

EID: 67649649603     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.84     Document Type: Conference Paper
Times cited : (180)

References (27)
  • 2
    • 1142279455 scopus 로고    scopus 로고
    • An optimal and progressive algorithm for skyline queries
    • D. Papadias, Y. Tao, G. Fu, and B. Seeger, "An optimal and progressive algorithm for skyline queries," in SIGMOD, 2003, pp. 467 -478.
    • (2003) SIGMOD , pp. 467-478
    • Papadias, D.1    Tao, Y.2    Fu, G.3    Seeger, B.4
  • 3
    • 34250655396 scopus 로고    scopus 로고
    • Finding k-dominant skylines in high dimensional space
    • C. Y. Chan, H. V. Jagadish, K.-L. Tan, A. K. H. Tung, and Z. Zhang, "Finding k-dominant skylines in high dimensional space," in SIGMOD, 2006, pp. 503 -514.
    • (2006) SIGMOD , pp. 503-514
    • Chan, C.Y.1    Jagadish, H.V.2    Tan, K.-L.3    Tung, A.K.H.4    Zhang, Z.5
  • 4
    • 34548740177 scopus 로고    scopus 로고
    • Selecting stars: The k most representative skyline operator
    • X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang, "Selecting stars: The k most representative skyline operator," in ICDE, 2007, pp. 86 -95.
    • (2007) ICDE , pp. 86-95
    • Lin, X.1    Yuan, Y.2    Zhang, Q.3    Zhang, Y.4
  • 5
    • 0021938963 scopus 로고
    • Clustering to minimize the maximum intercluster distance
    • T. F. Gonzalez, "Clustering to minimize the maximum intercluster distance," Theor. Comput. Sci., vol. 38, pp. 293 -306, 1985.
    • (1985) Theor. Comput. Sci , vol.38 , pp. 293-306
    • Gonzalez, T.F.1
  • 6
    • 84898929089 scopus 로고
    • Optimal algorithms for approximate clustering
    • T. Feder and D. Greene, "Optimal algorithms for approximate clustering," in STOC, 1988, pp. 434 -444.
    • (1988) STOC , pp. 434-444
    • Feder, T.1    Greene, D.2
  • 7
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: An efficient and robust access method for points and rectangles." in SIGMOD, 1990, pp. 322 -331.
    • (1990) SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.2    Schneider, R.3    Seeger, B.4
  • 8
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • G. R. Hjaltason and H. Samet, "Distance browsing in spatial databases." TODS, vol. 24, no. 2, pp. 265 -318, 1999.
    • (1999) TODS , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 10
    • 33749417750 scopus 로고    scopus 로고
    • Subsky: Efficient computation of skylines in subspaces
    • Y. Tao, X. Xiao, and J. Pei, "Subsky: Efficient computation of skylines in subspaces," in ICDE, 2006.
    • (2006) ICDE
    • Tao, Y.1    Xiao, X.2    Pei, J.3
  • 11
    • 33745596454 scopus 로고    scopus 로고
    • Catching the best views of skyline: A semantic approach based on decisive subspaces
    • J. Pei, W. Jin, M. Ester, and Y. Tao, "Catching the best views of skyline: A semantic approach based on decisive subspaces," in VLDB, 2005, pp. 253 -264.
    • (2005) VLDB , pp. 253-264
    • Pei, J.1    Jin, W.2    Ester, M.3    Tao, Y.4
  • 12
    • 85011068489 scopus 로고    scopus 로고
    • Probabilistic skylines on uncertain data
    • J. Pei, B. Jiang, X. Lin, and Y. Yuan, "Probabilistic skylines on uncertain data," in VLDB, 2007, pp. 15 -26.
    • (2007) VLDB , pp. 15-26
    • Pei, J.1    Jiang, B.2    Lin, X.3    Yuan, Y.4
  • 13
    • 0344756892 scopus 로고    scopus 로고
    • Efficient progressive skyline computation
    • K.-L. Tan, P.-K. Eng, and B. C. Ooi, "Efficient progressive skyline computation," in VLDB, 2001, pp. 301 -310.
    • (2001) VLDB , pp. 301-310
    • Tan, K.-L.1    Eng, P.-K.2    Ooi, B.C.3
  • 14
    • 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, pp. 275 -286.
    • (2002) VLDB , pp. 275-286
    • Kossmann, D.1    Ramsak, F.2    Rost, S.3
  • 15
    • 85011082513 scopus 로고    scopus 로고
    • Efficient skyline computation over low-cardinality domains
    • M. Morse, J. M. Patel, and H. V. Jagadish, "Efficient skyline computation over low-cardinality domains," in VLDB, 2007, pp. 267 -278.
    • (2007) VLDB , pp. 267-278
    • Morse, M.1    Patel, J.M.2    Jagadish, H.V.3
  • 16
    • 52649091214 scopus 로고    scopus 로고
    • Parallel distributed processing of constrained skyline queries by filtering
    • B. Cui, H. Lu, Q. Xu, L. Chen, Y. Dai, and Y. Zhou, "Parallel distributed processing of constrained skyline queries by filtering," in ICDE, 2008, pp. 546 -555.
    • (2008) ICDE , pp. 546-555
    • Cui, B.1    Lu, H.2    Xu, Q.3    Chen, L.4    Dai, Y.5    Zhou, Y.6
  • 17
    • 57149128192 scopus 로고    scopus 로고
    • Angle-based space partitioning for efficient parallel skyline computation
    • A. Vlachou, C. Doulkeridis, and Y. Kotidis, "Angle-based space partitioning for efficient parallel skyline computation," in SIGMOD, 2008, pp. 227 -238.
    • (2008) SIGMOD , pp. 227-238
    • Vlachou, A.1    Doulkeridis, C.2    Kotidis, Y.3
  • 18
    • 57149127376 scopus 로고    scopus 로고
    • Categorical skylines for streaming data
    • N. Sarkas, G. Das, N. Koudas, and A. K. H. Tung, "Categorical skylines for streaming data," in SIGMOD, 2008, pp. 239 -250.
    • (2008) SIGMOD , pp. 239-250
    • Sarkas, N.1    Das, G.2    Koudas, N.3    Tung, A.K.H.4
  • 19
    • 34548804369 scopus 로고    scopus 로고
    • Efficient skyline query processing on peer-to-peer networks
    • S. Wang, B. C. Ooi, A. K. H. Tung, and L. Xu, "Efficient skyline query processing on peer-to-peer networks," in ICDE, 2007, pp. 1126 -1135.
    • (2007) ICDE , pp. 1126-1135
    • Wang, S.1    Ooi, B.C.2    Tung, A.K.H.3    Xu, L.4
  • 20
    • 29844457794 scopus 로고    scopus 로고
    • Stratified computation of skylines with partially-ordered domains
    • C Y. Chan, P.-K. Eng, and K.-L. Tan, "Stratified computation of skylines with partially-ordered domains," in SIGMOD, 2005, pp. 203 -214.
    • (2005) SIGMOD , pp. 203-214
    • Chan, C.Y.1    Eng, P.-K.2    Tan, K.-L.3
  • 21
    • 85130512975 scopus 로고    scopus 로고
    • The spatial skyline queries
    • M. Sharifzadeh and C. Shahabi, "The spatial skyline queries," in VLDB, 2006, pp. 751 -762.
    • (2006) VLDB , pp. 751-762
    • Sharifzadeh, M.1    Shahabi, C.2
  • 22
    • 85011068298 scopus 로고    scopus 로고
    • Efficient computation of reverse skyline queries
    • E. Dellis and B. Seeger, "Efficient computation of reverse skyline queries," in VLDB, 2007, pp. 291 -302.
    • (2007) VLDB , pp. 291-302
    • Dellis, E.1    Seeger, B.2
  • 23
    • 57149142762 scopus 로고    scopus 로고
    • Monochromatic and bichromatic reverse skyline search over uncertain databases
    • X. Lian and L. Chen, "Monochromatic and bichromatic reverse skyline search over uncertain databases," in SIGMOD, 2008, pp. 213 -226.
    • (2008) SIGMOD , pp. 213-226
    • Lian, X.1    Chen, L.2
  • 24
    • 85011039411 scopus 로고    scopus 로고
    • Privacy skyline: Privacy with multidimensional adversarial knowledge
    • B.-C. Chen, R. Ramakrishnan, and K. LeFevre, "Privacy skyline: Privacy with multidimensional adversarial knowledge," in VLDB, 2007, pp. 770 -781.
    • (2007) VLDB , pp. 770-781
    • Chen, B.-C.1    Ramakrishnan, R.2    LeFevre, K.3
  • 25
    • 77049084314 scopus 로고    scopus 로고
    • Approximately dominating representatives
    • V. Koltun and C. H. Papadimitriou, "Approximately dominating representatives," in ICDT, 2005, pp. 204 -214.
    • (2005) ICDT , pp. 204-214
    • Koltun, V.1    Papadimitriou, C.H.2
  • 27
    • 0018542104 scopus 로고
    • Easy and hard bottleneck location problems
    • W. L. Hsu and G. L. Nemhauser, "Easy and hard bottleneck location problems," Disc. Appl. Math., vol. 1, pp. 209 -216, 1979.
    • (1979) Disc. Appl. Math , vol.1 , pp. 209-216
    • Hsu, W.L.1    Nemhauser, G.L.2


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