会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Real-time event processing system with service authoring environment
    • 具有服务创作环境的实时事件处理系统
    • US06681230B1
    • 2004-01-20
    • US09276218
    • 1999-03-25
    • Stephen M. BlottYuri BreitbartThomas M. Cliff, Jr.Frank Frastaci, Jr.Henry F. Korth
    • Stephen M. BlottYuri BreitbartThomas M. Cliff, Jr.Frank Frastaci, Jr.Henry F. Korth
    • G06F1700
    • G06F8/38Y10S707/99945Y10S707/99948
    • A real-time event processing system (EPS) for processing a sequence of events generated by one or more applications. In an illustrative embodiment, the EPS includes a set of real-time analysis engines (RAEs) operating in parallel, e.g., a set of clusters each including one or more RAEs, and one or more mappers for mapping a given input event to a particular one of the clusters. A main-memory database system is coupled to the RAEs, and the RAEs process events associated with input streams from one or more data sources and deliver output streams to one or more data sinks. The data source and data sinks may be, e.g., network elements, clients, databases, etc. The events are processed in accordance with services implemented in the RAEs, and utilize data stored in a memory portion of the main-memory database system accessible to the RAEs. The data may include, e.g., a subscription table storing subscription information indicating the service or services that should be executed for a given event. The services are generated in a service authoring environment (SAE) in the EPS, using a declarative language. The SAE generates the services in the form of object code components, e.g., dynamically linked libraries, which may be dynamically linked into the RAEs without interrupting event processing. Recovery information regarding a recovery point for a given RAE or set of RAEs in the EPS may be stored in a memory portion of the main-memory database system, and utilized to implement a roll-back of the RAE to the recovery point.
    • 一种用于处理由一个或多个应用产生的事件序列的实时事件处理系统(EPS)。 在说明性实施例中,EPS包括并行操作的一组实时分析引擎(RAE),例如,一组包括一个或多个RAE的集群,以及一个或多个映射器,用于将给定的输入事件映射到特定的 其中一个集群。 主存储器数据库系统耦合到RAE,并且RAE处理与来自一个或多个数据源的输入流相关联的事件,并将输出流传送到一个或多个数据宿。 数据源和数据宿可以是例如网络元件,客户端,数据库等。根据在RAE中实现的服务来处理事件,并利用存储在主存储器数据库系统的存储器部分中的数据可访问 RAE。 数据可以包括例如存储指示应当为给定事件执行的服务或服务的订阅信息的订阅表。 这些服务是使用声明性语言在EPS中的服务创作环境(SAE)中生成的。 SAE以目标代码组件的形式生成服务,例如动态链接的库,其可以动态地链接到RAE而不中断事件处理。 关于EPS中的给定RAE或RAE集合的恢复点的恢复信息可以存储在主存储器数据库系统的存储器部分中,并且用于实现RAE到恢复点的回滚。
    • 4. 发明授权
    • Method and apparatus for storage and retrieval of handwritten information
    • 用于存储和检索手写信息的方法和装置
    • US5524240A
    • 1996-06-04
    • US324231
    • 1994-10-17
    • Daniel BarbaraHenry F. Korth
    • Daniel BarbaraHenry F. Korth
    • G06F17/30G06K9/00G06K9/22G06K9/62G06K9/68G06F15/40G06F15/407G06F15/62
    • G06K9/6297G06F17/30247G06F17/30613G06F17/30625G06K9/00429G06K9/00879G06K9/6282Y10S707/954Y10S707/955Y10S707/99933Y10S707/99945
    • A method is provided for generating an indexed database stored in a computer system. A database is established. The database includes a plurality of data objects. Each data object is defined by a respective tuple of attributes. The attributes include at least one attribute having a domain of values that includes handwritten objects. Each handwritten object includes a plurality of symbols ordered in an output sequence. An index is established, having a root node and a plurality of leaf nodes. Each leaf node is connected to the root node by a respective path, such that each path from the root node to one of the plurality of leaf nodes corresponds to a respective input sequence of symbols. The input sequence for the respective leaf node includes a set of pointers to a subset of the tuples. A respective Hidden Markov Model (HMM) is executed to analyze the output sequence of each handwritten object and to determine a respective probability that each input sequence matches the output sequence. A pointer to any tuple for which the respective output sequence has at least a threshold probability of matching the input sequence (corresponding to the leaf node) is included in the respective set of pointers in each respective leaf node. The probability is determined by the respective HMM for the output sequence of each handwritten object.
    • 提供了一种用于生成存储在计算机系统中的索引数据库的方法。 建立数据库。 数据库包括多个数据对象。 每个数据对象由相应的属性元组定义。 这些属性包括至少一个具有包括手写对象的值的域的属性。 每个手写对象包括在输出序列中排序的多个符号。 建立索引,具有根节点和多个叶节点。 每个叶节点通过相应的路径连接到根节点,使得从根节点到多个叶节点中的一个的每个路径对应于相应的输入符号序列。 相应叶节点的输入序列包括一组指向元组子集的指针。 执行相应的隐马尔可夫模型(HMM)以分析每个手写对象的输出序列,并确定每个输入序列与输出序列匹配的相应概率。 指向各个输出序列至少具有匹配输入序列(对应于叶节点)的阈值概率的任何元组的指针被包括在每个相应叶节点中的相应指针集合中。 概率由每个手写对象的输出序列的相应HMM确定。
    • 6. 发明授权
    • Real-time event processing system for telecommunications and other applications
    • 电信等应用实时事件处理系统
    • US06496831B1
    • 2002-12-17
    • US09276339
    • 1999-03-25
    • Gerald D. BaulierStephen M. BlottBenson L. BranchThomas M. Cliff, Jr.Henry F. KorthJonathan E. PolitoAbraham SilberschatzScott L. Speicher
    • Gerald D. BaulierStephen M. BlottBenson L. BranchThomas M. Cliff, Jr.Henry F. KorthJonathan E. PolitoAbraham SilberschatzScott L. Speicher
    • G06F1730
    • G06F17/30557Y10S707/99942Y10S707/99945
    • A real-time event processing system (EPS) for processing a sequence of events generated by one or more applications. In an illustrative embodiment, the EPS includes a set of real-time analysis engines (RAEs) operating in parallel, e.g., a set of clusters each including one or more RAEs, and one or more mappers for mapping a given input event to a particular one of the clusters. A main-memory database system is coupled to the RAEs, and the RAEs process events associated with input streams from one or more data sources and deliver output streams to one or more data sinks. The data source and data sinks may be, e.g., network elements, clients, databases, etc. The events are processed in accordance with services implemented in the RAEs, and utilize data stored in a memory portion of the main-memory database system accessible to the RAEs. The data may include, e.g., a subscription table storing subscription information indicating the service or services that should be executed for a given event. The services are generated in a service authoring environment (SAE) in the EPS, using a declarative language. The SAE generates the services in the form of object code components, e.g., dynamically linked libraries, which may be dynamically linked into the RAEs without interrupting event processing. Recovery information regarding a recovery point for a given RAE or set of RAEs in the EPS may be stored in a memory portion of the main-memory database system, and utilized to implement a roll-back of the RAE to the recovery point.
    • 一种用于处理由一个或多个应用产生的事件序列的实时事件处理系统(EPS)。 在说明性实施例中,EPS包括并行操作的一组实时分析引擎(RAE),例如,一组包括一个或多个RAE的集群,以及一个或多个映射器,用于将给定的输入事件映射到特定的 其中一个集群。 主存储器数据库系统耦合到RAE,并且RAE处理与来自一个或多个数据源的输入流相关联的事件,并将输出流传送到一个或多个数据宿。 数据源和数据宿可以是例如网络元件,客户端,数据库等。根据在RAE中实现的服务来处理事件,并利用存储在主存储器数据库系统的存储器部分中的数据可访问 RAE。 数据可以包括例如存储指示应当为给定事件执行的服务或服务的订阅信息的订阅表。 这些服务是使用声明性语言在EPS中的服务创作环境(SAE)中生成的。 SAE以目标代码组件的形式生成服务,例如动态链接的库,其可以动态地链接到RAE而不中断事件处理。 关于EPS中的给定RAE或RAE集合的恢复点的恢复信息可以存储在主存储器数据库系统的存储器部分中,并且用于实现RAE到恢复点的回滚。
    • 7. 发明授权
    • Serial protocol for transaction execution in main-memory database systems
    • 在主内存数据库系统中执行事务的串行协议
    • US06341285B1
    • 2002-01-22
    • US09344849
    • 1999-06-28
    • Stephen Michael BlottHenry F. Korth
    • Stephen Michael BlottHenry F. Korth
    • G06F1730
    • G06F17/30353Y10S707/99938Y10S707/99952Y10S707/99953
    • A method for improving the performance of a system having a main-memory database which has at least one database containing at least one data item, and having a permanent storage device. The system executes at least one update transaction for modifying the data item to produce update results, and at least one read transaction for reading the data item. The method includes the steps of requiring the update transaction to acquire a database mutex before the update transaction modifies the data item. A timestamp is assigned to the update transaction and to the data item to be updated by the update transaction. After the update transactions updates the data item and before it release the database mutex, the update transaction acquire a mutex associated with the timestamp. Before the update's results are stored to the permanent storage device, the update transaction releases the database mutex. Finally, the update transaction releases the mutex associated with the timestamp after the update's results are stored to the permanent storage device. Before a read transaction is allowed to read the data item, the read transaction must acquire the database mutex. To ensure that the read transaction read data that was committed by the predecessor update transaction, the read transaction must acquire and release the mutex associated with the timestamp before the read transaction terminates.
    • 一种用于改进具有主存储器数据库的系统的性能的方法,所述主存储器数据库具有至少一个包含至少一个数据项的数据库,并且具有永久存储装置。 系统执行至少一个更新事务来修改数据项以产生更新结果,以及至少一个用于读取数据项的读取事务。 该方法包括在更新事务修改数据项之前要求更新事务获取数据库互斥体的步骤。 时间戳被分配给更新事务和由更新事务更新的数据项。 更新事务更新数据项后,在释放数据库互斥体之前,更新事务将获取与时间戳相关联的互斥体。 在将更新结果存储到永久存储设备之前,更新事务将释放数据库互斥体。 最后,更新事务将更新结果存储到永久存储设备后,释放与时间戳相关联的互斥体。 在读取事务被读取数据项之前,读取事务必须获取数据库互斥体。 为了确保读取事务读取由前驱更新事务提交的数据,读取事务必须在读取事务终止之前获取并释放与时间戳相关联的互斥体。
    • 8. 发明授权
    • Concurrency control protocols for management of replicated data items in
