会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明申请
    • Multidimensional hashed tree based URL matching engine using progressive hashing
    • 基于多维散列树的URL匹配引擎使用渐进散列
    • US20050055437A1
    • 2005-03-10
    • US10657941
    • 2003-09-09
    • Erik BurckartAravind Srinivasan
    • Erik BurckartAravind Srinivasan
    • G06F15/173G06F17/30
    • G06F17/30949G06F17/30887Y10S707/99933Y10S707/99942
    • A mechanism by which URLs are progressively hashed character by character and clauses of the URL are used to traverse a tree data structure for matching of the URL to resources/rules is provided. The hash code for a single character is appended to a prior hash code for a preceding character in the URL portion. At the time that the entire portion of the URL is hashed, as determined based on the presence of a delimiter character, the particular node in a tree data structure associated with the resulting hash code is identifiable within a hash table of a current node of the tree data structure. Each node in the tree data structure includes a multidimensional hash table for a portion of a URL. The multidimensional hash table is established and grown in a manner that ensures there are no hash collisions. Each portion of the URL is parsed in this manner and the tree data structure is traversed as each portion is processed until the entire URL is parsed at which time the resulting rules/resources may be identified from the leaf nodes of the tree data structure.
    • 使用URL逐个散列的机制,按URL的字符和子句遍历一个树数据结构,以便将URL与资源/规则的匹配提供。 单个字符的哈希码附加到URL部分中前一个字符的先前哈希码。 在基于定界符字符的存在确定的URL的整个部分被散列的时间,与所得到的散列码相关联的树数据结构中的特定节点可以被识别在当前节点的哈希表中 树数据结构。 树数据结构中的每个节点包括一部分URL的多维哈希表。 以确保没有哈希冲突的方式建立和生长多维哈希表。 以这种方式解析URL的每个部分,并且随着每个部分被处理直到整个URL被解析,遍历树数据结构,从而可以从树数据结构的叶节点识别生成的规则/资源。