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

1. 发明授权

US06401088B1 Method and apparatus for substring selectivity estimation 失效
标题翻译：子串选择性估计的方法和装置
公开(公告)号：US06401088B1
公开(公告)日：2002-06-04
申请号：US09476715
申请日：1999-12-30
申请人： Hosagrahar Visvesvaraya Jagadish , Raymond Ng , Divesh Srivastava
发明人： Hosagrahar Visvesvaraya Jagadish , Raymond Ng , Divesh Srivastava
IPC分类号： G06F1730
CPC分类号： G06F17/30421 , G06F17/18 , G06F17/30469 , Y10S707/99936
摘要： A method for estimating string-occurrence probability in a database comprises receiving a first probability of occurrence for each maximal substring from a plurality of substrings, each maximal substring in the plurality of substrings belonging to the string; obtaining an overall probability of occurrence; receiving a probability of occurrence for a maximal overlap of each maximal substring in the plurality of maximal substrings; obtaining a normalization factor; and dividing the overall probability of occurrence by the normalization factor to obtain the estimate.
摘要翻译：一种用于估计数据库中的字符串发生概率的方法，包括从多个子串中接收每个最大子串的第一概率，每个最大子串在属于该字符串的多个子串中; 获得总发生概率; 在多个最大子串中接收每个最大子串的最大重叠的出现概率; 获得归一化因子; 并将总发生概率除以归一化因子得到估计值。

2. 发明授权

US06442546B1 Messaging system with application-defined states 有权
标题翻译：具有应用程序定义状态的消息系统
公开(公告)号：US06442546B1
公开(公告)日：2002-08-27
申请号：US09222881
申请日：1998-12-30
申请人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Euthimios Panagos , Michael Rabinovich , Divesh Srivastava
发明人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Euthimios Panagos , Michael Rabinovich , Divesh Srivastava
IPC分类号： G06F1730
CPC分类号： G06Q10/107 , H04L51/00 , H04L51/22 , H04L51/24 , Y10S707/99943
摘要： A messaging system in which a core messaging infrastructure stores and manages messaging attributes, but applications external to the core infrastructure define and modify most attributes. Attribute types may be easily defined or modified, the manner in which attribute values are obtained may be easily defined or modified, and the entity types to which attributes are assigned may be easily defined or modified. The messaging system includes a plurality of messaging entities, such as messages, folders, and users, a plurality of attributes associated with the messaging entities, and a plurality of applications. Each application is operable to examine and modify at least some of the messaging entities and attributes. An application selection device is operable to examine at least some of the messaging entities and at least some of the attributes and to select an application to be invoked, from among the plurality of applications, based on values of the examined messaging entities and attributes. An application invocation device invokes the selected application. The applications may define and modify a type of an attribute and/or may define and modify an association of an attribute with a messaging entity.
摘要翻译：消息系统，其中核心消息传递基础设施存储和管理消息传递属性，但核心基础设施外部的应用程序定义和修改大多数属性。可以容易地定义或修改属性类型，可以容易地定义或修改获得属性值的方式，并且可以容易地定义或修改分配给哪些属性的实体类型。消息系统包括多个消息传送实体，诸如消息，文件夹和用户，与消息传递实体相关联的多个属性以及多个应用。每个应用程序可操作以检查和修改至少一些消息传递实体和属性。应用选择设备可操作以基于所检查的消息传送实体和属性的值，从多个应用程序中检查至少一些消息接发实体和至少一些属性并从多个应用中选择要被调用的应用。应用程序调用设备调用所选的应用程序。应用可以定义和修改属性的类型和/或可以定义和修改属性与消息传递实体的关联。

3. 发明授权

