会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Handling null values in SQL queries over object-oriented data
    • 在面向对象数据的SQL查询中处理空值
    • US5905982A
    • 1999-05-18
    • US835113
    • 1997-04-04
    • Michael James CareyGerald George Kiernan
    • Michael James CareyGerald George Kiernan
    • G06F17/30
    • G06F17/30607Y10S707/955Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/99953
    • A method, apparatus, and article of manufacture for handling NULL values in SQL queries over object oriented data. A two-phase method is used to enable a query evaluator in a two-valued logic environment to properly handle occurrences of NULL values for predicates that involve subqueries, i.e., basic subquery predicates and/or quantified subquery predicates. For basic subquery predicates, negation reduction is performed by applying logical equivalence rules and inverting basic comparators (e.g., transforming =) to eliminate NOTs. Then, transformations are employed for the resulting positive predicates to include NULL value testing, i.e., NULL protection. For quantified subquery predicates, in addition to performing negation reduction, quantified subqueries are converted into existential subqueries. In most cases, this yields a predicate that can be handled using NULL protection transformations for positive predicates. The exception (i.e., a "NOT EXISTS" resulting from the conversion step of a universally quantified subquery) is handled using NULL protection transformations for negative predicates. The evaluation of the NULL tested positive and negative predicates ensures that if a predicate has a NULL value, it is not included in the query result.
    • 一种用于在面向对象数据的SQL查询中处理NULL值的方法,装置和制品。 两阶段方法用于使两值逻辑环境中的查询计算器正确地处理涉及子查询(即基本子查询谓词和/或量化子查询谓词)的谓词的NULL值的出现。 对于基本子查询谓词,通​​过应用逻辑等价规则和反转基本比较器(例如,转换 =)来消除NOT来执行否定减少。 然后,对所得到的积极谓词使用变换来包括NULL值测试,即NULL保护。 对于量化的子查询谓词,除了执行减法之外,量化的子查询也将转换为存在性子查询。 在大多数情况下,这产生了一个谓词,可以使用NULL保护转换来处理积极谓词。 使用针对负谓词的NULL保护转换来处理异常(即,由普遍量化的子查询的转换步骤产生的“NOT EXISTS”)。 NULL测试的正和负谓词的评估确保如果谓词具有NULL值,则不包括在查询结果中。
    • 6. 发明授权
    • System and method for order-preserving encryption for numeric data
    • 用于数字数据的订单保存加密的系统和方法
    • US07426752B2
    • 2008-09-16
    • US10752154
    • 2004-01-05
    • Rakesh AgrawalGerald George KiernanRamakrishnan SrikantYirong Xu
    • Rakesh AgrawalGerald George KiernanRamakrishnan SrikantYirong Xu
    • G06F17/30
    • G06F21/60G06F21/6227G06F21/6245
    • A system, method, and computer program product to automatically eliminate the distribution information available for reconstruction from a disguised dataset. The invention flattens input numerical values into a substantially uniformly distributed dataset, then maps the uniformly distributed dataset into equivalent data in a target distribution. The invention allows the incremental encryption of new values in an encrypted database while leaving existing encrypted values unchanged. The flattening comprises (1) partitioning, (2) mapping, and (3) saving auxiliary information about the data processing, which is encrypted and not updated. The partitioning is MDL based, and includes a growth phase for dividing a space into fine partitions and a prune phase for merging some partitions together.
    • 一种系统,方法和计算机程序产品,用于自动从伪装的数据集中消除可用于重建的分发信息。 本发明将输入数值平坦化为基本上均匀分布的数据集,然后将均匀分布的数据集映射到目标分布中的等效数据。 本发明允许对加密数据库中的新值进行增量加密,同时保留现有加密值。 扁平化包括(1)划分,(2)映射和(3)保存关于被加密且未更新的数据处理的辅助信息。 分区是基于MDL,并且包括用于将空间分割成精细分区的生长阶段和用于将一些分区合并在一起的剪枝阶段。
    • 7. 发明授权
    • System and method for fast querying of encrypted databases
    • 用于快速查询加密数据库的系统和方法
    • US07395437B2
    • 2008-07-01
    • US10752121
    • 2004-01-05
    • Rakesh AgrawalGerald George Kiernan
    • Rakesh AgrawalGerald George Kiernan
    • G06F11/30
    • G06F21/6227H04L9/0662Y10S707/99933
    • A system, method, computer program product, and data management service that allows any comparison operation to be applied on encrypted data, without first decrypting the operands. The encryption scheme of the invention allows equality and range queries as well as the aggregation operations of MAX, MIN, and COUNT. The GROUPBY and ORDERBY operations can also be directly applied. Query results produced using the invention are sound and complete, the invention is robust against cryptanalysis, and its security strictly relies on the choice of a private key. Order-preserving encryption allows standard database indexes to be built over encrypted tables. The invention can easily be integrated with existing systems.
    • 一种系统,方法,计算机程序产品和数据管理服务,允许任何比较操作应用于加密数据,而无需首先解密操作数。 本发明的加密方案允许相等和范围查询以及MAX,MIN和COUNT的聚合操作。 GROUPBY和ORDERBY操作也可以直接应用。 使用本发明产生的查询结果是完整的,本发明对于密码分析是有效的,其安全性严格依赖于私钥的选择。 订单保留加密允许在加密表上构建标准数据库索引。 本发明可以容易地与现有系统集成。
    • 9. 发明授权
    • Tagging XML query results over relational DBMSs
    • 在关系数据库管理系统上标记XML查询结果
    • US06934712B2
    • 2005-08-23
    • US09810167
    • 2001-03-19
    • Gerald George KiernanJayavel ShanmugasundaramEugene Jon Shekita
    • Gerald George KiernanJayavel ShanmugasundaramEugene Jon Shekita
    • G06F17/30
    • G06F17/30917G06F17/30595G06F17/30932G06F17/30941Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/99943
    • A method for publishing relational data as XML by translating XML queries into queries against a relational database. Conversion of the relational database into an XML database is not required. Each relational table is mapped to a virtual XML document, and XML queries are issued over these virtual documents. An XML query is parsed and transformed into a language-neutral intermediate representation, which is a sequence of operations describing how the output document is derived from the underlying relational tables. The intermediate representation is then translated into an SQL query over the underlying relational tables. The intermediate representation is also used to generate a tagger graph, which the tagger runtime ‘walks’ to generate the tagged, structured XML output. Each of the nodes of the tagger graph are operators which perform processing on the results of the SQL query. The SQL query is executed, and the SQL query results are then provided to the tagger. The tagger runtime applies the operators of each node to the inputs at that node to produce the structured XML document as a query result, guided by the structure of the tagger graph.
    • 通过将XML查询转换为关系数据库的查询来将关系数据发布为XML的方法。 不需要将关系数据库转换为XML数据库。 每个关系表映射到一个虚拟XML文档,并通过这些虚拟文档发出XML查询。 解析XML查询并将其转换为语言中立的中间表示,它是描述输出文档如何从底层关系表导出的操作序列。 然后将中间表示形式转换为基础关系表中的SQL查询。 中间表示也用于生成标记图,标记运行时“走”来生成标记的结构化XML输出。 标记图中的每个节点都是对SQL查询结果执行处理的操作符。 执行SQL查询,然后将SQL查询结果提供给标记器。 标记运行时将每个节点的运算符应用于该节点的输入,以便通过标记器图的结构来指导结构化的XML文档作为查询结果。
    • 10. 发明授权
    • Left outer join elimination on key
    • 关键的左外连接消除
    • US06721730B2
    • 2004-04-13
    • US09887582
    • 2001-06-21
    • Gerald George KiernanJayavel Shanmugasundaram
    • Gerald George KiernanJayavel Shanmugasundaram
    • G06F1730
    • G06F17/30454Y10S707/99933Y10S707/99934
    • A query optimization technique that determines whether any column from a right quantifier of a left outer join query is projected out of the query. If not, then all predicates in an ON clause are removed from the left outer join query, the right quantifier is removed from the left outer join query, and the left outer join query is converted to a simple select query. A number of steps are performed to determine whether any of the columns quantified by the right quantifier participate in a projection list of the query. A set of equivalence class columns is computed for the query, wherein the equivalence classes are derived from equi-join predicates in the query. A set of columns quantified by the right quantifier across the computed set of equivalence classes is computed. A determination is made whether a subset of the set of columns form a key for the right quantifier. If the right quantifier columns are not projected out of the query, then the optimization may be performed.
    • 一种查询优化技术,用于确定来自左侧外部连接查询的右侧定量器的任何列是否从该查询中投射出来。 如果没有,那么ON子句中的所有谓词将从左外连接查询中删除,右侧的量词会从左外连接查询中删除,左外连接查询将转换为简单的选择查询。 执行多个步骤以确定由右侧量词库量化的任何列是否参与查询的投影列表。 为查询计算一组等价类列,其中等价类是从查询中的等连接谓词导出的。 计算通过所计算的等价类集合的正确量词量化的一组列。 确定一组列的一个子集是否形成正确的量词的键。 如果正确的量词列不会从查询中投射出来,则可以执行优化。