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

1. 发明授权

US07873675B2 Set-based data importation into an enterprise resource planning system 有权
标题翻译：基于集合的数据导入到企业资源规划系统中
公开(公告)号：US07873675B2
公开(公告)日：2011-01-18
申请号：US11378829
申请日：2006-03-17
申请人： Jeffrey D. Richey , Srikanth R. Avadhanam , Vladimir Y. Sergeyev
发明人： Jeffrey D. Richey , Srikanth R. Avadhanam , Vladimir Y. Sergeyev
IPC分类号： G06F17/30
CPC分类号： G06Q10/06
摘要： Importation of data records organized within tables from a source system to a target system while preserving relationships among data records of the tables when record identification values identifying each data record have been changed during importation includes, using the same database query on an entire table to update each record identification references that refers to a data record in another table.
摘要翻译：在表中导入从源系统到目标系统的数据记录，同时在导入期间更改识别每个数据记录的记录标识值时，保留表之间的关系，包括在整个表上使用相同的数据库查询更新每个记录标识引用是指另一个表中的数据记录。

2. 发明申请

US20090193048A1 MAINTAINING DATE AND TIME WITH TIME ZONE RULE CHANGES 有权
标题翻译：保持日期和时间与时区规则更改
公开(公告)号：US20090193048A1
公开(公告)日：2009-07-30
申请号：US12020742
申请日：2008-01-28
申请人： Amar Nalla , Srikanth R. Avadhanam , Edvardas V. Budrys , Gandhinath Swaminathan , Vijay B. Kurup
发明人： Amar Nalla , Srikanth R. Avadhanam , Edvardas V. Budrys , Gandhinath Swaminathan , Vijay B. Kurup
IPC分类号： G06F7/00
CPC分类号： G06Q10/1091
摘要： A method and system for maintaining date and time information correctly across rule changes for time zones is provided. A time maintenance system provides rules for converting dates and times between various time zones and a common time zone. When the time maintenance system receives a date and time in a designated time zone, it converts the date and time to a date and time in the common time zone based on a provided rule. The time maintenance system then stores the converted date and time along with an identification of the rule used to convert the date and time to the common time zone. The time maintenance system may then receive an indication of an overriding rule that overrides an existing rule for converting a date and time between the designated time zone and the current time zone. The time maintenance system then updates the stored date and time when the rule has been overridden in such a way as to indicate that the original date and time is no longer correct and to indicate the new rule.
摘要翻译：提供了一种用于在时区的规则更改中正确保持日期和时间信息的方法和系统。时间维护系统提供用于转换不同时区与公共时区之间的日期和时间的规则。当时间维护系统在指定的时区收到日期和时间时，会根据提供的规则将日期和时间转换为公共时区的日期和时间。时间维护系统然后存储转换的日期和时间以及用于将日期和时间转换为公共时区的规则的标识。时间维护系统然后可以接收覆盖用于转换指定时区和当前时区之间的日期和时间的现有规则的优先规则的指示。时间维护系统然后更新存储的日期和时间，当规则被覆盖时，以指示原始日期和时间不再正确并指示新规则的方式。

3. 发明授权

US07519611B2 System and method for using a compressed trie to estimate like predicates 失效
标题翻译：使用压缩特里来估计像谓词的系统和方法
公开(公告)号：US07519611B2
公开(公告)日：2009-04-14
申请号：US10926624
申请日：2004-08-26
申请人： Srikanth R. Avadhanam , Nigel R. Ellis , Campbell Bryce Fraser , Rodger N. Kline
发明人： Srikanth R. Avadhanam , Nigel R. Ellis , Campbell Bryce Fraser , Rodger N. Kline
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30463 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943 , Y10S707/99944
摘要： A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.
摘要翻译：压缩特技包含多个字符子串的节点。这种多字符存储减少了特里部分中的节点数量，从而减少了存储所需的内存所需的内存量，并减少了执行匹配所需的时间量。此外，在这样的压缩特技中，子串被存储在单个字符串中。每个节点通过子字符串的起始位置和字符串中的长度引用其对应的子字符串。多个节点可以引用单个子串。因此，引用而不是将子串存储在相应的节点中消除了重复的子串存储，从而减少了存储该线索所需的内存量。

4. 发明授权

