Per-node custom code engine for distributed query processing

user-613ea93de55422cecdace10f(2017)

引用 13|浏览2
暂无评分
摘要
Distributed query processing is often performed by a set of nodes that apply MapReduce to a data set and materialize partial results to storage, which are then aggregated to produce the query result. However, this architecture requires a preconfigured set of database nodes; can only fulfill queries that utilize MapReduce processing; and may be slowed down by materializing partial results to storage. Instead, distributed query processing can be achieved by choosing a node for various portions of the query, and generating customized code for the node that only performs the query portion that is allocated to the node. The node executes the code to perform the query portion, and rather than materializing partial results to storage, streams intermediate query results to a next selected node in the distributed query. Nodes selection may be involve matching the details of the query portion with the characteristics and capabilities of the available nodes.
更多
查看译文
关键词
Query optimization,Node (computer science),Set (abstract data type),Code (cryptography),Computer network,Data set (IBM mainframe),Matching (graph theory),Database,Computer science,Selection (relational algebra)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要