会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Technique for finding rest resources using an n-ary tree structure navigated using a collision free progressive hash
    • 使用无碰撞渐进散列导航的n-ary树结构查找休息资源的技术
    • US07774380B2
    • 2010-08-10
    • US11963338
    • 2007-12-21
    • Thomas C. BurkeAnnapureddy S. ReddyAravind Srinivasan
    • Thomas C. BurkeAnnapureddy S. ReddyAravind Srinivasan
    • G06F17/30
    • G06F17/30961Y10S707/99942
    • The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.
    • 本发明公开了一种数据结构,其给出了用于表示状态转移(REST)资源的标识符,可以快速产生配置的目标并且同时产生针对目标的所有配置的基于模式的规则和约束。 公开的数据结构是包括URL部分的节点的树结构。 每个节点与确保冲突发生不存在的方式专门生长的散列树相关联。 树结构实际上是两个或多个叠加的树; 一个用于URL模式匹配以确定目标,另一个用于确定约束。 可以使用可以基于渐进散列的单个树遍历来同时确定目标和一组约束,其表示与需要多个不同的查询/响应操作以产生等效结果的常规实现相比改进的性能。