메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1052-1063

Efficient skyline retrieval with arbitrary similarity measures

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE SETS; DATA DISTRIBUTION; DISK ACCESS COST; LOWER BOUNDS; METRIC SPACES; NON-METRIC SPACES; ON-LINE ALGORITHMS; ORDERS OF MAGNITUDE; PRIOR KNOWLEDGE; RESPONSE TIME; SIMILARITY MEASURE; SKYLINE QUERY; STATE-OF-THE-ART ALGORITHMS; TREE-BASED ALGORITHMS;

EID: 70349127599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516480     Document Type: Conference Paper
Times cited : (8)

References (21)
  • 1
    • 70349106068 scopus 로고    scopus 로고
    • How fast is your disk? http://www.linuxinsight.com/how-fast-is-your- disk.html, January 2007.
    • How fast is your disk? http://www.linuxinsight.com/how-fast-is-your- disk.html, January 2007.
  • 3
    • 35048816109 scopus 로고    scopus 로고
    • Efficient distributed skylining for web information systems
    • W.-T. Balke, U. Güntzer, and J. X. Zheng. Efficient distributed skylining for web information systems. In EDBT, pages 256-273, 2004.
    • (2004) EDBT , pp. 256-273
    • Balke, W.-T.1    Güntzer, U.2    Zheng, J.X.3
  • 5
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
    • (1975) Commun. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 8
    • 43349099742 scopus 로고    scopus 로고
    • Gray and Horst. Windows 2000 disk io performance
    • June
    • W. Chung, Gray and Horst. Windows 2000 disk io performance. Microsoft Research TR, June 2000.
    • (2000) Microsoft Research TR
    • Chung, W.1
  • 9
    • 34548719251 scopus 로고    scopus 로고
    • Multi-source skyline query processing in road networks
    • K. Deng, X. Zhou, and H. T. Shen. Multi-source skyline query processing in road networks. In ICDE, 2007.
    • (2007) ICDE
    • Deng, K.1    Zhou, X.2    Shen, H.T.3
  • 10
    • 43349104169 scopus 로고    scopus 로고
    • Efficient online top-k retrieval with arbitrary similarity measures
    • P. Deshpande, Deepak, and K. Kummamuru. Efficient online top-k retrieval with arbitrary similarity measures. In EDBT, 2008.
    • (2008) EDBT
    • Deshpande, P.1    Deepak2    Kummamuru, K.3
  • 11
    • 0034819889 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • ACM
    • R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS. ACM, 2001.
    • (2001) PODS
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 12
    • 0038504811 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614-656, 2003.
    • (2003) J. Comput. Syst. Sci , vol.66 , Issue.4 , pp. 614-656
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 13
    • 33745601731 scopus 로고    scopus 로고
    • Maximal vector computation in large data sets
    • P. Godfrey, R. Shipley, and J. Gryz. Maximal vector computation in large data sets. In VLDB, 2005.
    • (2005) VLDB
    • Godfrey, P.1    Shipley, R.2    Gryz, J.3
  • 15
    • 23944480086 scopus 로고    scopus 로고
    • Shooting stars in the sky: An online algorithm for skyline queries
    • Morgan Kaufmann
    • D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: An online algorithm for skyline queries. In VLDB, pages 275-286. Morgan Kaufmann, 2002.
    • (2002) VLDB , pp. 275-286
    • Kossmann, D.1    Ramsak, F.2    Rost, S.3
  • 16
  • 17
    • 23944477932 scopus 로고    scopus 로고
    • Progressive skyline computation in database systems
    • D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. ACM Trans. Database Syst., 30(l):41-82, 2005.
    • (2005) ACM Trans. Database Syst , vol.30 , Issue.L , pp. 41-82
    • Papadias, D.1    Tao, Y.2    Fu, G.3    Seeger, B.4
  • 18
    • 0344756892 scopus 로고    scopus 로고
    • Efficient progressive skyline computation
    • Morgan Kaufmann
    • K.-L. Tan, P.-K. Eng, and B. C. Ooi. Efficient progressive skyline computation. In VLDB, pages 301-310. Morgan Kaufmann, 2001.
    • (2001) VLDB , pp. 301-310
    • Tan, K.-L.1    Eng, P.-K.2    Ooi, B.C.3
  • 19
    • 33749417750 scopus 로고    scopus 로고
    • Subsky: Efficient computation of skylines in subspaces
    • IEEE Computer Society
    • Y. Tao, X. Xiao, and J. Pei. Subsky: Efficient computation of skylines in subspaces. In ICDE, page 65. IEEE Computer Society, 2006.
    • (2006) ICDE , pp. 65
    • Tao, Y.1    Xiao, X.2    Pei, J.3
  • 20
    • 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, pages 1126-1135, 2007.
    • (2007) ICDE , pp. 1126-1135
    • Wang, S.1    Ooi, B.C.2    Tung, A.K.H.3    Xu, L.4


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