专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09069448B2 Filtering objects in a multi-tenant environment 有权
标题翻译：在多租户环境中过滤对象
公开(公告)号：US09069448B2
公开(公告)日：2015-06-30
申请号：US13089887
申请日：2011-04-19
申请人： David Park , Neelav Rana , Donovan Schneider , Marko Koosel
发明人： David Park , Neelav Rana , Donovan Schneider , Marko Koosel
IPC分类号： G06F3/0484 , G06F17/30
CPC分类号： G06F3/0484 , G06F17/30398
摘要： Various techniques and procedures related to filtering objects in a virtual application within a multi-tenant system are provided. One approach involves providing a first graphical user interface element enabling indication of a first filtering criterion and a second graphical user interface element enabling indication of a second filtering criterion within the virtual application being accessed over a network from a client device. After indication of the first filtering criterion and the second filtering criterion, a filtered set of objects is identified based on the first filtering criterion and the second filtering criterion. At least a portion of the filtered set of objects may then be presented within the virtual application on a client device.
摘要翻译：提供了与在多租户系统内的虚拟应用中过滤对象相关的各种技术和过程。一种方法包括提供能够指示第一过滤标准的第一图形用户界面元素和允许在通过网络从客户端设备访问的虚拟应用内的第二过滤标准的指示的第二图形用户界面元素。在指示第一过滤标准和第二过滤标准之后，基于第一过滤标准和第二过滤标准来识别被过滤的对象组。然后可以在客户端设备上的虚拟应用程序中呈现所过滤的一组对象的至少一部分。

2. 发明授权

US09864762B2 Systems and methods for mapping a value to a new domain 有权
公开(公告)号：US09864762B2
公开(公告)日：2018-01-09
申请号：US13360209
申请日：2012-01-27
申请人： Marko Koosel , Donovan Schneider , Michael Tang , David Park
发明人： Marko Koosel , Donovan Schneider , Michael Tang , David Park
IPC分类号： G06F17/30
CPC分类号： G06F17/30292
摘要： Source values are mapped to new user-defined categories. The new user-defined categories are stored in a new user-defined field. In an embodiment, a user-selection of an existing field is received. Based on a data type of the existing field, a specific mapping interface is displayed. The interface guides the user through specification of the new field and categories, and identification of the source values to map to the new categories.

3. 发明申请

US20080077557A1 Detecting and processing cache hits for queries with aggregates 有权
标题翻译：检测和处理具有聚合的查询的缓存命中
公开(公告)号：US20080077557A1
公开(公告)日：2008-03-27
申请号：US11931947
申请日：2007-10-31
申请人： Donovan Schneider , Edward Suen , Kazi Zaman
发明人： Donovan Schneider , Edward Suen , Kazi Zaman
IPC分类号： G06F17/30
CPC分类号： G06F17/30483 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.
摘要翻译：通过有效地选择存储在缓存中的查询来进行评估来提高查询缓存性能的技术，通过允许不精确的匹配来提高缓存命中率。首先确定存储在缓存中的潜在可能用于回答新查询的候选查询的列表。此列表可能包括所有缓存的查询，包含精选列表项的精确匹配的缓存查询，或包含精确和/或不精确匹配的缓存查询。然后评估至少一个候选查询中的每一个以确定是否存在高速缓存命中，其指示候选查询可以用于回答新查询。评估是使用一组规则执行的，这些规则允许在新查询中聚合的不精确匹配（如果有）。基于具有高速缓存命中的特定候选查询，为新查询生成查询计划。

4. 发明申请

US20120144313A1 FILTERING OBJECTS IN A MULTI-TENANT ENVIRONMENT 有权
标题翻译：在多重环境中过滤物体
公开(公告)号：US20120144313A1
公开(公告)日：2012-06-07
申请号：US13089887
申请日：2011-04-19
申请人： David Park , Neelav Rana , Donovan Schneider , Marko Koosel
发明人： David Park , Neelav Rana , Donovan Schneider , Marko Koosel
IPC分类号： G06F3/048
CPC分类号： G06F3/0484 , G06F17/30398
摘要： Various techniques and procedures related to filtering objects in a virtual application within a multi-tenant system are provided. One approach involves providing a first graphical user interface element enabling indication of a first filtering criterion and a second graphical user interface element enabling indication of a second filtering criterion within the virtual application being accessed over a network from a client device. After indication of the first filtering criterion and the second filtering criterion, a filtered set of objects is identified based on the first filtering criterion and the second filtering criterion. At least a portion of the filtered set of objects may then be presented within the virtual application on a client device.
摘要翻译：提供了与在多租户系统内的虚拟应用中过滤对象相关的各种技术和过程。一种方法包括提供能够指示第一过滤标准的第一图形用户界面元素和允许在通过网络从客户端设备访问的虚拟应用内的第二过滤标准的指示的第二图形用户界面元素。在指示第一过滤标准和第二过滤标准之后，基于第一过滤标准和第二过滤标准来识别被过滤的对象组。然后可以在客户端设备上的虚拟应用程序中呈现所过滤的一组对象的至少一部分。

5. 发明授权