US07444326B1 Method of performing approximate substring indexing 有权
标题翻译：执行近似子串索引的方法
公开(公告)号：US07444326B1
公开(公告)日：2008-10-28
申请号：US11314759
申请日：2005-12-21
申请人： Hosagrahar Visvesvaraya Jagadish , Nikolaos Koudas , Shanmugavelayutham Muthukrishnan , Divesh Srivastava
发明人： Hosagrahar Visvesvaraya Jagadish , Nikolaos Koudas , Shanmugavelayutham Muthukrishnan , Divesh Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F17/30637 , Y10S707/99933 , Y10S707/99943
摘要： Approximate substring indexing is accomplished by decomposing each string in a database into overlapping “positional q-grams”, sequences of a predetermined length q, and containing information regarding the “position” of each q-gram within the string (i.e., 1st q-gram, 4th q-gram, etc.). An index is then formed of the tuples of the positional q-gram data (such as, for example, a B-tree index or a hash index). Each query applied to the database is similarly parsed into a plurality of positional q-grams (of the same length), and a candidate set of matches is found. Position-directed filtering is used to remove the candidates which have the q-grams in the wrong order and/or too far apart to form a “verified” output of matching candidates. If errors are permitted (defined in terms of an edit distance between each candidate and the query), an edit distance calculation can then be performed to produce the final set of matching strings.
摘要翻译：通过将数据库中的每个字符串分解为重叠的“位置q-gram”，预定长度q的序列，并且包含关于字符串中每个q-gram的“位置”的信息（即，1 ^{st q-gram，4 nd q-gram等）。然后由位置q-gram数据（例如，B树索引或散列索引）的元组形成索引。应用于数据库的每个查询也被类似地解析为多个位置q-gram（相同长度），并且找到候选的匹配集合。位置定向滤波用于去除具有错误顺序的q-gram和/或相距太远的候选，以形成匹配候选的“验证”输出。如果允许错误（根据每个候选者和查询之间的编辑距离定义），则可以执行编辑距离计算以产生最终匹配的字符串。}

4. 发明授权

US06438608B1 Declarative message addressing 有权
公开(公告)号：US06438608B1
公开(公告)日：2002-08-20
申请号：US09788634
申请日：2001-02-21
申请人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Dongwon Lee , Inderpal Singh Mumick , Euthimios Panagos , Divesh Srivastava , Dimitra Vista
发明人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Dongwon Lee , Inderpal Singh Mumick , Euthimios Panagos , Divesh Srivastava , Dimitra Vista
IPC分类号： G06F1516
摘要： A messaging system, and method of operation thereof, which supports combinations of directory and mailing list addressing mechanisms. Intended message recipients are specified as declarative addresses, which may include combinations of directory and mailing list information. The messaging system includes a messaging server and an address resolution module. The messaging server receives a message from a sender system and transmits the message to the recipient system. The address resolution module, which is coupled to the messaging server, receives a declarative address associated with the message, resolves the declarative address into at least one messaging address and transmits the at least one messaging address to the messaging server. In one embodiment, a database system may be coupled to the address resolution module to allow address resolution based on information stored in a database. The address resolution module generates a database query based on the declarative address and transmits the generated query to a database system. The database system receives a database query, retrieves at least one messaging address specified by the query and transmits the retrieved at least one messaging address to the address resolution module.

5. 发明授权

US06212552B1 Declarative message addressing 失效
标题翻译：声明式消息寻址
公开(公告)号：US06212552B1
公开(公告)日：2001-04-03
申请号：US09007518
申请日：1998-01-15
申请人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Dongwon Lee , Inderpal Singh Mumick , Euthimios Panagos , Divesh Srivastava , Dimitra Vista
发明人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Dongwon Lee , Inderpal Singh Mumick , Euthimios Panagos , Divesh Srivastava , Dimitra Vista
IPC分类号： G06F1516
CPC分类号： H04L51/14
摘要： A messaging system, and method of operation thereof, which supports combinations of directory and mailing list addressing mechanisms. Intended message recipients are specified as declarative addresses, which may include combinations of directory and mailing list information. The messaging system includes a messaging server and an address resolution module. The messaging server receives a message from a sender system and transmits the message to the recipient system. The address resolution module, which is coupled to the messaging server, receives a declarative address associated with the message, resolves the declarative address into at least one messaging address and transmits the at least one messaging address to the messaging server. In one embodiment, a database system may be coupled to the address resolution module to allow address resolution based on information stored in a database. The address resolution module generates a database query based on the declarative address and transmits the generated query to a database system. The database system receives a database query, retrieves at least one messaging address specified by the query and transmits the retrieved at least one messaging address to the address resolution module.
摘要翻译：消息系统及其操作方法，其支持目录和邮件列表寻址机制的组合。预期的消息收件人被指定为声明性地址，其可以包括目录和邮件列表信息的组合。消息系统包括消息收发服务器和地址解析模块。消息收发服务器从发送者系统接收消息并将消息发送到接收方系统。耦合到消息收发服务器的地址解析模块接收与该消息相关联的声明性地址，将该声明性地址解析为至少一个消息传送地址，并将该至少一个消息传送地址发送到消息收发服务器。在一个实施例中，数据库系统可以耦合到地址解析模块，以基于存储在数据库中的信息来允许地址解析。地址解析模块基于声明性地址生成数据库查询，并将生成的查询发送到数据库系统。数据库系统接收数据库查询，检索由查询指定的至少一个消息传送地址，并将检索到的至少一个消息传送地址发送到地址解析模块。

