会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 54. 发明申请
    • System and method for implementing flash forward queries
    • 用于实现闪回查询的系统和方法
    • US20070250474A1
    • 2007-10-25
    • US11409806
    • 2006-04-24
    • Eric BarsnessJohn Santosuosso
    • Eric BarsnessJohn Santosuosso
    • G06F17/30
    • G06F16/2458
    • A system, method, and computer-usable medium for implementing flash forward queries. According to a preferred embodiment of the present invention, a database predictive manager receives a specification of at least one database structure as a candidate for a flash forward query, which predicts a condition of the at least one database structure at a predetermined future time. Database predictive manager tracks changes made to the at least one database structure utilizing a history database. In response to receiving a flash forward query, database predictive manager presents results of the flash forward query, wherein the results are calculated based on extrapolating data obtained from the change tracking of the at least one database structure.
    • 用于实现闪回查询的系统,方法和计算机可用介质。 根据本发明的优选实施例,数据库预测管理器接收至少一个数据库结构的规范作为闪存前向查询的候选,其在预定的未来时间预测至少一个数据库结构的状况。 数据库预测管理器跟踪使用历史数据库对至少一个数据库结构所做的更改。 响应于接收到快进查询,数据库预测管理器呈现闪存正向查询的结果,其中基于从至少一个数据库结构的变化追踪获得的外推数据来计算结果。
    • 55. 发明申请
    • REMOVING NODES FROM A QUERY TREE BASED ON A RESULT SET
    • 根据结果​​集从查询树中删除编号
    • US20070239673A1
    • 2007-10-11
    • US11278714
    • 2006-04-05
    • Eric BarsnessRobert BestgenJohn Santosuosso
    • Eric BarsnessRobert BestgenJohn Santosuosso
    • G06F17/30
    • G06F16/24542
    • In an embodiment, a query tree is created that represents a query expression, where the query tree includes a union of nodes. Each of the nodes represents a respective partition of a table, and the query expression specifies a key value and the table. A determination is made whether a result set exists that includes the key value, where the result set was previously retrieved from the table. If the determination is true, a decision is made based on the result set whether the key value is stored in the respective partition represented by each of the nodes. The nodes for which the key value is not stored in the respective partition are removed from the query tree to create an optimization tree, and the optimization tree is used to retrieve data from the table. In this way, nodes that are not necessary to be searched may be removed from query trees, in order to increase the performance of the query.
    • 在一个实施例中,创建表示查询表达式的查询树,其中查询树包括节点的并集。 每个节点表示表的相应分区,查询表达式指定键值和表。 确定是否存在包含键值的结果集,其中先前从表中检索结果集。 如果确定为真,则基于结果集确定密钥值是否存储在由每个节点表示的相应分区中。 键值不存储在相应分区中的节点从查询树中删除以创建优化树,并且优化树用于从表中检索数据。 以这种方式,可以从查询树中删除不需要搜索的节点,以便增加查询的性能。
    • 59. 发明申请
    • Validating a uniform resource locator ('URL') in a document
    • 验证文档中的统一资源定位符(“URL”)
    • US20070150477A1
    • 2007-06-28
    • US11316248
    • 2005-12-22
    • Eric BarsnessJohn Santosuosso
    • Eric BarsnessJohn Santosuosso
    • G06F17/30
    • G06F17/2725G06F16/9566
    • Validating a URL in a document, including identifying the URL in the document, where the URL identifies a computer resource containing text, the document contains other text in addition to the URL, and the document is under edit by a user in an editing program on a computing device. Embodiments also include analyzing the validity of the URL, including analyzing the proximity of the other text to the URL in the document and comparing the other text in the document to the text in the resource identified by the URL in dependence upon the proximity of the other text to the URL in the document. Embodiments also include advising the user of the validity of the URL.
    • 验证文档中的URL,包括标识文档中的URL,其中URL标识包含文本的计算机资源,该文档除了URL之外还包含其他文本,并且该文档正在由编辑程序中的用户编辑 计算设备。 实施例还包括分析URL的有效性,包括分析其他文本与文档中的URL的接近度,并将文档中的其他文本与URL识别的资源中的文本进行比较,这取决于其他的邻近 文本到文档中的URL。 实施例还包括向用户通知URL的有效性。