메뉴 건너뛰기




Volumn , Issue , 2008, Pages 512-521

Correlation-aware object placement for multi-object operations

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION OVERHEADS; COMPUTATION COSTS; DATA PLACEMENT; DISTRIBUTED APPLICATIONS; DISTRIBUTED COMPUTING SYSTEMS; FULL-TEXT SEARCH ENGINES; INTERNATIONAL CONFERENCES; KEYWORD INDEX; LINEAR PROGRAMMING RELAXATION; MULTI OBJECTS; NODE SPACE; NP-HARD; OBJECT PLACEMENT; OPTIMAL PLACEMENTS; PAIR CORRELATIONS; POLYNOMIAL-TIME APPROXIMATION; QUADRATIC ASSIGNMENT PROBLEM; REAL-WORLD; SEARCH QUERIES; SYSTEM SIZES; WEB PAGES;

EID: 51849147401     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2008.60     Document Type: Conference Paper
Times cited : (11)

References (15)
  • 3
    • 51849086068 scopus 로고    scopus 로고
    • The Open Directory Project. http://www.dmoz.com.
  • 4
    • 0033335479 scopus 로고    scopus 로고
    • Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields
    • J. Kleinberg and E. Tardos. Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. In 40th IEEE Symp. on Foundations of Computer Science, pages 14-23, 1999.
    • (1999) 40th IEEE Symp. on Foundations of Computer Science , pp. 14-23
    • Kleinberg, J.1    Tardos, E.2
  • 5
    • 0002384937 scopus 로고
    • Assignment Problems and the Location of Economics Activities
    • T. Koopmans and M. Beckman. Assignment Problems and the Location of Economics Activities. Econometrica, 25:53-76, 1957.
    • (1957) Econometrica , vol.25 , pp. 53-76
    • Koopmans, T.1    Beckman, M.2
  • 7
    • 0024106885 scopus 로고
    • Heuristic Algorithms for Task Assignment in Distributed Systems
    • V. Lo. Heuristic Algorithms for Task Assignment in Distributed Systems. IEEE Trans. on Computers, 37(11):1384-1397, 1988.
    • (1988) IEEE Trans. on Computers , vol.37 , Issue.11 , pp. 1384-1397
    • Lo, V.1
  • 8
    • 51849107560 scopus 로고    scopus 로고
    • LPsolve. http://lpsolve.sourceforge.net/5.1/.
    • LPsolve
  • 10
    • 0016973706 scopus 로고
    • P-Complete Approximation Problems
    • S. Sahni and T. Gonzalez. P-Complete Approximation Problems. Journal of ACM, 23:555-565, 1976.
    • (1976) Journal of ACM , vol.23 , pp. 555-565
    • Sahni, S.1    Gonzalez, T.2
  • 11
    • 51849101311 scopus 로고    scopus 로고
    • SMART. ftp://ftp.cs.cornell.edu/pub/smart.
    • SMART. ftp://ftp.cs.cornell.edu/pub/smart.
  • 13
    • 51849124789 scopus 로고    scopus 로고
    • Optimizing Data Popularity Conscious Bloom Filters
    • Technical Report 918, Dept. of Computer Science, Univ. of Rochester
    • M. Zhong, P. Lu, K. Shen, and J. Seiferas. Optimizing Data Popularity Conscious Bloom Filters. Technical Report 918, Dept. of Computer Science, Univ. of Rochester, 2008.
    • (2008)
    • Zhong, M.1    Lu, P.2    Shen, K.3    Seiferas, J.4
  • 14
    • 34548744567 scopus 로고    scopus 로고
    • An Evaluation and Comparison of Current Peer-to-Peer Full-Text Keyword Search Techniques
    • M. Zhong, J. Moore, K. Shen, and A. Murphy. An Evaluation and Comparison of Current Peer-to-Peer Full-Text Keyword Search Techniques. In 8th Int'l Workshop on the Web and Databases, pages 61-66, 2005.
    • (2005) 8th Int'l Workshop on the Web and Databases , pp. 61-66
    • Zhong, M.1    Moore, J.2    Shen, K.3    Murphy, A.4
  • 15
    • 57549110799 scopus 로고    scopus 로고
    • Replication Degree Customization for High Availability
    • M. Zhong, K. Shen, and J. Seiferas. Replication Degree Customization for High Availability. In Third EuroSys Conf., 2008.
    • (2008) Third EuroSys Conf
    • Zhong, M.1    Shen, K.2    Seiferas, J.3


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