CluE: Towards Scalable Primitives for Graph Operations

CluE：走向可扩展的图操作基元

• 批准号: 0847925
• 负责人: Ben Zhao
• 金额: $ 45万
• 依托单位: University of California-Santa Barbara
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2009
• 资助国家: 美国
• 起止时间: 2009-04-01 至 2012-03-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0847925&HistoricalAwards=false
• 关键词: CluE; Towards; Scalable; Primitives; Graph

Many of today's data-intensive application domains, including searches on social networks and module searches in biological pathways, require complex queries on large graph datasets. Their highly connected nature means graph operations tend to "crawl" across many links, resulting in very large memory footprints that strain resources on today's commodity servers. In addition, current application platforms lack abstractions for graph operations, leaving developers to implement a variety of complex standalone graph query components. The PIs of the UCSB Massive Graphs In Clusters (MAGIC) project are developing a scalable infrastructure to provide high level abstractions for graph primitives, simplifying design of complex queries while addressing difficult challenges of maximizing data parallelism and adaptive graph partitioning across clusters. Advances from this project will include data partitioning techniques, novel primitives for graph operations, and a software infrastructure that together expand the applicability of scalable cluster infrastructures such as MapReduce and Dryad to graph-oriented queries in social networks and biological graphs.

当今的许多数据密集型应用领域，包括社交网络上的搜索和生物途径中的模块搜索，都需要对大型图形数据集进行复杂的查询。 它们的高度连接性意味着图操作倾向于在许多链接上“爬行”，导致非常大的内存占用，使当今的商品服务器上的资源紧张。 此外，当前的应用平台缺乏对图操作的抽象，使得开发人员实现各种复杂的独立图查询组件。 UCSB Massive Graphs In Clusters（MAGIC）项目的PI正在开发一个可扩展的基础设施，为图形原语提供高级抽象，简化复杂查询的设计，同时解决最大化数据并行性和跨集群自适应图形分区的困难挑战。该项目的进展将包括数据分区技术，图形操作的新原语，以及软件基础设施，这些基础设施共同扩展了可扩展的集群基础设施（如MapReduce和Dryad）在社交网络和生物图中面向图形查询的适用性。