a distributed database system
    • 用于管理分布式数据库系统中复制数据项的并发控制协议
    • US5999931A
    • 1999-12-07
    • US953571
    • 1997-10-17
    • Yuri BreitbartHenry F. KorthAbraham Silberschatz
    • Yuri BreitbartHenry F. KorthAbraham Silberschatz
    • G06F9/46G06F17/30
    • G06F17/30575G06F17/30356G06F9/466Y10S707/99938
    • The invention provides protocols for managing transactions operating on replicated data items at multiple physical sites in a distributed database system. The protocols make use of dynamically changing sets of data items referred to as "virtual sites" and a replication graph or other suitable globally consistent representation of the relationships between the transactions and the virtual sites. Illustrative embodiments of the invention include a static global serializability (SGS) protocol, a commit-oriented protocol (COP) and a multiversion optimistic protocol (MOP). The SGS protocol broadcasts the data access set of a given transaction to all physical sites, and applies the Thomas Write Rule (TWR) to write-write conflicts on secondary copies of data items. The COP protocol defers testing of the replication graph until a transaction is ready to commit, and each transaction is allowed to proceed at its origination site independently of other transactions that are executing at other sites. The MOP protocol uses two versions of each data item to ensure global multiversion serializability. The two versions are the current version of the data item, and a "last certified version" of the data item. All read-only transactions read the last certified version, and can therefore proceed without delay. The protocols ensure global serializability while substantially reducing communication overhead relative to conventional protocols.
    • 本发明提供用于管理在分布式数据库系统中的多个物理站点处对复制数据项进行操作的协议。 这些协议利用动态变化的数据项集称为“虚拟站点”,以及复制图或其他合适的全局一致性表示的事务和虚拟站点之间的关系。 本发明的说明性实施例包括静态全局可串行化(SGS)协议,面向提交的协议(COP)和多向乐曲协议(MOP)。 SGS协议将给定事务的数据访问集合广播到所有物理站点,并且将Thomas Write Rule(TWR)应用于数据项的辅助副本上的写入冲突。 COP协议延迟对复制图的测试,直到事务准备好提交,并且允许每个事务在其始发站点独立于在其他站点执行的其他事务进行。 MOP协议使用每个数据项的两个版本来确保全局多版本可串行化。 这两个版本是数据项的当前版本,以及数据项的“最后一个认证版本”。 所有只读事务读取最后一个认证版本,因此可以毫不拖延地继续。 协议确保全局可序列化,同时大大降低了传统协议的通信开销。