会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Messaging system with application-defined states
    • 具有应用程序定义状态的消息系统
    • US06442546B1
    • 2002-08-27
    • US09222881
    • 1998-12-30
    • Alexandros BilirisGisli HjalmtyssonHosagrahar Visvesvaraya JagadishMark Alan JonesEuthimios PanagosMichael RabinovichDivesh Srivastava
    • Alexandros BilirisGisli HjalmtyssonHosagrahar Visvesvaraya JagadishMark Alan JonesEuthimios PanagosMichael RabinovichDivesh Srivastava
    • G06F1730
    • G06Q10/107H04L51/00H04L51/22H04L51/24Y10S707/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.
    • 消息系统,其中核心消息传递基础设施存储和管理消息传递属性,但核心基础设施外部的应用程序定义和修改大多数属性。 可以容易地定义或修改属性类型,可以容易地定义或修改获得属性值的方式,并且可以容易地定义或修改分配给哪些属性的实体类型。 消息系统包括多个消息传送实体,诸如消息,文件夹和用户,与消息传递实体相关联的多个属性以及多个应用。 每个应用程序可操作以检查和修改至少一些消息传递实体和属性。 应用选择设备可操作以基于所检查的消息传送实体和属性的值,从多个应用程序中检查至少一些消息接发实体和至少一些属性并从多个应用中选择要被调用的应用。 应用程序调用设备调用所选的应用程序。 应用可以定义和修改属性的类型和/或可以定义和修改属性与消息传递实体的关联。
    • 4. 发明授权
    • Declarative message addressing
    • 声明式消息寻址
    • US06212552B1
    • 2001-04-03
    • US09007518
    • 1998-01-15
    • Alexandros BilirisGisli HjalmtyssonHosagrahar Visvesvaraya JagadishMark Alan JonesDongwon LeeInderpal Singh MumickEuthimios PanagosDivesh SrivastavaDimitra Vista
    • Alexandros BilirisGisli HjalmtyssonHosagrahar Visvesvaraya JagadishMark Alan JonesDongwon LeeInderpal Singh MumickEuthimios PanagosDivesh SrivastavaDimitra Vista
    • G06F1516
    • 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.
    • 消息系统及其操作方法,其支持目录和邮件列表寻址机制的组合。 预期的消息收件人被指定为声明性地址,其可以包括目录和邮件列表信息的组合。 消息系统包括消息收发服务器和地址解析模块。 消息收发服务器从发送者系统接收消息并将消息发送到接收方系统。 耦合到消息收发服务器的地址解析模块接收与该消息相关联的声明性地址,将该声明性地址解析为至少一个消息传送地址,并将该至少一个消息传送地址发送到消息收发服务器。 在一个实施例中,数据库系统可以耦合到地址解析模块,以基于存储在数据库中的信息来允许地址解析。 地址解析模块基于声明性地址生成数据库查询,并将生成的查询发送到数据库系统。 数据库系统接收数据库查询,检索由查询指定的至少一个消息传送地址,并将检索到的至少一个消息传送地址发送到地址解析模块。
    • 5. 发明授权
    • Local logging in a distributed database management computer system
    • 本地登录分布式数据库管理计算机系统
    • US5966706A
    • 1999-10-12
    • US803042
    • 1997-02-19
    • Alexandros BilirisHosagrahar Visvesvaraya JagadishEuthimios PanagosRajeev R. Rastogi
    • Alexandros BilirisHosagrahar Visvesvaraya JagadishEuthimios PanagosRajeev R. Rastogi
    • G06F11/14G06F17/30
    • G06F17/30368Y10S707/99931Y10S707/99932Y10S707/99938Y10S707/99943
    • A distributed database management computer system includes a plurality of nodes and a plurality of database pages. When a first node in the computer system updates a first database page, the first node generates a log record. The first node determines whether it manages the first database page. If the first node determines that it manages the first database page, the first node writes the log record to a log storage local to the first node. However, if the first node determines that it does not manage the first database page, the first node then determines whether it includes a local log storage. If the first node includes a local log storage, the first node writes the log record to the local log storage, even if the first node does not manage the first database page. If the first node does not include a local log storage, the first node sends the log record to a second node managing the first database page.
    • 分布式数据库管理计算机系统包括多个节点和多个数据库页面。 当计算机系统中的第一个节点更新第一个数据库页面时,第一个节点生成一个日志记录。 第一个节点确定它是否管理第一个数据库页面。 如果第一个节点确定它管理第一个数据库页面,则第一个节点将日志记录写入本地的第一个节点的日志存储。 然而,如果第一节点确定它不管理第一数据库页面,则第一节点然后确定其是否包括本地日志存储器。 如果第一个节点包括本地日志存储,则第一个节点将日志记录写入本地日志存储,即使第一个节点没有管理第一个数据库页面。 如果第一个节点不包括本地日志存储,则第一个节点将日志记录发送到管理第一个数据库页面的第二个节点。
    • 6. 发明授权
    • Method and apparatus for analyzing co-evolving time sequences
    • 用于分析共同演进的时间序列的方法和装置
    • US6055491A
    • 2000-04-25
    • US953578
    • 1997-10-17
    • Alexandros BilirisChristos N. FaloutsosHosagrahar Visvesvaraya JagadishTheodore JohnsonNikolaos Dimitrios SidriopoulosByoung-Kee Yi
    • Alexandros BilirisChristos N. FaloutsosHosagrahar Visvesvaraya JagadishTheodore JohnsonNikolaos Dimitrios SidriopoulosByoung-Kee Yi
    • G06G7/02G06G7/19
    • G06G7/02
    • An analyzer system that analyzes a plurality of co-evolving time sequences to, for example, perform correlation or outlier detection on the time sequences. The plurality of co-evolving time sequences comprise a delayed time sequence and one or more known time sequences. A goal is to predict the delayed value given the available information. The plurality of time sequences have a present value and (N-1) past values, where N is the number of samples (time-ticks) of each time sequence. The analyzer system receives the plurality of co-evolving time sequences and determines a window size ("w"). The analyzer then assigns the delayed time sequence as a dependent variable and the present value of a subset of the known time sequences, and the past values of the subset of known time sequences and the delayed time sequence, as a plurality of independent variables. Past values delayed by up to "w" steps are considered. The analyzer then forms an equation comprising the dependent variable and the independent variables, and then solves the equation using a least squares method. The delayed time sequence is then determined using the solved equation.
    • 分析系统,其分析多个共同演进的时间序列,以便例如对时间序列执行相关或异常值检测。 多个共同演进的时间序列包括延迟时间序列和一个或多个已知时间序列。 一个目标是预测给定可用信息的延迟值。 多个时间序列具有当前值和(N-1)个过去值,其中N是每个时间序列的采样数(时间刻度)。 分析器系统接收多个共同演进的时间序列并确定窗口大小(“w”)。 然后,分析器将延迟的时间序列分配为因变量,将已知时间序列的子集的现值以及已知时间序列的子集的过去值和延迟的时间序列分配为多个独立变量。 考虑到延迟最多为“w”步的过去值。 然后,分析器形成包含因变量和独立变量的方程,然后使用最小二乘法求解方程。 然后使用求解的方程确定延迟时间序列。
    • 8. 发明授权
    • Method of performing approximate substring indexing
    • 执行近似子串索引的方法
    • US07444326B1
    • 2008-10-28
    • US11314759
    • 2005-12-21
    • Hosagrahar Visvesvaraya JagadishNikolaos KoudasShanmugavelayutham MuthukrishnanDivesh Srivastava
    • Hosagrahar Visvesvaraya JagadishNikolaos KoudasShanmugavelayutham MuthukrishnanDivesh Srivastava
    • G06F17/30
    • G06F17/30637Y10S707/99933Y10S707/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和/或相距太远的候选,以形成匹配候选的“验证”输出。 如果允许错误(根据每个候选者和查询之间的编辑距离定义),则可以执行编辑距离计算以产生最终匹配的字符串。
    • 9. 发明授权
    • Method and system for using materialized views to evaluate queries
