会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • Select indexing in merged inverse query evaluations
    • 合并反查询评估中选择索引
    • US20070078874A1
    • 2007-04-05
    • US11244670
    • 2005-10-05
    • Aaron SternGeary EppleyUmesh Madan
    • Aaron SternGeary EppleyUmesh Madan
    • G06F7/00
    • G06F17/30979G06F17/30613Y10S707/99931Y10S707/99942Y10S707/99943
    • Embodiments provide for select indexing, which uses an array to simultaneously construct output sets for instructions that operate on input nodesets with common axes. During evaluation of a message against an instruction tree, when a branching node with a large “splay” is iterated over, rather than iterating over an input nodeset with a common axis once per branch, the select indexing described herein iterates over the nodeset once in total. More specifically, the select index data structure includes an array of empty node sets for instructions that both, branch from a branching node, and evaluate input nodes that share a common axis. Identifiers for the input nodeset are compared to indices within the select index, and matches for the input nodes are added to the corresponding nodeset for the appropriate instruction. The results of the evaluation may then be passed to the branches of the select instructions for further processing.
    • 实施例提供了选择索引,其使用阵列来同时构造用于在具有公共轴的输入节点集上操作的指令的输出集合。 在针对指令树的消息评估期间,当遍历具有大“splay”的分支节点时,而不是遍历具有每个分支的公共轴的输入节点集,这里所述的选择索引在该节点集上一次遍历 总。 更具体地,选择索引数据结构包括用于从分支节点分支并且评估共享公共轴的输入节点的指令的空节点集的阵列。 将输入节点集的标识符与选择索引中的索引进行比较,并将输入节点的匹配添加到相应的节点集中以获取适当的指令。 然后可以将评估结果传递给选择指令的分支用于进一步处理。
    • 6. 发明申请
    • Custom function library for inverse query evaluation of messages
    • 自定义功能库用于消息的反查询评估
    • US20070078840A1
    • 2007-04-05
    • US11244947
    • 2005-10-05
    • Aaron SternGeary EppleyUmesh Madan
    • Aaron SternGeary EppleyUmesh Madan
    • G06F17/30
    • G06F16/8373
    • In an inverse query environment, exemplary embodiments describe a set of shortcut keys that can be used to augment common query functions making it easier for developers to write query expressions. Further, these shortcut keys can be used to more efficiently execute equivalent functionality of the common query expressions, without evaluating large query strings against the message. In addition, embodiments described herein allow for automatic versioning of query functions, allowing for more maintainability of query expression sets. For example, a custom query library is provided with information about standard query functions based on industry wisdom of those functions most commonly referenced and/or versioned. Developers can use abbreviated query function shortcut keys in executing equivalent functionality of the lengthier string values for common query functions. The custom query library can also be modified with up-to-date information as industry changes are needed, thereby automatically maintaining the query expressions.
    • 在反向查询环境中,示例性实施例描述了可以用于增加公共查询功能的一组快捷键,使得开发人员更容易编写查询表达式。 此外,这些快捷键可以用于更有效地执行公共查询表达式的等效功能,而不会根据消息评估大型查询字符串。 此外,本文描述的实施例允许查询功能的自动版本化,允许查询表达式集合的更多可维护性。 例如,自定义查询库提供有关基于最常参考和/或版本化的功能的行业智慧的关于标准查询功能的信息。 开发人员可以使用缩写查询功能快捷键来执行常见查询功能的冗长字符串值的等效功能。 自定义查询库也可以随行业更改而被修改为最新信息,从而自动维护查询表达式。
    • 7. 发明申请
    • Common sub-expression elimination for inverse query evaluation
    • 反查询评估的公共子表达式消除
    • US20070078816A1
    • 2007-04-05
    • US11244724
    • 2005-10-05
    • Aaron SternPompiliu DiplanGeary EppleyUmesh Madan
    • Aaron SternPompiliu DiplanGeary EppleyUmesh Madan
    • G06F17/30
    • G06F16/9027
    • Provided herein are optimizations for an instruction tree of an inverse query engine. Secondary sub-expression elimination trees are provided, which are data structures configured to include nodes that allow for temporary variables that hold processing context or state for idempotent fragments of query expression(s). As such, when sub-paths for a query expression are processed against a message, the processing context may be stored within nodes of one or more sub-expression elimination trees. The next time this same fragment is processed, regardless of where it appears within the instruction tree, the data structure is accessed to identify and retrieve the state information such that the idempotent fragment is only calculated or evaluated once.
    • 这里提供了反向查询引擎的指令树的优化。 提供次级子表达式消除树,其是被配置为包括允许存储用于查询表达式的幂等分片段的处理上下文或状态的临时变量的节点的数据结构。 因此,当针对消息处理查询表达式的子路径时,处理上下文可以存储在一个或多个子表达式消除树的节点内。 下一次处理这个相同的片段时,无论它在指令树中出现的位置如何,都会访问数据结构,以便识别和检索状态信息,以便仅计算或评估幂等片段。
    • 8. 发明申请
    • Method and system for binary serialization of documents
    • 二进制序列化文件的方法和系统
    • US20060168513A1
    • 2006-07-27
    • US11042555
    • 2005-01-25
    • Michael CoulsonErik ChristensenAaron Stern
    • Michael CoulsonErik ChristensenAaron Stern
    • G06F17/24
    • G06F17/2258G06F17/2247
    • A method for processing XML documents in a computer-based system includes associating each of a plurality of information items with a corresponding one of a plurality of binary-data units and providing a XML document associated with a XML information set comprising one or more of the plurality of information items. The method includes serializing the XML document into a binary XML format, or de-serializing the XML document from the binary XML format. Serializing includes translating the one or more information items of the XML information set into their corresponding one or more binary-data units. De-serializing includes translating one or more binary-data units of the binary XML format into their corresponding one or more information items. A computer readable medium is encoded with a program for execution on at least one processor. The program, when executed on the at least one processor, can perform the method for processing XML documents.
    • 一种在基于计算机的系统中处理XML文档的方法包括将多个信息项中的每一个与多个二进制数据单元中的对应的一个相关联,并且提供与包括一个或多个二进制数据单元中的一个或多个的XML信息集相关联的XML文档 多个信息项目。 该方法包括将XML文档串行化为二进制XML格式,或从二进制XML格式将XML文档解串行化。 序列化包括将XML信息集的一个或多个信息项转换成其对应的一个或多个二进制数据单元。 去序列化包括将二进制XML格式的一个或多个二进制数据单元翻译成其对应的一个或多个信息项。 计算机可读介质用用于在至少一个处理器上执行的程序进行编码。 该程序在至少一个处理器上执行时,可以执行处理XML文档的方法。
    • 9. 发明申请
    • High performance navigator for parsing inputs of a message
    • 用于解析消息输入的高性能导航器
    • US20070089115A1
    • 2007-04-19
    • US11245323
    • 2005-10-05
    • Aaron SternGeary EppleyUmesh Madan
    • Aaron SternGeary EppleyUmesh Madan
    • G06F9/46
    • G06F17/30914G06F17/272Y10S707/99942Y10S707/99943
    • Example embodiments provide a high performance navigator configured to lightly touch on the elements or input of a message, without necessarily having to build an entire tree structure for each input within the message. In addition, as portions of the inputs are identified as requiring further details, only those stub nodes representing that particular input will be created; thus avoiding the setup cost associated with loading an entire tree. Other example embodiments also provide for other optimizations such as reducing the class types of node allocations needed for navigating a particular message. For instance, a single class is defined that holds enough fields to store all of the information needed for numerous input nodes. Further, these common node structures can simultaneously generate as an array that further allows for more efficient navigation of the inputs.
    • 示例性实施例提供了被配置为轻轻触摸消息的元素或输入的高性能导航器,而不必为消息内的每个输入构建整个树结构。 另外,由于输入的部分被识别为需要进一步的细节,所以仅将形成表示该特定输入的那些存根节点; 从而避免与加载整个树相关的设置成本。 其他示例实施例还提供其他优化,例如减少用于导航特定消息所需的节点分配的类类型。 例如,定义了一个类,它保存足够的字段来存储许多输入节点所需的所有信息。 此外,这些公共节点结构可以同时生成为进一步允许输入的更有效的导航的阵列。