arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1511.04583cs.PLcs.AIcs.DB
收藏

需求驱动的增量对象管理

Demand-Driven Incremental Object Queries

Stony Brook University(石溪大学)

Yanhong A. Liu, Jon Brandvein, Scott D. Stoller, Bo Lin

摘要:

对象查询在信息搜索和决策制定等广泛的应用领域中是必不可少的。但是,查询可能涉及对象和集合上的复杂条件,这些条件可以任意嵌套和别名化。所涉及的对象和集合以及需求-给定的感兴趣的参数值-可以任意改变。如何在所有可能的更新下有效地实现对象查询,并进一步提供复杂性保证?本文介绍了一种自动化的方法。该方法允许以完全声明的方式编写强大的查询。它将需求以及所有对象和集合转化为关系。最重要的是,它不仅为查询结果定义了不变量,而且还为涉及的对象和集合的所有辅助值(包括用于传播需求的值)定义了不变量,并增量地维护所有这些不变量。从各种应用领域的问题,包括分布式算法和概率查询的实施和实验,确认分析的复杂性,权衡,并在以前的工作显着改善。

英文摘要:

Object queries are essential in information seeking and decision making in vast areas of applications. However, a query may involve complex conditions on objects and sets, which can be arbitrarily nested and aliased. The objects and sets involved as well as the demand---the given parameter values of interest---can change arbitrarily. How to implement object queries efficiently under all possible updates, and furthermore to provide complexity guarantees? This paper describes an automatic method. The method allows powerful queries to be written completely declaratively. It transforms demand as well as all objects and sets into relations. Most importantly, it defines invariants for not only the query results, but also all auxiliary values about the objects and sets involved, including those for propagating demand, and incrementally maintains all of them. Implementation and experiments with problems from a variety of application areas, including distributed algorithms and probabilistic queries, confirm the analyzed complexities, trade-offs, and significant improvements over prior work.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