involving aggregation
    • 使用物化视图评估涉及聚合的查询的方法和系统
    • US5897632A
    • 1999-04-27
    • US895024
    • 1997-07-16
    • Shaul DarHosagrahar Visvesvaraya JagadishAlon Yitzchak LevyDivesh Srivastava
    • Shaul DarHosagrahar Visvesvaraya JagadishAlon Yitzchak LevyDivesh Srivastava
    • G06F17/30
    • G06F17/30457G06F17/30489Y10S707/99931Y10S707/99932Y10S707/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查询的答案的方法和系统。 使用实例化视图评估查询。 物化视图被语义分析,以确定物化视图是否可用于评估输入查询。 语义分析包括确定物化视图不会计算出评估输入查询所需的任何列,并确定视图不丢弃满足输入查询中强制执行的条件的任何元组。 如果视图可用,则重写输入查询以产生与输入查询相当的多集合的输出查询,并将物理视图的一个或多个出现指定为输出查询返回的信息源。 然后评估输出查询。 可以重复语义分析和重写,每次迭代的输出查询是下一次迭代的输入查询。 输出查询在上次迭代后进行评估。
    • 10. 发明授权
    • Method of performing approximate substring indexing
    • 执行近似子串索引的方法
    • US07010522B1
    • 2006-03-07
    • US10174218
    • 2002-06-17
    • Hosagrahar Visvesvaraya JagadishNikolaos KoudasShanmugavelayutham MuthukrishnanDivesh Srivastava
    • Hosagrahar Visvesvaraya JagadishNikolaos KoudasShanmugavelayutham MuthukrishnanDivesh Srivastava
    • G06F17/30
    • G06F17/30637Y10S707/99933Y10S707/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和/或相距太远的候选,以形成匹配候选的“验证”输出。 如果允许错误(根据每个候选者和查询之间的编辑距离定义),则可以执行编辑距离计算以产生最终匹配的字符串。