利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

49 条记录 (耗时 0.036 秒)

    QUERYING ENCRYPTED DATA IN A RELATIONAL DATABASE SYSTEM
    3.
    发明申请
    QUERYING ENCRYPTED DATA IN A RELATIONAL DATABASE SYSTEM 有权
    查询相关数据库系统中的加密数据

    公开(公告)号：US20090077378A1

    公开(公告)日：2009-03-19

    申请号：US12272460

    申请日：2008-11-17

    申请人： Vahit Hakan Hacigumus ,  Balakrishna Raghavendra Iyer ,  Sharad Mehrotra

    发明人： Vahit Hakan Hacigumus ,  Balakrishna Raghavendra Iyer ,  Sharad Mehrotra

    IPC分类号： H04L9/00 ,  G06F17/30

    CPC分类号： G06F17/30471 ,  G06F17/30501 ,  H04L9/0894

    摘要： A client-server relational database system, wherein data from the client computer is encrypted by the client computer and hosted by the server computer, the encrypted data is operated upon by the server computer, using one or more operators selected from a group of operators comprising: (a) inequality logic operators, (b) aggregation operators, and (c) wildcard matching operators, to produce an intermediate results set, the intermediate results set is sent from the server computer to the client computer, and the intermediate results set is decrypted and filtered by the client computer to produce actual results. The group of operators is limited because the encrypted results set, when decrypted, includes inaccuracies therein. The client computer applies a set of correction procedures to the decrypted results set to remove the inaccuracies therein.

    摘要翻译： 一种客户机 - 服务器关系数据库系统，其中来自客户端计算机的数据由客户端计算机加密并由服务器计算机托管，加密数据由服务器计算机使用从一组运营商中选择的一个或多个运营商来操作，该运营商包括 ：（a）不等式逻辑运算符，（b）聚合运算符和（c）通配符匹配运算符，产生中间结果集，中间结果集从服务器计算机发送到客户端计算机，中间结果集为 由客户端计算机进行解密和过滤，以产生实际结果。 操作员组是有限的，因为在解密时加密的结果集包含不准确的内容。 客户端计算机对解密的结果集应用一组校正过程以消除其中的不准确之处。

    Method and system for utilizing a database as a service
    5.
    发明授权
    Method and system for utilizing a database as a service 有权
    利用数据库作为服务的方法和系统

    公开(公告)号：US07171420B2

    公开(公告)日：2007-01-30

    申请号：US09966624

    申请日：2001-09-27

    申请人： Balakrishna Raghavendra Iyer ,  Charles William Lickel ,  Dante Aligheri Aubert ,  Vahit Hakan Hacigumus

    发明人： Balakrishna Raghavendra Iyer ,  Charles William Lickel ,  Dante Aligheri Aubert ,  Vahit Hakan Hacigumus

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30893 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99939 ,  Y10S707/99943

    摘要： A method and system for providing a database as a is disclosed. In a first aspect, the method comprises the steps of accessing the database over a public network by a browser without downloading software. The method further includes controlling access to the database on an agreed-upon schedule. In a second aspect, a database service for use on a public network is disclosed. The database service comprises a presentation layer, the presentation layer including a browser, a web server coupled to the public network and a web application platform coupled to the web server. The database includes an application layer comprising a user interface (UI) application. The UI application is executed on the web application platform and is capable of communicating with the browser through a standard program code. Finally, the database service includes a database management layer. The database management layer includes at least one database which communicates with the UI application. Accordingly, a database can be managed centrally while resources of the database can be consumed individually and globally.

    摘要翻译： 公开了一种用于提供数据库的方法和系统。 在第一方面，该方法包括以下步骤：通过浏览器在公共网络上访问数据库，而不下载软件。 该方法还包括根据商定的时间表来控制对数据库的访问。 在第二方面，公开了一种在公共网络上使用的数据库服务。 数据库服务包括表示层，表示层包括浏览器，耦合到公共网络的web服务器和耦合到web服务器的Web应用程序平台。 数据库包括包括用户界面（UI）应用的应用层。 UI应用程序在Web应用程序平台上执行，并且能够通过标准程序代码与浏览器进行通信。 最后，数据库服务包括数据库管理层。 数据库管理层包括与UI应用通信的至少一个数据库。 因此，可以集中管理数据库，而可以单独和全局地使用数据库的资源。

    Scalable set oriented classifier
    6.
    发明授权
    Scalable set oriented classifier 失效
    可扩展集定向分类器

    公开(公告)号：US5899992A

    公开(公告)日：1999-05-04

    申请号：US800357

    申请日：1997-02-14

    申请人： Balakrishna Raghavendra Iyer ,  Min Wang

    发明人： Balakrishna Raghavendra Iyer ,  Min Wang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30705 ,  G06F17/30625 ,  Y10S707/99931 ,  Y10S707/99935 ,  Y10S707/99937

    摘要： A method, apparatus, and article of manufacture for a computer implemented scaleable set-oriented classifier. The scalable set-oriented classifier stores set-oriented data as a table in a relational database. The table is comprised of rows having attributes. The scalable set-oriented classifier classifies the rows by building a classification tree. The scalable set-oriented classifier determines a gini index value for each split value of each attribute for each node that can be partitioned in the classification tree. The scalable set-oriented classifier selects an attribute and a split value for each node that can be partitioned based on the determined gini index value corresponding to the split value. Then, the scalable set-oriented classifier grows the classification tree by another level based on the selected attribute and split value for each node. The scalable set-oriented classifier repeats this process until each row of the table has been classified in the classification tree.

    摘要翻译： 一种用于计算机实现的可缩放的面向分类器的方法，装置和制品。 可扩展的面向集的分类器将面向对象的数据作为关系数据库中的表存储。 该表由具有属性的行组成。 可扩展的面向集的分类器通过构建分类树来对行进行分类。 可扩展的面向集的分类器为可以在分类树中分区的每个节点的每个属性的每个分割值确定一个gini索引值。 可扩展的面向集的分类器根据与分割值相对应的确定的基尼系数索引值，为可分区的每个节点选择属性和分割值。 然后，可扩展的面向对象的分类器根据所选择的属性和每个节点的分割值将分类树增加另一个级别。 可扩展的面向集的分类器重复此过程，直到表的每一行都分类到分类树中。

    Enumerating projections in SQL queries containing outer and full outer joins in the presence of inner joins
    7.
    发明授权
    Enumerating projections in SQL queries containing outer and full outer joins in the presence of inner joins 失效

    公开(公告)号：US5855019A

    公开(公告)日：1998-12-29

    申请号：US904172

    申请日：1997-07-31

    申请人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Raghavendra Iyer

    发明人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Raghavendra Iyer

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463 ,  Y10S707/99932 ,  Y10S707/99939

    摘要： The present invention discloses a method and apparatus for the enumeration of projections (i.e., "SELECT DISTINCT" operations) in SQL queries containing outer and full outer joins in the presence of inner joins without encountering any regression in performance. The present invention removes projections from a given user query by moving the projections to the top of an expression tree representation of the query, wherein the projection removal is performed using algebraic identities rather than rule-based transformations. The present invention also discloses several methods of enumerating different plans or schedules for projection operations and binary operations in the given user query. The present invention can significantly reduce the execution time of a query by selecting the optimal schedule for binary operations and projections between the binary operations. However, the present invention ensures that there is no regression in performance by comparing the cost of the query with the cost of enumerated plans or schedules, thereby ensuring that the optimizations or transformations do not introduce performance penalties.

    Method for creating an in-memory physical dictionary for data compression
    10.
    发明授权
    Method for creating an in-memory physical dictionary for data compression 有权
    用于创建用于数据压缩的内存中物理字典的方法

    公开(公告)号：US07460033B2

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

    申请号：US11617610

    申请日：2006-12-28

    申请人： Balakrishna Raghavendra Iyer ,  Piotr M. Plachta ,  Wolfram Sauer ,  Steven W. White

    发明人： Balakrishna Raghavendra Iyer ,  Piotr M. Plachta ,  Wolfram Sauer ,  Steven W. White

    IPC分类号： H03M7/34

    CPC分类号： H03M7/3088

    摘要： Some aspects of the invention provide methods for creating an in-memory physical dictionary for data compression. To that end, in accordance with aspects of the present invention, a new heuristic is defined for converting each of the plurality of logical nodes into a corresponding physical node forming a plurality of physical nodes; then place each of the physical nodes into the physical dictionary while traversing the dictionary tree in descending visit count order. Each physical node is placed in its nearest ascendant's cache-line with sufficient space. If there is no space in any of the ascendant's cache-line, then the physical node is placed into a new cache-line, unless a pre-defined packing threshold has been reached, in which case the physical node is placed in the first available cache-line.

    摘要翻译： 本发明的一些方面提供了用于创建用于数据压缩的内存中物理字典的方法。 为此，根据本发明的方面，新的启发式被定义为将多个逻辑节点中的每一个转换成形成多个物理节点的对应的物理节点; 然后将每个物理节点放入物理字典，同时以递减的访问次序顺序遍历字典树。 每个物理节点都放置在其最接近的上升缓存行，并具有足够的空间。 如果任何上升缓存行中没有空格，则物理节点将被放置到新的高速缓存行中，除非已达到预定义的打包阈值，在这种情况下，物理节点被置于第一个可用的 缓存线。