利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

256 条记录 (耗时 0.028 秒)

    SYSTEM AND METHOD FOR TRACKING DATABASE DISCLOSURES
    1.
    发明申请
    SYSTEM AND METHOD FOR TRACKING DATABASE DISCLOSURES 审中-公开
    跟踪数据库披露的系统和方法

    公开(公告)号：US20090006431A1

    公开(公告)日：2009-01-01

    申请号：US11772054

    申请日：2007-06-29

    申请人： Rakesh Agrawal ,  Alexandre V. Evfimievski ,  Gerald Kiernan ,  Raja Velu

    发明人： Rakesh Agrawal ,  Alexandre V. Evfimievski ,  Gerald Kiernan ,  Raja Velu

    IPC分类号： G06F17/30

    CPC分类号： G06F16/217

    摘要： A system and method is provided for identifying the source of an unauthorized database disclosure. The system and method stores a plurality of past database queries and determines the relevance of the results of the past database queries (query results) to a sensitive table containing the unauthorized disclosed data. The system and method also ranks the past database queries based on the determined relevance. A list of the most relevant past database queries can then be generated which are ranked according to the relevance, such that the highest ranked queries on the list are most similar to said disclosed data. Three techniques used in embodiments of the invention include partial tuple matching, statistical linkage and deviation probability gain.

    摘要翻译： 提供了一种用于识别未经授权的数据库公开的来源的系统和方法。 系统和方法存储多个过去的数据库查询，并确定过去的数据库查询（查询结果）的结果与包含未授权的公开数据的敏感表的相关性。 系统和方法还根据确定的相关性对过去的数据库查询进行排序。 然后可以生成最相关的过去数据库查询的列表，其根据相关性进行排名，使得列表中排名最高的查询与所述公开的数据最相似。 在本发明的实施例中使用的三种技术包括部分元组匹配，统计连接和偏差概率增益。

    System and Method for Tracking Database Disclosures
    2.
    发明申请
    System and Method for Tracking Database Disclosures 审中-公开
    跟踪数据库披露的系统和方法

    公开(公告)号：US20090006380A1

    公开(公告)日：2009-01-01

    申请号：US12131079

    申请日：2008-05-31

    申请人： Rakesh Agrawal ,  Alexandre V. Evfimievski ,  Gerald Kiernan ,  Raja Velu

    发明人： Rakesh Agrawal ,  Alexandre V. Evfimievski ,  Gerald Kiernan ,  Raja Velu

    IPC分类号： G06F7/06 ,  G06F17/30

    CPC分类号： G06F16/217

    摘要： A system and method is provided for identifying the source of an unauthorized database disclosure. The system and method stores a plurality of past database queries and determines the relevance of the results of the past database queries (query results) to a sensitive table containing the unauthorized disclosed data. The system and method also ranks the past database queries based on the determined relevance. A list of the most relevant past database queries can then be generated which are ranked according to the relevance, such that the highest ranked queries on the list are most similar to said disclosed data. Three techniques used in embodiments of the invention include partial tuple matching, statistical linkage and deviation probability gain.

    摘要翻译： 提供了一种用于识别未经授权的数据库公开的来源的系统和方法。 系统和方法存储多个过去的数据库查询，并确定过去的数据库查询（查询结果）的结果与包含未授权的公开数据的敏感表的相关性。 系统和方法还根据确定的相关性对过去的数据库查询进行排序。 然后可以生成最相关的过去数据库查询的列表，其根据相关性进行排名，使得列表中排名最高的查询与所述公开的数据最相似。 在本发明的实施例中使用的三种技术包括部分元组匹配，统计连接和偏差概率增益。

    System and method for fast querying of encrypted databases
    3.
    发明申请
    System and method for fast querying of encrypted databases 失效
    用于快速查询加密数据库的系统和方法

    公开(公告)号：US20050147246A1

    公开(公告)日：2005-07-07

    申请号：US10752121

    申请日：2004-01-05

    申请人： Rakesh Agrawal ,  Gerald Kiernan

    发明人： Rakesh Agrawal ,  Gerald Kiernan

    IPC分类号： G06F21/00 ,  H04L9/00

    CPC分类号： G06F21/6227 ,  H04L9/0662 ,  Y10S707/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操作也可以直接应用。 使用本发明产生的查询结果是完整的，本发明对于密码分析是有效的，其安全性严格依赖于私钥的选择。 订单保留加密允许在加密表上构建标准数据库索引。 本发明可以容易地与现有系统集成。

    Determining query intent
    5.
    发明授权
    Determining query intent 有权
    确定查询意图

    公开(公告)号：US08612432B2

    公开(公告)日：2013-12-17

    申请号：US12816389

    申请日：2010-06-16

    申请人： Krishnaram N. G. Kenthapadi ,  Panayiotis Tsaparas ,  Sreenivas Gollapudi ,  Rakesh Agrawal

    发明人： Krishnaram N. G. Kenthapadi ,  Panayiotis Tsaparas ,  Sreenivas Gollapudi ,  Rakesh Agrawal

    IPC分类号： G06F7/00 ,  G06F17/30 ,  G06F15/18

    CPC分类号： G06F17/30979

    摘要： A tree structure has a node associated with each category of a hierarchy of item categories. Child nodes of the tree are associated with sub-categories of the categories associated with parent nodes. Training data including received queries and indicators of a selected item category for each received query is combined with the tree structure by associating each query with the node corresponding to the selected category of the query. When a query is received, a classifier is applied to the nodes to generate a probability that the query is intended to match an item of the category associated with the node. The classifier is applied until the probability is below a threshold. One or more categories associated with the nodes that are closest to the intent of the received query are selected and indicators of items of those categories that match the received query are output.

    摘要翻译： 树结构具有与项目类别的层次结构的每个类别相关联的节点。 树的子节点与与父节点相关联的类别的子类别相关联。 通过将每个查询与对应于所选择的查询类别的节点相关联，将包括接收到的查询和针对每个接收到的查询的所选项目类别的指示符的训练数据与树结构组合。 当接收到查询时，分类器被应用于节点以产生查询旨在匹配与节点相关联的类别的项目的概率。 应用分类器直到概率低于阈值。 选择与接收到的查询的意图最接近的节点相关联的一个或多个类别，并输出与接收到的查询匹配的那些类别的项目的指示符。

    Methods and systems for visually distinguishing user attribute similarities and differences
    6.
    发明授权
    Methods and systems for visually distinguishing user attribute similarities and differences 有权
    用于视觉区分用户属性相似性和差异的方法和系统

    公开(公告)号：US08413060B1

    公开(公告)日：2013-04-02

    申请号：US12000846

    申请日：2007-12-18

    申请人： Rakesh Agrawal

    发明人： Rakesh Agrawal

    IPC分类号： G06F3/00 ,  G06F15/16

    CPC分类号： H04L51/04

    摘要： Methods, computer-readable storage media, and systems are provided to facilitate visually distinguishing common attributes of users an electronic communication network or messaging service. In particular, user profile attributes are compared between a first and second user, and similar attributes are visually highlighted by assigning, for example, a distinct font, font size, color, font effect, and/or other visual effect to the user's screen name to designate which attributes are similar. In addition, or alternatively, when the first user views a user profile of the second user, common user attributes are visually highlighted. In one embodiment, the font, font size, color, and/or font effect assigned to the highlighted attribute indicates a degree of similarity of the attribute. Such implementations may allow users to more easily recognize and interact with others that have similar interests and attributes.

    摘要翻译： 提供方法，计算机可读存储介质和系统以便于在电视通信网络或消息服务的视觉上区分用户的公共属性。 特别地，在第一和第二用户之间比较用户简档属性，并且通过向用户的屏幕名称分配例如不同的字体，字体大小，颜色，字体效果和/或其他视觉效果来视觉突出类似的属性 指定哪些属性相似。 另外或替代地，当第一用户查看第二用户的用户简档时，公共用户属性被视觉上突出显示。 在一个实施例中，分配给突出显示的属性的字体，字体大小，颜色和/或字体效果指示属性的相似程度。 这样的实现可以允许用户更容易地识别和与具有相似兴趣和属性的其他人交互。

    Middleware for query processing across a network of RFID databases
    7.
    发明授权
    Middleware for query processing across a network of RFID databases 失效
    用于RFID数据库网络查询处理的中间件

    公开(公告)号：US08244747B2

    公开(公告)日：2012-08-14

    申请号：US11566931

    申请日：2006-12-05

    申请人： Rakesh Agrawal ,  Alvin K. Cheung ,  Karin Kailing ,  Stefan Schoenauer

    发明人： Rakesh Agrawal ,  Alvin K. Cheung ,  Karin Kailing ,  Stefan Schoenauer

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30448 ,  G06F17/30557

    摘要： An implementation wherein RFID data is shared across independent organizations has been addressed. RFID data is usually spread across different parties, e.g. enterprises in a supply chain and thus, efficient query processing across all parties is required. Traceability is emerging as one of the key applications of RFID technology. A generic data model is introduced for querying RFID data across a network of independently operated data sources. The model can be used to facilitate traceability query processing and give a set of representative traceability queries. A newly designed process-and-forward approach is implemented for executing traceability queries.

    摘要翻译： 解决了RFID数据在独立组织之间共享的实现。 RFID数据通常分布在不同方面，例如 供应链中的企业，因此需要各方有效的查询处理。 可追溯性正在成为RFID技术的关键应用之一。 引入了通用数据模型，用于通过独立运行的数据源网络查询RFID数据。 该模型可用于促进可追溯性查询处理，并提供一组具有代表性的可追溯性查询。 实施新设计的进程和转发方法来执行可追溯性查询。

    OBJECT CLASSIFICATION USING TAXONOMIES
    8.
    发明申请
    OBJECT CLASSIFICATION USING TAXONOMIES 有权
    使用TAXONOMIES的对象分类

    公开(公告)号：US20100185577A1

    公开(公告)日：2010-07-22

    申请号：US12414065

    申请日：2009-03-30

    申请人： Panayiotis Tsaparas ,  Panagiotis Papadimitriou ,  Ariel D. Fuxman ,  Lise C. Getoor ,  Rakesh Agrawal

    发明人： Panayiotis Tsaparas ,  Panagiotis Papadimitriou ,  Ariel D. Fuxman ,  Lise C. Getoor ,  Rakesh Agrawal

    IPC分类号： G06N5/02

    CPC分类号： G06N99/005

    摘要： As provided herein objects from a source catalog, such as a provider's catalog, can be added to a target catalog, such as an enterprise master catalog, in a scalable manner utilizing catalog taxonomies. A baseline classifier determines probabilities for source objects to target catalog classes. Source objects can be assigned to those classes with probabilities that meet a desired threshold and meet a desired rate. A classification cost for target classes can be determined for respective unassigned source objects, which can comprise determining an assignment cost and separation cost for the source objects for respective desired target classes. The separation and assignment costs can be combined to determine the classification cost, and the unassigned source objects can be assigned to those classes having a desired classification cost.

    摘要翻译： 如本文所提供的，可以使用目录分类法将来自源目录的诸如提供者目录的对象以可扩展的方式添加到目标目录，例如企业主目录。 基准分类器确定源对象到目标目录类的概率。 可以将源对象分配给具有满足期望阈值且满足期望速率的概率的那些类。 可以针对相应的未分配的源对象来确定目标类别的分类成本，其可以包括确定用于各个期望目标类别的源对象的分配成本和分离成本。 分离和分配成本可以组合以确定分类成本，并且未分配的源对象可以被分配给具有期望的分类成本的那些类。

    CUSTOMIZED SEARCH
    9.
    发明申请
    CUSTOMIZED SEARCH 有权
    自定义搜索

    公开(公告)号：US20100114925A1

    公开(公告)日：2010-05-06

    申请号：US12253658

    申请日：2008-10-17

    申请人： John C. Shafer ,  Rakesh Agrawal

    发明人： John C. Shafer ,  Rakesh Agrawal

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864 ,  G06F17/30477

    摘要： Techniques are disclosed herein for providing a custom search engine. In one aspect, a first search query is received from a requestor. First search results contain search result items that match the first search query are obtained. A least one sub-query is generated from the first search results. The generating is based on rules for a particular custom search engine. Second search results that match the sub-query are then obtained. A search result set is formed from a corpus that includes the first search results and the second search results. The generating of the search result set is based on the rules for the particular custom search engine. The search result set is provided to the requester. In one aspect an interface for designing a custom search engine is provided. The interface allows the designer to specify the layout of a search results page.

    摘要翻译： 本文公开了用于提供定制搜索引擎的技术。 在一个方面，从请求者接收第一搜索查询。 首先搜索结果包含与第一个搜索查询匹配的搜索结果项。 从第一搜索结果生成至少一个子查询。 生成基于特定自定义搜索引擎的规则。 然后获得与子查询匹配的第二搜索结果。 搜索结果集由包含第一搜索结果和第二搜索结果的语料库形成。 搜索结果集的生成基于特定自定义搜索引擎的规则。 搜索结果集提供给请求者。 在一个方面，提供了一种用于设计定制搜索引擎的界面。 该界面允许设计者指定搜索结果页面的布局。