US08024439B2 Server session management application program interface and schema 有权
标题翻译：服务器会话管理应用程序接口和模式
公开(公告)号：US08024439B2
公开(公告)日：2011-09-20
申请号：US11378935
申请日：2006-03-17
申请人： Amar Nalla , Srikanth R. Avadhanam , Gustavo Plancarte
发明人： Amar Nalla , Srikanth R. Avadhanam , Gustavo Plancarte
IPC分类号： G06F15/16
CPC分类号： H04L67/141 , H04L67/14 , H04L67/146
摘要： Application program interfaces (APIs), schemas and procedures manage multiple sessions within a server system has a create session request call for establishing a session between a client and a server within the server system. Each of plurality of sessions among the servers is persisted within a database operatively coupled to the servers. Each session is associated with a unique session identification which uniquely identifies the session among the plurality of sessions. A management request call for managing one of the sessions is performed according to the unique session identification.
摘要翻译：在服务器系统内管理多个会话的应用程序接口（API），模式和过程具有创建会话请求呼叫，用于在服务器系统内的客户端和服务器之间建立会话。服务器之间的多个会话中的每一个被持续在可操作地耦合到服务器的数据库内。每个会话与唯一的会话标识相关联，其唯一地标识多个会话中的会话。根据唯一的会话标识执行用于管理会话之一的管理请求呼叫。

5. 发明授权

US06829602B2 System and method for using a compressed trie to estimate like predicates 有权
公开(公告)号：US06829602B2
公开(公告)日：2004-12-07
申请号：US10317640
申请日：2002-12-12
申请人： Srikanth R. Avadhanam , Nigel R. Ellis , Campbell Bryce Fraser , Rodger N. Kline
发明人： Srikanth R. Avadhanam , Nigel R. Ellis , Campbell Bryce Fraser , Rodger N. Kline
IPC分类号： G06F1730
CPC分类号： G06F17/30327 , G06F17/30463 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943 , Y10S707/99944
摘要： A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.

6. 发明授权

US06714938B1 Query planning using a maxdiff histogram 有权
标题翻译：使用maxdiff直方图进行查询计划
公开(公告)号：US06714938B1
公开(公告)日：2004-03-30
申请号：US09652942
申请日：2000-08-31
申请人： Srikanth R. Avadhanam , Nigel R. Ellis
发明人： Srikanth R. Avadhanam , Nigel R. Ellis
IPC分类号： G06F1730
CPC分类号： G06F17/30463 , G06F17/30536 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99943
摘要： Systems and methods create and maintain a maxdiff histogram for use in determining query costs. One aspect of the system is a data structure that provides fields that can be used to accurately represent a distribution of data regardless of the uniformity or lack thereof of the data. The fields of the data structure represent buckets in the histogram. The fields include a range_Hi_Key field indicating the upper bound for values represented by the bucket. The range_Hi_Key field is also the most frequently occurring value in the bucket. In addition, the fields include a cardEQ field representing the count of the most frequently occurring value, a cardLT field, which is the count of the values in the bucket that are less than the range_Hi_Key field, a LTDistinct field, which is a count of the number of distinct values represented by the bucket, and an LTDensity field, which is an average count for each of the attribute values in the bucket that are not the range_Hi_Key value. A further aspect is a method that creates and maintains the maxdiff histogram data structure. The method starts by creating a list of unused buckets. An input stream of attribute values is sorted and the following acts are performed for each value. If the new value is the same as the previous value, the cardEQ field is incremented. If not, the method checks to see if the histogram is full. If a bucket is available, it is allocated and the bucket fields are initialized. If a bucket is not available, the two buckets that have the least variance between them are merged into one bucket, and the freed bucket is made available for the newly read input value. Whenever a new bucket is created or altered, the variance between the bucket and its neighbors is recalculated.
摘要翻译：系统和方法创建和维护maxdiff直方图，用于确定查询成本。该系统的一个方面是提供可用于精确地表示数据分布的字段的数据结构，而不管数据的均匀性或缺乏。数据结构的字段表示直方图中的桶。这些字段包括一个range_Hi_Key字段，指示由桶表示的值的上限。 range_Hi_Key字段也是存储桶中最常出现的值。另外，这些字段包括表示最常出现的值的计数的cardEQ字段，作为小于range_Hi_Key字段的桶中的值的计数的cardLT字段，该字段是由桶表示的不同值的数量和LTDensity字段，它是桶中每个属性值不是range_Hi_Key值的平均值。另一方面是创建并维护maxdiff直方图数据结构的方法。该方法从创建未使用的桶的列表开始。排序属性值的输入流，并对每个值执行以下动作。如果新值与上一个值相同，则cardEQ字段递增。如果没有，该方法将检查直方图是否已满。如果桶可用，则分配桶，并对桶区进行初始化。如果一个存储桶不可用，那么它们之间差异最小的两个存储区将被合并到一个存储区中，并且释放的存储桶可用于新读取的输入值。每当创建或更改新的桶时，重新计算桶与其邻居之间的差异。

7. 发明授权

