Method and systems for content access and distribution
    41.
    发明授权
    Method and systems for content access and distribution 有权
    内容访问和分发的方法和系统

    公开(公告)号:US07623534B1

    公开(公告)日:2009-11-24

    申请号:US11322828

    申请日:2005-12-30

    IPC分类号: H04L12/56

    摘要: Distribution of content between publishers and consumers is accomplished using an overlay network that may make use of XML language to facilitate content identification. The overlay network includes a plurality of routers that may be in communication with each other and the publishers and consumers on the Internet. Content and queries are identified by content descriptors that are routed from the originator to a nearest router in the overlay network. The nearest router, for each unique content descriptor, generates a hash identification of the content descriptor which is used by remaining routers in the overlay network to provide the appropriate functions with respect to the content descriptor. In particular, this allows all routers in the overlay network except the nearest router to properly route content without processing every content descriptor.

    摘要翻译: 发布商和消费者之间的内容分发是通过覆盖网络实现的,该网络可以利用XML语言来促进内容识别。 覆盖网络包括可以彼此通信的多个路由器以及因特网上的发布者和消费者。 内容和查询由从发起者路由到覆盖网络中最近的路由器的内容描述符来标识。 对于每个唯一的内容描述符,最近的路由器生成内容描述符的散列标识符,该标识由覆盖网络中的剩余路由器使用以提供关于内容描述符的适当的功能。 特别地,这允许除了最近的路由器之外的覆盖网络中的所有路由器正确路由内容而不处理每个内容描述符。

    Generating conditional functional dependencies
    42.
    发明申请
    Generating conditional functional dependencies 失效
    生成条件函数依赖

    公开(公告)号:US20090287721A1

    公开(公告)日:2009-11-19

    申请号:US12380858

    申请日:2009-03-03

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30604

    摘要: Techniques are disclosed for generating conditional functional dependency (CFD) pattern tableaux having the desirable properties of support, confidence and parsimony. These techniques include both a greedy algorithm for generating a tableau and, for large data sets, an “on-demand” algorithm that outperforms the basic greedy algorithm in running time by an order of magnitude. In addition, a range tableau, as a generalization of a pattern tableau, can achieve even more parsimony.

    摘要翻译: 公开了用于产生具有所需性质的支持,置信和简约的条件功能依赖(CFD)模式表的技术。 这些技术既包括用于生成表格的贪心算法,又包括用于大数据集的“按需”算法,其在运行时间上超过基本贪心算法一个数量级。 另外,作为模式表格的泛化,范围表可以实现更加简单。

    Method for using query templates in directory caches
    44.
    发明授权
    Method for using query templates in directory caches 有权
    在目录缓存中使用查询模板的方法

    公开(公告)号:US07523091B2

    公开(公告)日:2009-04-21

    申请号:US11108940

    申请日:2005-04-19

    IPC分类号: G06F17/30

    摘要: The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.

    摘要翻译: 本发明公开了通过将各个用户查询概括化而获得的通用查询(称为查询模板)作为用于处理声明式查询的低开销,高效益目录高速缓存的语义基础。 可以通过维护一组查询的概括来将高速缓存的有效性提高,并且当它们的估计收益足够高时,将这种泛化允许缓存。 在本发明的优选实施例中,将查询模板准许到高速缓存中可以在本发明人被称为“革命性”方式的情况下完成 - 其次是稳定的时期,其中缓存允许和替换可以在进化中逐步地完成 时尚。 与传统的目录查询缓存相比,本发明可以导致相当高的命中率和较低的服务器端执行和通信成本,同时保持客户端计算开销与查询缓存相当。

    Method and apparatus for packet analysis in a network
    46.
    发明授权
    Method and apparatus for packet analysis in a network 有权
    网络中分组分析的方法和装置

    公开(公告)号:US07451214B1

    公开(公告)日:2008-11-11

    申请号:US11589016

    申请日:2006-10-27

    IPC分类号: G06F15/173

    CPC分类号: H04L43/00 H04L43/106

    摘要: A method and system for monitoring traffic in a data communication network and for extracting useful statistics and information is disclosed. In accordance with an embodiment of the invention, a network interface card has a run-time system and one or more processing blocks executing on the network interface. The run-time system module feeds information derived from a network packet to the processing modules which process the information and generate output such as condensed statistics about the packets traveling through the network.

    摘要翻译: 公开了一种用于监视数据通信网络中的业务并提取有用统计信息的方法和系统。 根据本发明的实施例,网络接口卡具有运行时系统和在网络接口上执行的一个或多个处理块。 运行时系统模块将从网络数据包导出的信息提供给处理信息的处理模块,并生成关于通过网络传播的数据包的统计信息的输出。

    Method of performing approximate substring indexing
    48.
    发明授权
    Method of performing approximate substring indexing 有权
    执行近似子串索引的方法

    公开(公告)号:US07444326B1

    公开(公告)日:2008-10-28

    申请号:US11314759

    申请日:2005-12-21

    IPC分类号: G06F17/30

    摘要: Approximate substring indexing is accomplished by decomposing each string in a database into overlapping “positional q-grams”, sequences of a predetermined length q, and containing information regarding the “position” of each q-gram within the string (i.e., 1st q-gram, 4th q-gram, etc.). An index is then formed of the tuples of the positional q-gram data (such as, for example, a B-tree index or a hash index). Each query applied to the database is similarly parsed into a plurality of positional q-grams (of the same length), and a candidate set of matches is found. Position-directed filtering is used to remove the candidates which have the q-grams in the wrong order and/or too far apart to form a “verified” output of matching candidates. If errors are permitted (defined in terms of an edit distance between each candidate and the query), an edit distance calculation can then be performed to produce the final set of matching strings.

    摘要翻译: 通过将数据库中的每个字符串分解为重叠的“位置q-gram”,预定长度q的序列,并且包含关于字符串中每个q-gram的“位置”的信息(即,1 st q-gram,4 nd q-gram等)。 然后由位置q-gram数据(例如,B树索引或散列索引)的元组形成索引。 应用于数据库的每个查询也被类似地解析为多个位置q-gram(相同长度),并且找到候选的匹配集合。 位置定向滤波用于去除具有错误顺序的q-gram和/或相距太远的候选,以形成匹配候选的“验证”输出。 如果允许错误(根据每个候选者和查询之间的编辑距离定义),则可以执行编辑距离计算以产生最终匹配的字符串。

    METHOD AND APPARATUS FOR USING TAG TOPOLOGY
    49.
    发明申请
    METHOD AND APPARATUS FOR USING TAG TOPOLOGY 有权
    使用标签拓扑学的方法和装置

    公开(公告)号:US20080140619A1

    公开(公告)日:2008-06-12

    申请号:US11608142

    申请日:2006-12-07

    IPC分类号: G06F17/30

    摘要: A method and apparatus for using tag topology for enhancing search capabilities, e.g., searching over the web, are disclosed. For example, the present method receives a user query contain a search term from a user. The method then generates a search result containing at least one entity, wherein the at least one entity is found based on a plurality of user provided tags that is associated with the at least one entity.

    摘要翻译: 公开了一种使用标签拓扑来提高搜索能力的方法和装置,例如在网上搜索。 例如,本方法从用户接收包含搜索项的用户查询。 该方法然后生成包含至少一个实体的搜索结果,其中基于与至少一个实体相关联的多个用户提供的标签来找到至少一个实体。

    Adaptive processing of top-k queries in nested-structure arbitrary markup language such as XML
    50.
    发明申请
    Adaptive processing of top-k queries in nested-structure arbitrary markup language such as XML 有权
    在嵌套结构任意标记语言(如XML)中自适应处理top-k查询

    公开(公告)号:US20060112090A1

    公开(公告)日:2006-05-25

    申请号:US11073966

    申请日:2005-03-07

    IPC分类号: G06F17/30

    摘要: A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.

    摘要翻译: 自适应地评估top-k查询的方法涉及(1204)形成具有存储候选答案的相应服务器队列的服务器,处理(1322)候选答案,以及(1232)提供top-k集合作为查询评估。 处理包括(1402)自适应地选择应该发送当前候选答案的获胜服​​务器到其队列; (1404)将当前候选答案发送给获胜服务器的队列; (1334)自适应地从获胜服务器的队列中选择下一候选答案进行处理; (1336)计算当前候选答案和获胜服务器上的下一候选答案之间的连接,以产生新的当前候选答案; 以及(1338)如果新的当前候选答案的分数超过顶部k集合中的顶部k个答案的分数,则更新具有新的当前候选答案的顶部k集合。 还提供了一种计算候选答案的分数的方法。