6. 发明授权

US5897632A Method and system for using materialized views to evaluate queries involving aggregation 失效
标题翻译：使用物化视图评估涉及聚合的查询的方法和系统
公开(公告)号：US5897632A
公开(公告)日：1999-04-27
申请号：US895024
申请日：1997-07-16
申请人： Shaul Dar , Hosagrahar Visvesvaraya Jagadish , Alon Yitzchak Levy , Divesh Srivastava
发明人： Shaul Dar , Hosagrahar Visvesvaraya Jagadish , Alon Yitzchak Levy , Divesh Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , G06F17/30489 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933
摘要： The present invention is a method and system for using materialized views to compute answers to SQL queries with grouping and aggregation. A query is evaluated a using a materialized view. The materialized view is semantically analyzed to determine whether the materialized view is usable in evaluating an input query. The semantic analysis includes determining that the materialized view does not project out any columns needed to evaluate the input query and determining that the view does not discard any tuple that satisfies a condition enforced in the input query. If the view is usable, the input query is rewritten to produce an output query that is multi-set equivalent to the input query and that specifies one or more occurrences of the materialized view as a source of information to be returned by the output query. The output query is then evaluated. The semantic analysis and rewriting may be iterated, with the output query of each iteration being the input query of the next iteration. The output query is evaluated after the last iteration.
摘要翻译：本发明是一种使用物化视图来计算具有分组和聚合的SQL查询的答案的方法和系统。使用实例化视图评估查询。物化视图被语义分析，以确定物化视图是否可用于评估输入查询。语义分析包括确定物化视图不会计算出评估输入查询所需的任何列，并确定视图不丢弃满足输入查询中强制执行的条件的任何元组。如果视图可用，则重写输入查询以产生与输入查询相当的多集合的输出查询，并将物理视图的一个或多个出现指定为输出查询返回的信息源。然后评估输出查询。可以重复语义分析和重写，每次迭代的输出查询是下一次迭代的输入查询。输出查询在上次迭代后进行评估。

7. 发明授权

US07010522B1 Method of performing approximate substring indexing 失效
标题翻译：执行近似子串索引的方法
公开(公告)号：US07010522B1
公开(公告)日：2006-03-07
申请号：US10174218
申请日：2002-06-17
申请人： Hosagrahar Visvesvaraya Jagadish , Nikolaos Koudas , Shanmugavelayutham Muthukrishnan , Divesh Srivastava
发明人： Hosagrahar Visvesvaraya Jagadish , Nikolaos Koudas , Shanmugavelayutham Muthukrishnan , Divesh Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F17/30637 , Y10S707/99933 , Y10S707/99943
摘要： Approximate substring indexing is accomplished by decomposing each string in a database into overlapping “positional q-grams”, sequences of a predetermined length q, and containing information regarding the “position” of each q-gram within the string (i.e., 1st q-gram, 4th q-gram, etc.). An index is then formed of the tuples of the positional q-gram data (such as, for example, a B-tree index or a hash index). Each query applied to the database is similarly parsed into a plurality of positional q-grams (of the same length), and a candidate set of matches is found. Position-directed filtering is used to remove the candidates which have the q-grams in the wrong order and/or too far apart to form a “verified” output of matching candidates. If errors are permitted (defined in terms of an edit distance between each candidate and the query), an edit distance calculation can then be performed to produce the final set of matching strings.
摘要翻译：通过将数据库中的每个字符串分解为重叠的“位置q-gram”，预定长度q的序列，并且包含关于字符串中每个q-gram的“位置”的信息（即，1 ^{st q-gram，4 nd q-gram等）。然后由位置q-gram数据（例如，B树索引或散列索引）的元组形成索引。应用于数据库的每个查询也被类似地解析为多个位置q-gram（相同长度），并且找到候选的匹配集合。位置定向滤波用于去除具有错误顺序的q-gram和/或相距太远的候选，以形成匹配候选的“验证”输出。如果允许错误（根据每个候选者和查询之间的编辑距离定义），则可以执行编辑距离计算以产生最终匹配的字符串。}

