专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20080040381A1 Evaluating Queries Against In-Memory Objects Without Serialization 有权
标题翻译：评估内存对象的查询而不进行序列化
公开(公告)号：US20080040381A1
公开(公告)日：2008-02-14
申请号：US11876515
申请日：2007-10-22
申请人： Umesh Madan , Geary Eppley , David Wortendyke
发明人： Umesh Madan , Geary Eppley , David Wortendyke
IPC分类号： G06F7/00
CPC分类号： G06F17/3066 , Y10S707/955 , Y10S707/99942
摘要： At least one implementation described herein relates to evaluating queries structured according to a first format against one or more objects structured according to a second, different format without serializing the object. Typically, evaluating an XML (eXtensible Markup Language) query against a CLR (Common Language Runtime) object required serializing the CLR object and deriving an XML construct from the serialized data. The query is then be evaluated against the XML construct. In the described implementations, significant system resources are realized by creating an infoset model that maps properties of an object to an object infoset. The query is then evaluated using the infoset to locate object values and, thus, no serialization is required. Dynamically generated IL is used and re-used to efficiently perform subsequent evaluation steps on similar queries.
摘要翻译：本文所描述的至少一个实现涉及针对根据第二不同格式而构造的一个或多个对象，根据第一格式来结构化查询而不串行化该对象。通常，针对CLR（Common Language Runtime）对象评估XML（可扩展标记语言）查询需要序列化CLR对象并从序列化数据中导出XML构造。然后根据XML构造来评估查询。在所描述的实现中，通过创建将对象的属性映射到对象信息集的信息集模型来实现重要的系统资源。然后使用信息集来评估查询以定位对象值，因此不需要序列化。动态生成的IL被使用并重新用于有效执行类似查询的后续评估步骤。

2. 发明申请

US20070078874A1 Select indexing in merged inverse query evaluations 有权
标题翻译：合并反查询评估中选择索引
公开(公告)号：US20070078874A1
公开(公告)日：2007-04-05
申请号：US11244670
申请日：2005-10-05
申请人： Aaron Stern , Geary Eppley , Umesh Madan
发明人： Aaron Stern , Geary Eppley , Umesh Madan
IPC分类号： G06F7/00
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”的分支节点时，而不是遍历具有每个分支的公共轴的输入节点集，这里所述的选择索引在该节点集上一次遍历总。更具体地，选择索引数据结构包括用于从分支节点分支并且评估共享公共轴的输入节点的指令的空节点集的阵列。将输入节点集的标识符与选择索引中的索引进行比较，并将输入节点的匹配添加到相应的节点集中以获取适当的指令。然后可以将评估结果传递给选择指令的分支用于进一步处理。

3. 发明授权

US07062482B1 Techniques for phonetic searching 有权
标题翻译：语音搜索技术
公开(公告)号：US07062482B1
公开(公告)日：2006-06-13
申请号：US09965541
申请日：2001-09-26
申请人： Umesh Madan , Geary Eppley
发明人： Umesh Madan , Geary Eppley
IPC分类号： G06F17/30 , G06F17/20
CPC分类号： G10L13/08 , G06F17/30681 , Y10S707/917 , Y10S707/959 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： In a network providing for electronic commerce, a computer system provides a user with access to a set of electronic commerce pages, category pages and databases for locating products electronically. To locate products electronically, the user performs a search using multiple words. The search terms in the search request are converted to canonical phonetic forms, and a phonetic keyword search based on the canonical phonetic forms is performed. The phonetic keyword search is then used to generate search results.
摘要翻译：在提供电子商务的网络中，计算机系统为用户提供对电子商务页面，类别页面和数据库的访问，以便以电子方式定位产品。要以电子方式查找产品，用户使用多个字进行搜索。搜索请求中的搜索项被转换为规范的语音形式，并且执行基于规范语音形式的语音关键字搜索。然后，语音关键字搜索用于生成搜索结果。

4. 发明申请

