复杂用户简档下的查询调度
Query Scheduling in the Presence of Complex User Profiles
摘要:
Web技术的进步使得个性化代理能够通过重复查询多个易变数据源来帮助用户满足其复杂的信息监视和聚合需求。当试图最大化所服务的客户端的数量同时完全满足客户端的复杂用户简档时,这样的代理面临可伸缩性的挑战。在这项工作中,我们使用一个抽象的复杂的执行间隔(CEIs)构建在简单的执行间隔(EI)表示用户简档,并使用现有的离线近似作为基线,最大限度地提高捕获CEIs的完整性。我们提出了三个启发式解决方案的查询调度,以满足复杂的用户简档的在线问题。第一个只考虑个别EI的属性,而其他两个利用CEI中所有EI的属性。我们使用一组广泛的实验,真正的痕迹和合成数据,利用知识的CEI占主导地位,在多个参数设置。
英文摘要:
Advances in Web technology enable personalization proxies that assist users in satisfying their complex information monitoring and aggregation needs through the repeated querying of multiple volatile data sources. Such proxies face a scalability challenge when trying to maximize the number of clients served while at the same time fully satisfying clients' complex user profiles. In this work we use an abstraction of complex execution intervals (CEIs) constructed over simple execution intervals (EIs) represents user profiles and use existing offline approximation as a baseline for maximizing completeness of capturing CEIs. We present three heuristic solutions for the online problem of query scheduling to satisfy complex user profiles. The first only considers properties of individual EIs while the other two exploit properties of all EIs in the CEI. We use an extensive set of experiments on real traces and synthetic data to show that heuristics that exploit knowledge of the CEIs dominate across multiple parameter settings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。