8. 发明授权

US6047272A Sender-paid electronic messaging 失效
标题翻译：发送方付费电子信息
公开(公告)号：US6047272A
公开(公告)日：2000-04-04
申请号：US2885
申请日：1998-01-05
申请人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Inderpal Singh Mumick , Euthimios Panagos , Divesh Srivastava
发明人： Alexandros Biliris , Gisli Hjalmtysson , Hosagrahar Visvesvaraya Jagadish , Mark Alan Jones , Inderpal Singh Mumick , Euthimios Panagos , Divesh Srivastava
IPC分类号： G06F17/60
CPC分类号： G06Q10/107 , G06Q20/145 , G06Q30/0283 , G06Q30/04 , H04L12/141 , H04L12/1478 , H04L12/587 , H04L51/24 , G06Q10/1091
摘要： The present invention is a messaging system, and method of operation thereof, which provides message recipients with control over the delivery of message and charges the cost of a message to the sender of the message. A message is received at a messaging server from a sender system, the message including an indication of a recipient system. A notification message is transmitted to the recipient system, allowing the message recipient to determine whether they desire the message to be delivered. If so, an activation message is received from the recipient system and the message is transmitted to the recipient system. A charge for the message is assessed to the sender of the message. The message is stored in the messaging server until the activation message is received. At least a portion of the assessed charge may be credited or debited to the recipient of the message. The message may include any type of electronic information, such as text, graphics, video and audio information, and may be encrypted or unencrypted.
摘要翻译：本发明是一种消息收发系统及其操作方法，其为消息收件人提供对消息传递的控制，并向消息的发送者收取消息的费用。在消息传送服务器处从发送者系统接收到消息，该消息包括接收方系统的指示。通知消息被发送到接收方系统，允许消息接收者确定他们是否希望该消息被传递。如果是这样，则从接收方系统接收到激活消息，并将该消息发送到接收方系统。该消息的费用被评估给消息的发送者。消息被存储在消息传递服务器中，直到接收到激活消息。评估费用的至少一部分可能会记入或记入消息的收件人。消息可以包括任何类型的电子信息，例如文本，图形，视频和音频信息，并且可以被加密或未加密。

9. 发明授权

US07523091B2 Method for using query templates in directory caches 有权
标题翻译：在目录缓存中使用查询模板的方法
公开(公告)号：US07523091B2
公开(公告)日：2009-04-21
申请号：US11108940
申请日：2005-04-19
申请人： Olga Kapitskaia , Raymond Ng , Divesh Srivastava
发明人： Olga Kapitskaia , Raymond Ng , Divesh Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , G06F17/3048 , H04L29/06 , H04L61/1517 , H04L61/1523 , H04L67/2852 , H04L67/289 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935 , Y10S707/99939 , Y10S707/99953
摘要： The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.
摘要翻译：本发明公开了通过将各个用户查询概括化而获得的通用查询（称为查询模板）作为用于处理声明式查询的低开销，高效益目录高速缓存的语义基础。可以通过维护一组查询的概括来将高速缓存的有效性提高，并且当它们的估计收益足够高时，将这种泛化允许缓存。在本发明的优选实施例中，将查询模板准许到高速缓存中可以在本发明人被称为“革命性”方式的情况下完成 - 其次是稳定的时期，其中缓存允许和替换可以在进化中逐步地完成时尚。与传统的目录查询缓存相比，本发明可以导致相当高的命中率和较低的服务器端执行和通信成本，同时保持客户端计算开销与查询缓存相当。

10. 发明申请

US20050203897A1 Method for using query templates in directory caches 有权
公开(公告)号：US20050203897A1
公开(公告)日：2005-09-15
申请号：US11108940
申请日：2005-04-19
申请人： Olga Kapitskaia , Raymond Ng , Divesh Srivastava
发明人： Olga Kapitskaia , Raymond Ng , Divesh Srivastava
IPC分类号： G06F17/30 , H04L9/00 , H04L29/06 , H04L29/08 , H04L29/12
CPC分类号： G06F17/30457 , G06F17/3048 , H04L29/06 , H04L61/1517 , H04L61/1523 , H04L67/2852 , H04L67/289 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935 , Y10S707/99939 , Y10S707/99953
摘要： The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式