US20050187908A1 Evaluating queries against in-memory objects without serialization 失效
标题翻译：评估针对内存中对象的查询而不进行序列化
公开(公告)号：US20050187908A1
公开(公告)日：2005-08-25
申请号：US10783599
申请日：2004-02-20
申请人： Umesh Madan , Geary Eppley , David Wortendyke
发明人： Umesh Madan , Geary Eppley , David Wortendyke
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/3066 , Y10S707/955 , Y10S707/99942
摘要： At least one implementation described herein relates to evaluating queries structured according to a first format against one or more objects structured according to a second, different format without serializing the object. Typically, evaluating an XML (extensible Markup Language) query against a CLR (Common Language Runtime) object required serializing the CLR object and deriving an XML construct from the serialized data. The query is then be evaluated against the XML construct. In the described implementations, significant system resources are realized by creating an infoset model that maps properties of an object to an object infoset. The query is then evaluated using the infoset to locate object values and, thus, no serialization is required. Dynamically generated IL is used and re-used to efficiently perform subsequent evaluation steps on similar queries.
摘要翻译：本文所描述的至少一个实现涉及针对根据第二不同格式而构造的一个或多个对象，根据第一格式来结构化查询而不串行化该对象。通常，针对CLR（公共语言运行时）对象评估XML（可扩展标记语言）查询需要序列化CLR对象并从序列化数据中导出XML构造。然后根据XML构造来评估查询。在所描述的实现中，通过创建将对象的属性映射到对象信息集的信息集模型来实现重要的系统资源。然后使用信息集来评估查询以定位对象值，因此不需要序列化。动态生成的IL被使用并重新用于有效执行类似查询的后续评估步骤。

5. 发明申请

US20050203949A1 Using endpoint references in a pub-sub system 失效
标题翻译：在pub-sub系统中使用端点引用
公开(公告)号：US20050203949A1
公开(公告)日：2005-09-15
申请号：US10801998
申请日：2004-03-15
申请人： Luis Felipe Cabrera , Geary Eppley , Jeffrey Schlimmer , David Wortendyke , Bradford Lovering , Craig Critchley
发明人： Luis Felipe Cabrera , Geary Eppley , Jeffrey Schlimmer , David Wortendyke , Bradford Lovering , Craig Critchley
IPC分类号： G06F7/00
CPC分类号： H04L67/02
摘要： Systems and methods for using endpoint references in a publish-subscribe system are described. In one aspect, an endpoint reference is created by a component of the pub-sub system. The endpoint reference includes an endpoint address and one or more contexts. Each context is directed to a respective component of the pub-sub system. Each context is transparent to the respective component, and selectively opaque to all other pub-sub system components.
摘要翻译：描述在发布订阅系统中使用端点引用的系统和方法。在一个方面，由pub-sub系统的组件创建端点引用。端点引用包括端点地址和一个或多个上下文。每个上下文被引导到公共子系统的相应组件。每个上下文对于相应的组件是透明的，并且对所有其他公共子系统组件选择性地不透明。

6. 发明申请

US20070089115A1 High performance navigator for parsing inputs of a message 有权
标题翻译：用于解析消息输入的高性能导航器
公开(公告)号：US20070089115A1
公开(公告)日：2007-04-19
申请号：US11245323
申请日：2005-10-05
申请人： Aaron Stern , Geary Eppley , Umesh Madan
发明人： Aaron Stern , Geary Eppley , Umesh Madan
IPC分类号： G06F9/46
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.
摘要翻译：示例性实施例提供了被配置为轻轻触摸消息的元素或输入的高性能导航器，而不必为消息内的每个输入构建整个树结构。另外，由于输入的部分被识别为需要进一步的细节，所以仅将形成表示该特定输入的那些存根节点; 从而避免与加载整个树相关的设置成本。其他示例实施例还提供其他优化，例如减少用于导航特定消息所需的节点分配的类类型。例如，定义了一个类，它保存足够的字段来存储许多输入节点所需的所有信息。此外，这些公共节点结构可以同时生成为进一步允许输入的更有效的导航的阵列。

7. 发明申请

US20070078840A1 Custom function library for inverse query evaluation of messages 审中-公开
标题翻译：自定义功能库用于消息的反查询评估
公开(公告)号：US20070078840A1
公开(公告)日：2007-04-05
申请号：US11244947
申请日：2005-10-05
申请人： Aaron Stern , Geary Eppley , Umesh Madan
发明人： Aaron Stern , Geary Eppley , Umesh Madan
IPC分类号： G06F17/30
CPC分类号： 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.
摘要翻译：在反向查询环境中，示例性实施例描述了可以用于增加公共查询功能的一组快捷键，使得开发人员更容易编写查询表达式。此外，这些快捷键可以用于更有效地执行公共查询表达式的等效功能，而不会根据消息评估大型查询字符串。此外，本文描述的实施例允许查询功能的自动版本化，允许查询表达式集合的更多可维护性。例如，自定义查询库提供有关基于最常参考和/或版本化的功能的行业智慧的关于标准查询功能的信息。开发人员可以使用缩写查询功能快捷键来执行常见查询功能的冗长字符串值的等效功能。自定义查询库也可以随行业更改而被修改为最新信息，从而自动维护查询表达式。

