会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Match graphs for query evaluation
    • 匹配图表进行查询评估
    • US20070174241A1
    • 2007-07-26
    • US11336022
    • 2006-01-20
    • Kevin BeyerVanja JosifovskiEdison Ting
    • Kevin BeyerVanja JosifovskiEdison Ting
    • G06F17/30
    • G06F17/2247G06F16/8365G06F17/2241
    • Provided are techniques for processing a query. The query is received, and the query is formed by one or more paths, where each path includes one or more steps. A hierarchical document is received that includes one or more document nodes. While processing the query and traversing the hierarchical document to find document nodes described by at least one of the one or more steps of the query, a match graph is constructed that includes one or more match nodes. Each of the match nodes identifies a step instance and is associated with step instances that are ancestors and descendants of the identified step instance. Also, each of the match nodes is associated with a level. In addition, the match graph includes zero or more edges between the match nodes indicating relationships between the match nodes. The match nodes in the match graph are traversed from lower levels to higher levels to construct results for the query.
    • 提供了用于处理查询的技术。 接收到查询,并且查询由一个或多个路径形成,其中每个路径包括一个或多个步骤。 收到包含一个或多个文档节点的分层文档。 在处理查询并遍历分层文档以查找由查询的一个或多个步骤中的至少一个描述的文档节点时,构建包括一个或多个匹配节点的匹配图。 每个匹配节点标识步骤实例,并且与作为所识别的步骤实例的祖先和后代的步骤实例相关联。 此外,每个匹配节点与一个级别相关联。 此外,匹配图包括指示匹配节点之间的关系的匹配节点之间的零个或多个边缘。 匹配图中的匹配节点从较低级别遍历到更高级别,以构造查询的结果。
    • 2. 发明申请
    • Virtual cursors for XML joins
    • XML连接的虚拟游标
    • US20070112813A1
    • 2007-05-17
    • US11270784
    • 2005-11-08
    • Kevin BeyerMarcus FontouraSridhar RajagopalanEugene ShekitaBeverly Yang
    • Kevin BeyerMarcus FontouraSridhar RajagopalanEugene ShekitaBeverly Yang
    • G06F7/00
    • G06F17/30935
    • A system, method, and computer program product to improve XML query processing efficiency with virtual cursors. Structural joins are a fundamental operation in XML query processing, and substantial work exists on index-based algorithms for executing them. Two well-known index features—path indices and ancestor information—are combined in a novel way to replace at least some of the physical index cursors in a structural join with virtual cursors. The position of a virtual cursor is derived from the path and ancestor information of a physical cursor. Virtual cursors can be easily incorporated into existing structural join algorithms. By eliminating index I/O and the processing cost of handling physical inverted lists, virtual cursors can improve the performance of holistic path queries by an order of magnitude or more.
    • 一种使用虚拟游标来提高XML查询处理效率的系统,方法和计算机程序产品。 结构连接是XML查询处理中的基本操作,并且基于索引的算法存在大量工作来执行它们。 两个众所周知的索引特征 - 路径索引和祖先信息 - 以一种新颖的方式组合,以用至少一些物理索引光标替换虚拟光标的结构连接。 虚拟光标的位置是从物理光标的路径和祖先信息导出的。 虚拟光标可以很容易地并入到现有的结构连接算法中。 通过消除索引I / O和处理物理反转列表的处理成本,虚拟游标可以将整体路径查询的性能提高一个数量级或更多。
    • 3. 发明申请
    • Beltless high velocity air blower
    • 无级高速风机
    • US20050158172A1
    • 2005-07-21
    • US11038965
    • 2005-01-19
    • Daniel SnyderKevin Beyer
    • Daniel SnyderKevin Beyer
    • F01D15/10F04D25/06F04D29/28F01D1/02
    • F01D15/10F04D25/06F04D29/284
    • A direct drive, single stage, centrifugal compressor air blower assembly for increasing air pressure and air flow for industrial process air applications. The blower assembly consists of a scroll-shaped, single stage, centrifugal compressor air blower housing having an air inlet and an air outlet. The centrifugal air compressor housing contains an impeller that is mounted on an end of a drive shaft of a high speed asynchronous AC induction motor shaft. The drive shaft extends from the asynchronous AC induction motor into the centrifugal compressor blower housing. The compressor blower housing is rotatably attached to the motor housing which enables the direction of the air flow to be changed without repositioning the motor. A Variable Frequency Drive (VFD) is used to control motor RPM and hence blower output. The VFD and asynchronous AC induction motor combination provides 5 to 50 horsepower over an operating RPM range of 10,000 to 30,000 RPM.
    • 直接驱动,单级,离心式压缩机风机组件,用于提高工业过程空气应用中的气压和气流。 鼓风机组件由具有空气入口和空气出口的涡旋状单级离心式压缩机空气鼓风机壳体组成。 离心式空气压缩机壳体包括安装在高速异步交流感应电动机轴的驱动轴的端部上的叶轮。 驱动轴从异步交流感应电动机延伸到离心式压缩机风机壳体中。 压缩机鼓风机壳体可旋转地附接到马达壳体,其能够改变空气流动的方向而不重新定位马达。 变频器(VFD)用于控制电机转速,从而控制风机输出。 VFD和异步交流感应电动机组合在10,000至30,000 RPM的运行RPM范围内提供5至50马力。
    • 5. 发明申请
    • SYSTEM AND METHOD FOR CREATING DYNAMIC FOLDER HIERARCHIES
    • 用于创建动态文件夹分类的系统和方法
    • US20060015482A1
    • 2006-01-19
    • US10710288
    • 2004-06-30
    • Kevin BeyerHui-I HsiaoJoshua HuiNing Li
    • Kevin BeyerHui-I HsiaoJoshua HuiNing Li
    • G06F17/30G06F15/00G06F12/00
    • G06F17/30067
    • A dynamic foldering system automatically manages the creation and deletion of run-time dynamic folders and selection of documents, items, or object graphs found in the run-time dynamic folders. The system comprises a query/predicate for a design-time folder group based on which dynamic folders are automatically managed, a variable binding mechanism, automatic identifications of dynamic folders containing a particular object, parallel navigation, and customized combination of foldering results. The query/predicate for a design-time folder group can be a parameterized query. The dynamic folder hierarchy is defined by a hierarchy of design-time folder groups defined by a query/predicate on a document comprising structured or semi-structured data. Modifiable criteria for creating the dynamic folder hierarchy are provided by the user. Variable binding provides powerful query/predicate definitions on hierarchical data or graph-structured data. Given a document, the system automatically identifies which dynamic folders contain the document. Parallel navigation allows a user to navigate along additional paths in a hierarchy and combine the navigation results using set operations.
    • 动态文件夹系统自动管理运行时动态文件夹的创建和删除以及运行时动态文件夹中找到的文档,项目或对象图形的选择。 该系统包括基于哪个动态文件夹被自动管理的设计时文件夹组的查询/谓词,可变绑定机制,包含特定对象的动态文件夹的自动标识,并行导航和文件夹结果的定制组合。 设计时文件夹组的查询/谓词可以是参数化查询。 动态文件夹层次结构由包含结构化或半结构化数据的文档上的查询/谓词定义的设计时文件夹组的层次结构定义。 创建动态文件夹层次结构的可修改标准由用户提供。 变量绑定为层次数据或图形结构数据提供了强大的查询/谓词定义。 给定一个文档,系统会自动识别哪些动态文件夹包含文档。 并行导航允许用户沿层次结构中的其他路径导航,并使用设置操作组合导航结果。
    • 6. 发明申请
    • Asynchronous peer-to-peer data replication
    • 异步对等数据复制
    • US20050193024A1
    • 2005-09-01
    • US10788556
    • 2004-02-27
    • Kevin BeyerElizabeth HamelBruce LindsayClarence Pruet
    • Kevin BeyerElizabeth HamelBruce LindsayClarence Pruet
    • G06F7/00G06F17/30
    • G06F17/30566G06F17/30286G06F17/30578
    • A method and system for providing convergence of data copies in asynchronous data replication in a database system, includes: labeling rows of a plurality of table copies with a monotonic number, a copy identification, and propagation controls; asynchronously capturing at least one labeled change to any row of any of the plurality of table copies from a database recovery log; determining that the captured change is to be communicated to others of the plurality of table copies; communicating the captured change to the others of the plurality of table copies; and applying the communicated change to the others of the plurality of table copies, where the plurality of table copies converge to a same state. In applying the communicated changes, conflicting changes are identified and resolved. In this manner, convergence of data copies in asynchronous data replication is provided, and processing and storage costs are significantly reduced.
    • 一种用于在数据库系统中异步数据复制中提供数据副本的收敛的方法和系统,包括:用单调数,复制标识和传播控制标记多个表副本的行; 从数据库恢复日志中异步地将至少一个标记的更改捕获到多个表副本中的任一个的任何行的任何行; 确定所捕获的改变将被传送到所述多个表副本中的其他人; 将所捕获的改变传达给所述多个表格副本中的其他更改; 以及将所传送的改变应用于所述多个表副本中的其他表,其中所述多个表副本收敛到相同的状态。 在应用传达的更改时,会发现和解决冲突的变化。 以这种方式,提供异步数据复制中的数据副本的收敛,并且显着地减少处理和存储成本。
    • 10. 发明申请
    • Extensible Decimal Identification System for Ordered Nodes
    • 有序节点的可扩展十进制识别系统
    • US20060173927A1
    • 2006-08-03
    • US10605448
    • 2003-09-30
    • Kevin BeyerRobert LyleEdison Ting
    • Kevin BeyerRobert LyleEdison Ting
    • G06F17/30
    • G06F17/30961
    • An extensible identification system for nodes in a hierarchy is described wherein each node is assigned a concatenation of decimal based values. The values assigned uniquely identify the node, provides an order for the node, and identifies its parent, child, and sibling relationships with other nodes Furthermore, the IDs assigned can be encoded to be byte comparable. Furthermore, the ID's assigned to nodes need not be modified when changes (adding/deleting a child node or a subtree of nodes) are made in the hierarchy. Additionally, in the event of such a change, the order and relationships between the parent, child, and sibling nodes are retained.
    • 描述了用于分层结构中的节点的可扩展识别系统,其中每个节点被分配为基于十进制的值的级联。 分配的值唯一标识节点,提供节点的顺序,并识别其与其他节点的父,子节点和兄弟关系。此外,分配的ID可以编码为字节可比。 此外,在层次结构中进行更改(添加/删除子节点或节点子树)时,不需要修改分配给节点的ID。 另外,如果发生这种变化,则保留父,子和兄弟节点之间的顺序和关系。