会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • MULTI-GRANULARITY HIERARCHICAL AGGREGATE SELECTION BASED ON UPDATE, STORAGE AND RESPONSE CONSTRAINTS
    • 基于更新,存储和响应约束的多粒度分层聚类选择
    • US20120330996A1
    • 2012-12-27
    • US13169514
    • 2011-06-27
    • Yuan-Chi ChangLawrence KovedChristian A. LangIgor Sominsky
    • Yuan-Chi ChangLawrence KovedChristian A. LangIgor Sominsky
    • G06F17/30
    • G06F17/30551G06F17/30489
    • Techniques are disclosed for multi-granularity hierarchical aggregate selection based on update, storage and response constraints. For example, for a temporal hierarchy of aggregation statistics associated with a plurality of database records, wherein the temporal hierarchy comprises two or more aggregation statistics levels and each level has a different temporal granularity associated therewith, a method comprises iteratively modifying the temporal hierarchy to at least one of: (a) minimize a storage usage cost while satisfying a temporal hierarchy update constraint and a query response time constraint; (b) reduce a temporal hierarchy update time and a query response time while satisfying a storage usage constraint; and (c) minimize a query response time for frequently applied queries that do not shift in time while satisfying the storage usage constraint, wherein the resulting temporal hierarchy that achieves at least one of (a), (b) and (c) is identified as an optimal temporal hierarchy.
    • 公开了基于更新,存储和响应约束的多粒度分级聚合选择的技术。 例如,对于与多个数据库记录相关联的聚合统计的时间层级,其中时间层级包括两个或多个聚合统计级别,并且每个级别具有与之相关联的不同时间粒度,一种方法包括将时间层级迭代地修改为 至少一个:(a)在满足时间层次更新约束和查询响应时间约束的同时最小化存储使用成本; (b)在满足存储使用限制的同时减少时间层次更新时间和查询响应时间; (c)最小化在满足存储使用限制的同时不随时间移动的频繁应用的查询的查询响应时间,其中识别达到(a),(b)和(c)中的至少一个的所得到的时间层级, 作为最优时间层级。
    • 4. 发明授权
    • Systems and methods for providing autonomous persistent storage systems
    • 提供自主持久存储系统的系统和方法
    • US07877390B2
    • 2011-01-25
    • US10689091
    • 2003-10-20
    • Yuan-Chi Chang
    • Yuan-Chi Chang
    • G06F7/00
    • G06F17/30607
    • Systems, methods and services for generating autonomous persistent storage systems that are self-configurable and self-managing, based on user-submitted entity definitions. For example, systems and methods are provided for automatically creating and updating persistent storage structures based on entity definitions, automatically populating persistent storage space with instance data of defined entities, automatically generating and adapting methods for accessing instance data in persistent storage, searching instance data and automatically optimizing search methods for instance data, and automatically creating and managing a cache of frequently accessed instance data.
    • 基于用户提交的实体定义,用于生成自配置和自我管理的自治永久存储系统的系统,方法和服务。 例如,提供了系统和方法,用于基于实体定义自动创建和更新持久存储结构,使用定义的实体的实例数据自动填充持久存储空间,自动生成和调整用于访问持久存储中的实例数据的方法,搜索实例数据和 自动优化用于实例数据的搜索方法,并自动创建和管理经常访问的实例数据的缓存。
    • 5. 发明申请
    • Method for merging multiple ranked lists with bounded memory
    • 将多个排名列表与有界记忆合并的方法
    • US20060190425A1
    • 2006-08-24
    • US11064605
    • 2005-02-24
    • Yuan-Chi ChangChristian LangApostol NatsevSriram PadmanabhanMin WangIoana Stanoi
    • Yuan-Chi ChangChristian LangApostol NatsevSriram PadmanabhanMin WangIoana Stanoi
    • G06F17/30
    • G06F16/5838G06F16/24549
    • Systems and methods for conducting attribute-based queries over a plurality of objects using bounded memory locations and minimizing costly input and output operations are provided. A plurality of attributes are associated with each object, and a plurality of data groups, one each for the identified attributes are created. The objects associated with the attributes are placed into the appropriate data groups, and the objects contained within each data group are sorted into blocks such that each block within a given attribute contains that objects having the same attribute value. Results to the query are created by loading blocks into a primary memory location in a middleware system and combining the loaded blocks to create the desire query results. Block combinations are created based upon the fit of the given block combination to the query as expressed in an aggregation function. A second dedicated memory location can also be provided to hold multiple block combinations to optimize the order in which blocks are loaded and combined. Empty block buffers and external storage devices can also be provided to further enhance the generation of query results.
    • 提供了使用有限存储器位置对多个对象进行基于属性的查询并最小化昂贵的输入和输出操作的系统和方法。 多个属性与每个对象相关联,并且创建多个数据组,每个数据组各自用于所识别的属性。 与属性相关联的对象被放置到适当的数据组中,并且每个数据组中包含的对象被排序成块,使得给定属性中的每个块包含具有相同属性值的对象。 通过将块加载到中间件系统中的主存储器位置并组合加载的块以创建期望查询结果来创建查询的结果。 基于给定块组合对于在聚合函数中表达的查询的拟合来创建块组合。 还可以提供第二专用存储器位置以保持多个块组合以优化块被加载和组合的顺序。 还可以提供空块缓冲区和外部存储设备,以进一步增强查询结果的生成。
    • 6. 发明授权
    • Multidimensional indexing structure for use with linear optimization queries
    • 用于线性优化查询的多维索引结构
    • US06408300B1
    • 2002-06-18
    • US09360366
    • 1999-07-23
    • Lawrence David BergmanVittorio CastelliYuan-Chi ChangChung-Sheng LiJohn Richard Smith
    • Lawrence David BergmanVittorio CastelliYuan-Chi ChangChung-Sheng LiJohn Richard Smith
    • G06F1730
    • G06F17/30333Y10S707/99934Y10S707/99942Y10S707/99945Y10S707/99948
    • Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards. At least one record per layer will satisfy the query criterion and the number of layers needed to be searched depends on the spatial distribution of records, the query-issued linear coefficients, and N, the number of records to be returned. When N is small compared to the total size of the database, answering the query typically requires searching only a small fraction of all relevant records, resulting in a tremendous speedup as compared to linearly scanning the entire dataset.
    • 通常在各种决策支持和资源规划应用中出现的线性优化查询是检索满足特定优化标准的前N个数据记录(其中N是大于零的整数)的查询。 优化标准是最大化或最小化线性方程。 查询时给出线性方程的系数。 公开了用于构建,维护和利用数据库记录的多维索引结构以提高线性优化查询的执行速度的方法和装置。 具有数值属性的数据库记录被分为多个层,每个层表示一个称为凸包的几何结构。 通过从该多层索引结构的最外层向内搜索来处理这样的线性优化查询。 每层至少一个记录将满足查询条件,需要搜索的层数取决于记录的空间分布,查询发出的线性系数,N,要返回的记录数。 当N与数据库的总大小相比较小时,回答查询通常只需要搜索所有相关记录的一小部分,与线性扫描整个数据集相比,导致了巨大的加速。