US07933881B2 Concurrency control within an enterprise resource planning system 失效
标题翻译：企业资源规划系统中的并发控制
公开(公告)号：US07933881B2
公开(公告)日：2011-04-26
申请号：US11378890
申请日：2006-03-17
申请人： Jeffrey D. Richey , Srikanth R. Avadhanam , Zhonghua Chu
发明人： Jeffrey D. Richey , Srikanth R. Avadhanam , Zhonghua Chu
IPC分类号： G06F17/00
CPC分类号： G06F17/30356 , G06F17/30362
摘要： Concurrency control between multiple data transactions involving the same data includes comparing the version identifications which uniquely identify versions of the data during a read request and during a write request of a data transaction. An exception is thrown if the version identifications do not match, and the exception is handled within the data transaction.
摘要翻译：涉及相同数据的多个数据事务之间的并发控制包括比较在读取请求期间和在数据事务的写入请求期间唯一标识数据版本的版本标识。如果版本标识不匹配，则会抛出异常，并在数据事务中处理异常。

8. 发明授权

US06778977B1 Method and system for creating a database table index using multiple processors 失效
标题翻译：使用多个处理器创建数据库表索引的方法和系统
公开(公告)号：US06778977B1
公开(公告)日：2004-08-17
申请号：US09838691
申请日：2001-04-19
申请人： Srikanth R. Avadhanam , Milind M. Joshi , Ajay Kalhan , Srikumar Rangarajan , Tsvi M. Reiter
发明人： Srikanth R. Avadhanam , Milind M. Joshi , Ajay Kalhan , Srikumar Rangarajan , Tsvi M. Reiter
IPC分类号： G06F700
CPC分类号： G06F17/30327 , Y10S707/99932 , Y10S707/99942
摘要： A method and system for creating an index for a database table of records in a computer environment having a plurality of processing units wherein each processing unit has access to the database table. The method first determines partition delimiters wherein each partition delimiter separates the database table into non-overlapping partitions of records. Each of these partitions is dedicated to one processing unit for index creation. Next, each processing unit independently creates a sub-index, i.e., different processing units create at least two sub-indexes. Last, the method merges the sub-indexes together to create a final index related to the database table.
摘要翻译：一种在具有多个处理单元的计算机环境中为记录的数据库表创建索引的方法和系统，其中每个处理单元都可以访问数据库表。该方法首先确定分区分隔符，其中每个分区定界符将数据库表分成记录的非重叠分区。这些分区中的每一个专用于一个用于索引创建的处理单元。接下来，每个处理单元独立地创建子索引，即，不同的处理单元创建至少两个子索引。最后，该方法将子索引合并在一起以创建与数据库表相关的最终索引。

9. 发明申请

US20110307605A1 SERVER SESSION MANAGEMENT APPLICATION PROGRAM INTERFACE AND SCHEMA 有权
标题翻译：服务器会话管理应用程序接口和示例
公开(公告)号：US20110307605A1
公开(公告)日：2011-12-15
申请号：US13207553
申请日：2011-08-11
申请人： Amar Nalla , Srikanth R. Avadhanam , Gustavo Plancarte
发明人： Amar Nalla , Srikanth R. Avadhanam , Gustavo Plancarte
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： H04L67/141 , H04L67/14 , H04L67/146
摘要： Application program interfaces (APIs), schemas and procedures manage multiple sessions within a server system has a create session request call for establishing a session between a client and a server within the server system. Each of plurality of sessions among the servers is persisted within a database operatively coupled to the servers. Each session is associated with a unique session identification which uniquely identifies the session among the plurality of sessions. A management request call for managing one of the sessions is performed according to the unique session identification.
摘要翻译：在服务器系统内管理多个会话的应用程序接口（API），模式和过程具有创建会话请求呼叫，用于在服务器系统内的客户端和服务器之间建立会话。服务器之间的多个会话中的每一个被持续在可操作地耦合到服务器的数据库内。每个会话与唯一的会话标识相关联，其唯一地标识多个会话中的会话。根据唯一的会话标识执行用于管理会话之一的管理请求呼叫。

10. 发明授权

US07792795B1 Context service system 有权
标题翻译：上下文服务系统
公开(公告)号：US07792795B1
公开(公告)日：2010-09-07
申请号：US10463161
申请日：2003-06-17
申请人： Tanya Swartz , Srikanth R. Avadhanam , Gagan Chopra
发明人： Tanya Swartz , Srikanth R. Avadhanam , Gagan Chopra
IPC分类号： G06F17/30
CPC分类号： G06F17/30719
摘要： The present system aggregates information from a plurality of different context sources. The present system also makes that aggregated information available to requesting components by abstracting it into a generalized form. Thus, the developer of a context-aware application need only know how to interact with the context service of the present invention, rather than knowing how to interact with each and every one of the context sources.
摘要翻译：本系统聚合来自多个不同上下文源的信息。本系统还使得聚合信息可以通过将其抽象为广义形式来请求组件。因此，上下文感知应用的开发者仅需要知道如何与本发明的上下文服务交互，而不是知道如何与每个上下文源进行交互。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式