메뉴 건너뛰기




Volumn , Issue , 2009, Pages 17-24

An efficient multi-dimensional index for cloud data management

Author keywords

Distributed index; Multi dimensional index; Query processing

Indexed keywords

ALTERNATIVE APPROACH; CLOUD COMPUTING; CLOUD DATA; COMPLEX QUERIES; COST ESTIMATIONS; DATA MANAGEMENT; DATA RECORDS; DISTRIBUTED INDEX; FAST QUERY; INDEX MAINTENANCE; INDEX STRUCTURE; INDEX UPDATE; INDEXING TECHNIQUES; KD-TREE; MULTI-DIMENSIONAL QUERIES; ORDER OF MAGNITUDE; QUERY EFFICIENCY; RANGE QUERY;

EID: 74049128689     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1651263.1651267     Document Type: Conference Paper
Times cited : (87)

References (18)
  • 2
    • 74049157432 scopus 로고    scopus 로고
    • M. Lynch. Amazon elastic compute cloud (amazon ec2). [Online]. Available: http://aws.amazon.com/ec2/
    • M. Lynch. Amazon elastic compute cloud (amazon ec2). [Online]. Available: http://aws.amazon.com/ec2/
  • 4
    • 37549003336 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • January
    • J. Dean and S. Ghemawat, "Mapreduce: simplified data processing on large clusters," Communications of the ACM, vol. 51, pp. 107-113, January 2008.
    • (2008) Communications of the ACM , vol.51 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 7
    • 74049131356 scopus 로고    scopus 로고
    • Online, Available
    • Hadoop. [Online]. Available: http://hadoop.apache.org
    • Hadoop
  • 8
    • 74049121666 scopus 로고    scopus 로고
    • A practical scalable distributed b-tree
    • Auckland, New Zealand, August
    • M. K. Aguilera, W. Golab, and M. A. Shah, "A practical scalable distributed b-tree," in Proceedings of VLDB'08, Auckland, New Zealand, August 2008, pp. 598-609.
    • (2008) Proceedings of VLDB'08 , pp. 598-609
    • Aguilera, M.K.1    Golab, W.2    Shah, M.A.3
  • 9
    • 67650164795 scopus 로고    scopus 로고
    • Traverse: Simplified indexing on large map-reduce-merge clusters
    • Brisbane, Australia, April
    • H. chih Yang and D. S. Parker, "Traverse: Simplified indexing on large map-reduce-merge clusters," in Proceedings of DASFAA 2009, Brisbane, Australia, April 2009, pp. 308-322.
    • (2009) Proceedings of DASFAA 2009 , pp. 308-322
    • chih Yang, H.1    Parker, D.S.2
  • 10
    • 55849133671 scopus 로고    scopus 로고
    • Sinfonia: A new paradigm for building scalable distributed systems
    • Washington, USA, October
    • M. Aguilera, A. Merchant, M. Shah, A. Veitch, and C. Karamanolis, "Sinfonia: a new paradigm for building scalable distributed systems," in Proceeding of SOSP'07, Washington, USA, October 2007, pp. 159-174.
    • (2007) Proceeding of SOSP'07 , pp. 159-174
    • Aguilera, M.1    Merchant, A.2    Shah, M.3    Veitch, A.4    Karamanolis, C.5
  • 11
    • 74049123680 scopus 로고    scopus 로고
    • An indexing framework for efficient retrieval on the cloud
    • S. Wu and K.-L. Wu, "An indexing framework for efficient retrieval on the cloud," IEEE Data Eng. Bull., vol. 32, pp. 75-82, 2009.
    • (2009) IEEE Data Eng. Bull , vol.32 , pp. 75-82
    • Wu, S.1    Wu, K.-L.2
  • 12
    • 0026977857 scopus 로고
    • A distributed data-balanced dictionary based on the b-link tree
    • California, USA, March
    • T. Johnson and A. Colbrook, "A distributed data-balanced dictionary based on the b-link tree," in Proceeding of IPPS'92, California, USA, March 1992, pp. 319-324.
    • (1992) Proceeding of IPPS'92 , pp. 319-324
    • Johnson, T.1    Colbrook, A.2
  • 13
    • 84889681906 scopus 로고    scopus 로고
    • Boxwood: Abstractions as the foundation for storage infrastructure
    • San Francisco, California, USA, December
    • J. MacCormick, N. Murphy, M. Najork, C. Thekkath, and L. Zhou, "Boxwood: Abstractions as the foundation for storage infrastructure," in Proceeding of OSDI'04, San Francisco, California, USA, December 2004, pp. 105-120.
    • (2004) Proceeding of OSDI'04 , pp. 105-120
    • MacCormick, J.1    Murphy, N.2    Najork, M.3    Thekkath, C.4    Zhou, L.5
  • 14
    • 0034782005 scopus 로고    scopus 로고
    • Chord: A scalable peer-to-peer lookup service for internet applications
    • San Diego, California, USA, August
    • I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proceedings of SIGCOMM'01, San Diego, California, USA, August 2001, pp. 149-160.
    • (2001) Proceedings of SIGCOMM'01 , pp. 149-160
    • Stoica, I.1    Morris, R.2    Karger, D.3    Kaashoek, F.4    Balakrishnan, H.5
  • 15
    • 0034775826 scopus 로고    scopus 로고
    • A scalable content-addressable network
    • San Diego, California, United States, August
    • S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proceedings of SIGCOMM'01, San Diego, California, United States, August 2001, pp. 161-172.
    • (2001) Proceedings of SIGCOMM'01 , pp. 161-172
    • Ratnasamy, S.1    Francis, P.2    Handley, M.3    Karp, R.4    Shenker, S.5
  • 16
  • 17
    • 2442431247 scopus 로고
    • The r -tree: A dynamic index for multi-dimensional objects
    • T. K. Sellis, N. Roussopoulos, and C. Faloutsos, "The r -tree: A dynamic index for multi-dimensional objects," in The VLDB Journal, 1987, pp. 507-518.
    • (1987) The VLDB Journal , pp. 507-518
    • Sellis, T.K.1    Roussopoulos, N.2    Faloutsos, C.3


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