CHORUS - Top-k Composition of Browsing Scripts for efficient social-enabled Usage of Web-based Services

Web提供了对大量信息和功能的访问，数十亿个网站高度分布并由各自的提供商自主维护。对于日益复杂的用例，最终用户需要从属于不同网站的各种网页提取、联合收割机和聚合信息。通常所需的信息位于网络深处，也就是说，只有在与网站进行某些交互后才能访问。此外，当这种复杂的任务反复出现时，它甚至更加耗时。目前的技术和研究状况对最终用户有效地将来自各种网站的所需信息汇编在一起提供的支持很少。搜索引擎通常专注于推荐用户可能或应该访问的网站，而不是回答用户的整体信息需求。语义网和关联数据等方法对数据采取静态视图，并依赖于提供者的合作。Web自动化脚本最初是为测试网站开发的，允许最终用户将其浏览活动捕获为可执行流程，并与其他最终用户共享。这种技术是非常有前途的，使最终用户进入面向提供商的网络。然而，为了充分发挥最终用户脚本的潜力，特别是可重用性，需要高效的脚本搜索和组合技术。在这个项目中，我们将开发浏览脚本的top-k组合方法。我们的方法将基于脚本的正式语义，它们的功能和非功能属性，用户偏好和结构化查询，同时仍然支持语法异构性的互操作性。特别是，我们将开发的方法，排名脚本和脚本组合，根据用户的喜好，以及检索和组成的脚本，以满足在结构化查询中指定的要求。与现有的排名机制，专注于精确计算的排名，因此必须妥协的表现力仍然是一个可接受的性能，我们将允许规范模糊的偏好通过模糊规则。 模糊规则比现有的偏好语言更具有表达性，并且存在有效的模糊规则推理方法。我们将研究是否以及如何从组件脚本的等级中以组合的方式计算脚本组合的等级。为了有效地检索给定查询的匹配脚本，我们将通过适当的索引来增强朴素的模型检查技术。为了实现高效的脚本合成，我们将开发基于计划空间规划的方法。 合成方法将利用检索方法。在这两种方法中，我们的目标是只计算top-k，而不是完整的答案列表。

The Web provides access to a huge amount of information and functionality with billions of websites that are highly distributed and maintained autonomously by their respective providers. For increasingly sophisticated use cases an end user needs to extract, combine, and aggregate information from various web pages belonging to different websites. Often required information lies deep in the web, that is, it is accessible only after performing certain interactions with the web site. Furthermore, it is even more time consuming when such complex tasks are recurring. Current technologies and state of research offer little support for end users in efficiently compiling together the required information from various web sites. Search engines usually focus on recommending websites that a user may or should visit, but not on answering the overall information need of the user. Approaches such as Semantic Web and Linked Data take a static view on the data and rely on cooperation of providers. Web automation scripts, initially developed for test websites, allow end users to capture their browsing activities as executable processes and share them with other end users. Such a technique is very promising for bringing end users into a provider oriented web. However, in order to benefit the full potential of end user scripts, especially the reusability feature, efficient script search and composition techniques are required.In this project we will develop methods for top-k composition of browsing scripts. Our methods will be based on formal semantics of the scripts, their functional and non-functional properties, user preferences and structured queries while still supporting syntactic heterogeneity for the purpose of interoperability. In particular, we will develop methods for ranking scripts and script compositions according to user preferences as well as retrieval and composition of scripts to full the requirement specified in a structured query. In contrast to existing ranking mechanisms that focus on precise computation of a rank and therefore have to compromise on the expressivity to still an acceptable performance, we will allow specification of vague preference by means of fuzzy rules. Fuzzy rules are more expressive than the existing preference languages and there exist efficient inference methods for fuzzy rules. We will investigate whether and how the rank of a script composition can be computed in a compositional fashion from the ranks of the component scripts. In order to retrieve matching scripts for a given query efficiently, we will augment naïve model-checking techniques by appropriate indexes. In order to achieve efficient script composition, we will develop methods based on Plan Space Planning. The composition method will make use of the retrieval method. In both the methods we aim at computing only top-k instead of complete list of answers.