US07756817B2 System and method for enabling parallel access to serially compressed files 有权
标题翻译：允许并行访问串行压缩文件的系统和方法
公开(公告)号：US07756817B2
公开(公告)日：2010-07-13
申请号：US11773663
申请日：2007-07-05
申请人： Ambikeshwar Raj Merchia , Donovan Schneider , Venkatesan Ramachandran , Sunil Nagaraj
发明人： Ambikeshwar Raj Merchia , Donovan Schneider , Venkatesan Ramachandran , Sunil Nagaraj
IPC分类号： G06F17/00
CPC分类号： H03M7/30 , Y10S707/99943
摘要： The present invention is directed towards systems and methods for generating a compressed data file providing access to one or more selected portions of data contained within the data file. The file is partitioned into one or more chunks, a given chunk comprising a separate unit of data representing a subset of data from the file. The one or more chunks are compressed through use of a compression algorithm, and the one or more chunks are combined to form a compressed file. Metadata is also generated that indicates a chunk offset of a given chunk, thereby allowing direct parallel access to one or more given chunks. Similarly, legacy applications may ignore the chunk structure in the compressed file and access the file according to techniques know in the art, thereby preserving backwards compatibility with such legacy applications.
摘要翻译：本发明涉及用于生成压缩数据文件的系统和方法，该压缩数据文件提供对包含在该数据文件内的数据的一个或多个所选部分的访问。该文件被分成一个或多个块，给定的块包括表示来自该文件的数据子集的单独数据单元。通过使用压缩算法压缩一个或多个块，并且组合一个或多个块以形成压缩文件。还生成指示给定块的块偏移的元数据，从而允许直接并行访问一个或多个给定的块。类似地，遗留应用可以忽略压缩文件中的块结构，并且根据本领域已知的技术来访问该文件，由此保留与这种传统应用的向后兼容性。

6. 发明申请

US20090012982A1 SYSTEM AND METHOD FOR ENABLING PARALLEL ACCESS TO SERIALLY COMPRESSED FILES 有权
标题翻译：用于实现并行压缩文件并行访问的系统和方法
公开(公告)号：US20090012982A1
公开(公告)日：2009-01-08
申请号：US11773663
申请日：2007-07-05
申请人： Ambikeshwar Raj Merchia , Donovan Schneider , Venkatesan Ramachandran , Sunil Nagaraj
发明人： Ambikeshwar Raj Merchia , Donovan Schneider , Venkatesan Ramachandran , Sunil Nagaraj
IPC分类号： G06F7/00
CPC分类号： H03M7/30 , Y10S707/99943
摘要： The present invention is directed towards systems and methods for generating a compressed data file providing access to one or more selected portions of data contained within the data file. The file is partitioned into one or more chunks, a given chunk comprising a separate unit of data representing a subset of data from the file. The one or more chunks are compressed through use of a compression algorithm, and the one or more chunks are combined to form a compressed file. Metadata is also generated that indicates a chunk offset of a given chunk, thereby allowing direct parallel access to one or more given chunks. Similarly, legacy applications may ignore the chunk structure in the compressed file and access the file according to techniques know in the art, thereby preserving backwards compatibility with such legacy applications.
摘要翻译：本发明涉及用于生成压缩数据文件的系统和方法，该压缩数据文件提供对包含在该数据文件内的数据的一个或多个所选部分的访问。该文件被分成一个或多个块，给定的块包括表示来自该文件的数据子集的单独数据单元。通过使用压缩算法压缩一个或多个块，并且组合一个或多个块以形成压缩文件。还生成指示给定块的块偏移的元数据，从而允许直接并行访问一个或多个给定的块。类似地，遗留应用可以忽略压缩文件中的块结构，并且根据本领域已知的技术来访问该文件，由此保留与这种传统应用的向后兼容性。

7. 发明申请

US20120330960A1 SYSTEMS AND METHODS FOR MAPPING A VALUE TO A NEW DOMAIN 有权
标题翻译：将值映射到新域的系统和方法
公开(公告)号：US20120330960A1
公开(公告)日：2012-12-27
申请号：US13360209
申请日：2012-01-27
申请人： Marko Koosel , Donovan Schneider , Michael Tang , David Park
发明人： Marko Koosel , Donovan Schneider , Michael Tang , David Park
IPC分类号： G06F17/30
CPC分类号： G06F17/30292
摘要： Source values are mapped to new user-defined categories. The new user-defined categories are stored in a new user-defined field. In an embodiment, a user-selection of an existing field is received. Based on a data type of the existing field, a specific mapping interface is displayed. The interface guides the user through specification of the new field and categories, and identification of the source values to map to the new categories.
摘要翻译：源值映射到新的用户定义的类别。新的用户定义的类别存储在新的用户定义的字段中。在一个实施例中，接收现有字段的用户选择。根据现有字段的数据类型，显示特定的映射界面。界面引导用户指定新的字段和类别，以及识别源值以映射到新类别。

8. 发明申请

US20070208690A1 Detecting and processing cache hits for queries with aggregates 有权
标题翻译：检测和处理具有聚合的查询的缓存命中
公开(公告)号：US20070208690A1
公开(公告)日：2007-09-06
申请号：US10186344
申请日：2002-06-27
申请人： Donovan Schneider , Edward Suen , Kazi Zaman
发明人： Donovan Schneider , Edward Suen , Kazi Zaman
IPC分类号： G06F17/30
CPC分类号： G06F17/30483 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.
摘要翻译：通过有效地选择存储在缓存中的查询来进行评估来提高查询缓存性能的技术，通过允许不精确的匹配来提高缓存命中率。首先确定存储在缓存中的潜在可能用于回答新查询的候选查询的列表。此列表可能包括所有缓存的查询，包含精选列表项的精确匹配的缓存查询，或包含精确和/或不精确匹配的缓存查询。然后评估至少一个候选查询中的每一个以确定是否存在高速缓存命中，其指示候选查询可以用于回答新查询。评估是使用一组规则执行的，这些规则允许在新查询中聚合的不精确匹配（如果有）。基于具有高速缓存命中的特定候选查询，为新查询生成查询计划。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式