arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.0435cs.DBcs.SIphysics.soc-ph
收藏

使用Enmeshed网络的可扩展社会协调

Scalable Social Coordination using Enmeshed Queries

Jianjun Chen, Ashwin Machanavajjhala, George Varghese

摘要:

社交协调允许用户超越对朋友的认识,有效地协调与他人的身体活动。虽然可以在Evite,Meetings和Groupon等工具中看到特定形式的社交协调,但我们引入了一个更通用的模型,使用我们称之为嵌入式查询。网络化查询允许用户通过指定社交属性(如所需的组大小和谁/什么/何时)来声明性地指定协调意图,并且数据库返回匹配查询。纠缠查询是连续的,但新的查询(而不是数据)回答旧的查询;可变的组大小也使纠缠查询不同于纠缠查询,搜索订阅系统和约会服务。我们发现,即使离线组协调使用交织查询是NP难的。然后,我们引入高效的搜索引擎,使用选择性的索引,如位置和时间,以减少可能的匹配空间,我们还添加了改进,如延迟评估和使用用户的相对匹配性,以确定搜索顺序。我们描述了一个集中的实现和评估其性能对最佳算法。我们表明,不过早停止(找到匹配后)和延迟评估的结果相结合,发现86%的最佳算法发现的匹配的算法,并采取平均40 usec每个查询使用1个核心的2.5 GHz的服务器机器。此外,该算法具有良好的延迟,对大组大小的请求相当公平,并且可以使用多个核心和多个服务器扩展到全局工作负载。最后,我们描述了潜在的概括,增加价格,建议,和数据采掘的基本交织查询。

英文摘要:

Social coordination allows users to move beyond awareness of their friends to efficiently coordinating physical activities with others. While specific forms of social coordination can be seen in tools such as Evite, Meetup and Groupon, we introduce a more general model using what we call enmeshed queries. An enmeshed query allows users to declaratively specify an intent to coordinate by specifying social attributes such as the desired group size and who/what/when, and the database returns matching queries. Enmeshed queries are continuous, but new queries (and not data) answer older queries; the variable group size also makes enmeshed queries different from entangled queries, publish-subscribe systems, and dating services. We show that even offline group coordination using enmeshed queries is NP-hard. We then introduce efficient heuristics that use selective indices such as location and time to reduce the space of possible matches; we also add refinements such as delayed evaluation and using the relative matchability of users to determine search order. We describe a centralized implementation and evaluate its performance against an optimal algorithm. We show that the combination of not stopping prematurely (after finding a match) and delayed evaluation results in an algorithm that finds 86% of the matches found by an optimal algorithm, and takes an average of 40 usec per query using 1 core of a 2.5 Ghz server machine. Further, the algorithm has good latency, is reasonably fair to large group size requests, and can be scaled to global workloads using multiple cores and multiple servers. We conclude by describing potential generalizations that add prices, recommendations, and data mining to basic enmeshed queries.

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

↑