8. 发明申请

US20070078816A1 Common sub-expression elimination for inverse query evaluation 审中-公开
标题翻译：反查询评估的公共子表达式消除
公开(公告)号：US20070078816A1
公开(公告)日：2007-04-05
申请号：US11244724
申请日：2005-10-05
申请人： Aaron Stern , Pompiliu Diplan , Geary Eppley , Umesh Madan
发明人： Aaron Stern , Pompiliu Diplan , Geary Eppley , Umesh Madan
IPC分类号： G06F17/30
CPC分类号： 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.
摘要翻译：这里提供了反向查询引擎的指令树的优化。提供次级子表达式消除树，其是被配置为包括允许存储用于查询表达式的幂等分片段的处理上下文或状态的临时变量的节点的数据结构。因此，当针对消息处理查询表达式的子路径时，处理上下文可以存储在一个或多个子表达式消除树的节点内。下一次处理这个相同的片段时，无论它在指令树中出现的位置如何，都会访问数据结构，以便识别和检索状态信息，以便仅计算或评估幂等片段。

9. 发明申请

US20050204051A1 Open content model Web service messaging 有权
标题翻译：打开内容模型Web服务消息传递
公开(公告)号：US20050204051A1
公开(公告)日：2005-09-15
申请号：US10801999
申请日：2004-03-15
申请人： Donald Box , Christopher Kaler , David Langworthy , Steven Lucco , John Shewchuk , Luis Cabrera , Craig Critchley , Geary Eppley , Bradford Lovering , Jeffrey Schlimmer , David Wortendyke , Henrik Nielsen
发明人： Donald Box , Christopher Kaler , David Langworthy , Steven Lucco , John Shewchuk , Luis Cabrera , Craig Critchley , Geary Eppley , Bradford Lovering , Jeffrey Schlimmer , David Wortendyke , Henrik Nielsen
IPC分类号： H04M1/64
CPC分类号： G06F9/546 , H04L51/066 , H04L67/02 , H04M1/22
摘要： Systems and methods for open content model Web service messaging in a networked computing environment are described. In one aspect, a transport neutral message is generated that includes message recipient, endpoint addressing information, and one or more reference properties. The reference properties include selectively opaque message context. The transport neutral message is bound to a transport protocol for communication to the message recipient. At least a portion of the selectively opaque message context is. not directed to the message recipient.
摘要翻译：描述了用于开放内容的系统和方法在网络计算环境中的Web服务消息传递。在一个方面，生成包括消息接收者，端点寻址信息和一个或多个参考属性的传输中性消息。引用属性包括选择性地不透明的消息上下文。传输中性消息被绑定到用于与消息接收者通信的传输协议。选择性地不透明的消息上下文的至少一部分是。没有指向消息收件人。

10. 发明申请

US20050187947A1 Systems and methods for parallel evaluation of multiple queries 有权
标题翻译：用于并行评估多个查询的系统和方法
公开(公告)号：US20050187947A1
公开(公告)日：2005-08-25
申请号：US10783343
申请日：2004-02-20
申请人： David Wortendyke , Umesh Madan , Geary Eppley
发明人： David Wortendyke , Umesh Madan , Geary Eppley
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/3046 , G06F17/30516 , Y10S707/99932
摘要： Implementations described herein relate to using a filter engine opcode tree for evaluating multiple queries. The opcode tree includes opcode nodes and branch nodes. Each opcode node includes one or more computer instructions resulting from compiling a query. Executing the opcode tree a single time evaluates each of multiple queries represented in the opcode tree. When a new opcode node is added to the tree, the context of the opcode tree and the structure of the new opcode are taken into account when modifying a branch node or an opcode node. In certain situation, a branch node is optimized to include an indexed lookup function such as a hash function, to optimize processing of opcode nodes that depend from the branch node. Adding and removing nodes to/from the opcode tree can be handled by a filter engine component or by an opcode object being added to/removed from the tree.
摘要翻译：这里描述的实现涉及使用过滤器引擎操作码树来评估多个查询。操作码树包括操作码节点和分支节点。每个操作码节点包括一个或多个由编译查询而产生的计算机指令。执行操作码树一次可以评估操作码树中表示的多个查询中的每一个。当新的操作码节点被添加到树中时，在修改分支节点或操作码节点时，考虑操作码树的上下文和新操作码的结构。在某些情况下，优化分支节点以包括诸如散列函数的索引查找功能，以优化从分支节点依赖的操作码节点的处理。向/从操作码树添加和删除节点可以由过滤器引擎组件或被添加到/从树中删除的操作码对象来处理。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式