Database Reference
In-Depth Information
5. Apache Hama. http://hama.apache.org/.
6. S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, and Z. Ives. Dbpedia: A nucleus for a web
of open data. In
6th International Semantic Web Conference
, pages 11-15, 2007.
7. D. Bader and K. Madduri. SNAP, small-world network analysis and partitioning: An
open-source parallel graph framework for the exploration of large-scale networks. In
IPDPS
, pages 1-12, 2008.
8. P. Bailis, A. Fekete, A. Ghodsi, J. M. Hellerstein, and I. Stoica. Hat, not cap: Highly
available transactions.
CoRR
, abs/1302.0309, 2013.
9. U. Benlic and J.-K. Hao. An effective multilevel memetic algorithm for balanced graph
partitioning. In
ICTAI
(1), pages 121-128, 2010.
10. T. Benson, A. Akella, and D. A. Maltz. Network traffic characteristics of data centers in
the wild. In
IMC
, 2010.
11. M. J. Berger and S. H. Bokhari. A partitioning strategy for nonuniform problems on
multi-processors.
IEEE Trans. Comput.
, 36(5):570-580, May 1987.
12. J. W. Berry, B. Hendrickson, S. Kahan, and P. Konecny. Software and algorithms for
graph queries on multithreaded architectures. In
IPDPS
, pages 1-14, March 2007. IEEE.
13. Bing Index Team. Understand your world with Bing. http://hk.bing.com/blogs/site
blogs/b/search/archive/2013/03/21/satorii.aspx, 2013.
14. A. E. Brouwer and W. H. Haemers.
Spectra of Graphs
. Springer, 2012.
15. T. N. Bui and C. Jones. Finding good approximate vertex and edge partitions is np-hard.
Inf. Process. Lett.
, 42(3):153-159, May 1992.
16. T. N. Bui and L. C. Strite. An ant system algorithm for graph bisection. In
GECCO
,
pages 43-51, 2002.
17. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra,
A. Fikes, and R. E. Gruber. Bigtable: A distributed storage system for structured data. In
OSDI
, pages 205-218, 2006.
18. R. Chen, X. Weng, B. He, and M. Yang. Large graph processing in the cloud. In
Proceedings of the 2010 ACM SIGMOD International Conference on Management of
data, SIGMOD'10
, pages 1123-1126, New York, 2010. ACM.
19. R. Chen, M. Yang, X. Weng, B. Choi, B. He, and X. Li. Improving large graph process-
ing on partitioned graphs in the cloud. In
SoCC
, pages 3:1-3:13, 2012.
20. F. Chung. Spectral Graph Theory. Conference Board of the Mathematical Sciences,
1997.
21. J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. J. Furman, S. Ghemawat et al.
Spanner: Google's globally-distributed database. In
Proceedings of the 10th USENIX
Conference on Operating Systems Design and Implementation, OSDI'12
, pages 251-
264, Berkeley, CA, USA, 2012. USENIX Association.
22. S. Das, D. Agrawal, and A. El Abbadi. G-store: A scalable data store for transactional
multi key access in the cloud. In
SoCC: ACM Symposium on Cloud Computing
, 2010.
23. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters.
Commun. ACM
, 51(1):107-113, January 2008.
24. B. Derbel, M. Mosbah, and A. Zemmari. Fast distributed graph partition and applica-
tion. In
IPDPS
, 2006.
25. W. E. Donath and A. J. Hoffman. Lower bounds for the partitioning of graphs.
IBM J.
Res. Dev.
, 17(5):420-425, September 1973.
26. C. Farhat and M. Lesoinne. Automatic partitioning of unstructured meshes for the par-
allel solution of problems in computational mechanics.
Int. J. Numer. Methods Eng.
,
36(5):745-764, 1993.
27. B. Farley, A. Juels, V. Varadarajan, T. Ristenpart, K. D. Bowers, and M. M. Swift. More
for your money: Exploiting performance heterogeneity in public clouds. In
Proceedings
of the Third ACM Symposium on Cloud Computing, SoCC'12
, pages 20:1-20:14, New
York, 2012. ACM.
Search WWH ::
Custom Search