公开(公告)号：US07441185B2

公开(公告)日：2008-10-21

申请号：US11042555

申请日：2005-01-25

申请人： Michael J. Coulson ,  Erik B. Christensen ,  Aaron A. Stern

发明人： Michael J. Coulson ,  Erik B. Christensen ,  Aaron A. Stern

IPC分类号： G06F17/00

CPC分类号： G06F17/2258 ,  G06F17/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文档的方法。

公开(公告)号：US07548926B2

公开(公告)日：2009-06-16

申请号：US11245323

申请日：2005-10-05

申请人： Aaron A. Stern ,  Geary L. Eppley ,  Umesh Madan

发明人： Aaron A. Stern ,  Geary L. Eppley ,  Umesh Madan

IPC分类号： G06F17/30

CPC分类号： G06F17/30914 ,  G06F17/272 ,  Y10S707/99942 ,  Y10S707/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.

摘要翻译： 示例性实施例提供了被配置为轻轻触摸消息的元素或输入的高性能导航器，而不必为消息内的每个输入构建整个树结构。 另外，由于输入的部分被识别为需要进一步的细节，所以仅将形成表示该特定输入的那些存根节点; 从而避免与加载整个树相关的设置成本。 其他示例实施例还提供其他优化，例如减少用于导航特定消息所需的节点分配的类类型。 例如，定义了一个类，它保存足够的字段来存储许多输入节点所需的所有信息。 此外，这些公共节点结构可以同时生成为进一步允许输入的更有效的导航的阵列。

公开(公告)号：US07899817B2

公开(公告)日：2011-03-01

申请号：US11245322

申请日：2005-10-05

申请人： Aaron A. Stern ,  Pompiliu Diplan ,  Geary L. Eppley ,  Umesh Madan

发明人： Aaron A. Stern ,  Pompiliu Diplan ,  Geary L. Eppley ,  Umesh Madan

IPC分类号： G06F7/00 ,  G06F11/00

CPC分类号： G06F17/30938 ,  G06F21/52

摘要： Embodiments herein prevent or mitigate attacks on inverse query engines by providing safe mode routines that allow for the acceptance of third party messages and/or query expressions, as well as prevent trusted sources from accidental attacks. The mitigations fall into two categories: compile-time and runtime. Compile-time mitigations prevent query expressions from being accepted and compiled that are susceptible to known attacks. For example, the complexity of query expressions may be limited to functions with linear runtimes; constant memory usage; or ones that do not create large strings. Further, language constructs for the criteria in the query expression may not allow for nested predicates complexities. Runtime mitigations, on the other hand, monitor the data size and processing lengths of messages against the various query expressions. If these runtime quotas are exceeded, an exception or other violation indication may be thrown (e.g., abort), deeming the evaluation as under attack.

摘要翻译： 这里的实施例通过提供允许接受第三方消息和/或查询表达式的安全模式例程，以及防止可信源来自意外攻击来防止或减轻对反向查询引擎的攻击。 缓解分为两类：编译时和运行时。 编译时缓解阻止查询表达式受到已知攻击的接受和编译。 例如，查询表达式的复杂性可能限于具有线性运行时的函数; 不断的内存使用; 或者不创建大字符串的那些。 此外，查询表达式中的条件的语言结构可能不允许嵌套谓词的复杂性。 另一方面，运行缓解则根据各种查询表达式监视消息的数据大小和处理长度。 如果超出这些运行时配额，可能会抛出异常或其他违规指示（例如，中止），将评估视为受到攻击。

公开(公告)号：US07603474B2

公开(公告)日：2009-10-13

申请号：US11244669

申请日：2005-10-05

申请人： Aaron A. Stern

发明人： Aaron A. Stern

IPC分类号： G06F15/16 ,  G06F15/173

CPC分类号： H04L67/02 ,  H04L29/12594 ,  H04L61/3065 ,  H04L69/22

摘要： A header-to-bit conversion table is provided that includes a list of address headers for registered endpoints. Assigned to each address header within the list is a bit placement within a string of bits. As messages are received, select headers within a message are compared with the address headers within the list. Each intersection or match for headers sets a bit true within a bit array for the message corresponding to the bit assignment for the header within the header-to-bit conversion table. Such array may then be compared with bit masks for each endpoint, wherein those bits set true within the bit masks represent those headers needed to satisfy the criteria for a particular endpoint. If a match is found, the message (or portion(s) thereof) may be sent to the particular endpoint for processing.

摘要翻译： 提供了一个头对位转换表，其中包括一个注册端点的地址头列表。 分配给列表中的每个地址头是位列中的位置。 当接收到消息时，将消息中的标题与列表中的地址头进行比较。 标头的每个交集或匹配在位阵列内对于与头到位转换表中的头的位分配相对应的消息设置一个真实的。 然后可以将这样的阵列与每个端点的位掩码进行比较，其中在位掩码内设置为真的位表示满足特定端点的标准所需的那些标头。 如果找到匹配，则可将消息（或其部分）发送到特定端点进行处理。

公开(公告)号：US07472130B2

公开(公告)日：2008-12-30

申请号：US11244670

申请日：2005-10-05

申请人： Aaron A. Stern ,  Geary L. Eppley ,  Umesh Madan

发明人： Aaron A. Stern ,  Geary L. Eppley ,  Umesh Madan

IPC分类号： G06F17/30

CPC分类号： G06F17/30979 ,  G06F17/30613 ,  Y10S707/99931 ,  Y10S707/99942 ,  Y10S707/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”的分支节点时，而不是遍历具有每个分支的公共轴的输入节点集，这里所述的选择索引在该节点集中迭代一次， 总。 更具体地，选择索引数据结构包括用于从分支节点分支并且评估共享公共轴的输入节点的指令的空节点集的阵列。 将输入节点集的标识符与选择索引中的索引进行比较，并将输入节点的匹配添加到相应的节点集中以获取适当的指令。 然后可以将评估结果传递给选择指令的分支用于进一步处理。