会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • SYSTEM AND METHOD FOR FILTERING DATABASE RESULTS USING DYNAMIC COMPOSITE QUERIES
    • 使用动态复合查询过滤数据库结果的系统和方法
    • US20090228440A1
    • 2009-09-10
    • US12044395
    • 2008-03-07
    • Avraham LeffJames T. RayfieldTimo J. SaloBrandon J.W. Smith
    • Avraham LeffJames T. RayfieldTimo J. SaloBrandon J.W. Smith
    • G06F7/06
    • G06F17/30424G06F21/6227
    • A method, system and computer program product for retrieving data records to a client computer. An identifier of a base query is received from the client computer. The base query is configured to select a set of data records from a database that the client computer has permission to access. A modifying clause is also received from the client computer. The modifying clause comprises a directive restricting the set of data records to a subset of data records. The modifying clause may optionally comprise an expression for sorting. A combined query is generated from the base query and the modifying clause. The query is configured to return the subset of data records. The combined query is further configured to sort the subset of data records based on the value of the expression if the expression is present. The combined query is executed at the database.
    • 一种用于将数据记录检索到客户端计算机的方法,系统和计算机程序产品。 从客户端计算机接收到基本查询的标识符。 基本查询配置为从客户端计算机具有访问权限的数据库中选择一组数据记录。 还从客户端计算机接收修改子句。 修改子句包括将数据记录集合限制到数据记录的子集的指令。 修改子句可以可选地包括用于排序的表达式。 从基本查询和modify子句生成组合查询。 该查询被配置为返回数据记录的子集。 组合查询还被配置为如果表达式存在,则基于表达式的值对数据记录的子集进行排序。 组合查询在数据库中执行。
    • 2. 发明授权
    • Transaction-scoped replication for distributed object systems
    • 分布式对象系统的事务范围复制
    • US06457065B1
    • 2002-09-24
    • US09478093
    • 1999-01-05
    • Lawrence Scott RichTimo J. Salo
    • Lawrence Scott RichTimo J. Salo
    • G06F945
    • G06F17/30377G06F9/466G06F17/30575
    • A method, system, and computer program product for improving the performance of distributed object systems. A remote object is replicated to the node of the distributed system from which it is accessed. The scope of the replication is a transaction. Thereafter, method invocations on the object occur locally, avoiding the performance overhead of frequent round trips to the remote persistent object store. Changes made to a replicated object by a transaction are represented using a tree structure that is internally managed by the application. When an application or application user has made modifications to a replicated object and requests to commit the modifications, a determination is first made as to whether committing the modifications will result in an unacceptable data conflict. If no unacceptable data conflict will occur, and after resolution of those conflicts that can be resolved, the modifications are committed. Nested transactions are supported, where each child transaction may commit or roll back independently.
    • 一种用于提高分布式对象系统性能的方法,系统和计算机程序产品。 远程对象被复制到被访问的分布式系统的节点。 复制的范围是一个事务。 此后,对象上的方法调用本地发生,避免了对远程持久对象存储的频繁往返的性能开销。 使用由应用程序内部管理的树结构来表示由事务对复制对象所做的更改。 当应用程序或应用程序用户对复制对象进行修改并请求提交修改时,首先确定提交修改是否会导致不可接受的数据冲突。 如果不会发生不可接受的数据冲突,并且在解决可以解决的冲突之后,修改将被提交。 支持嵌套事务,每个子事务可以独立提交或回滚。
    • 3. 发明授权
    • Technique for managing enterprise JavaBeans (™) which are the target of multiple concurrent and/or nested transactions
    • 管理企业JavaBeans((TM))的技术,它们是多个并发和/或嵌套事务的目标
    • US06298478B1
    • 2001-10-02
    • US09223986
    • 1998-12-31
    • Martin P. NallyLawrence Scott RichTimo J. Salo
    • Martin P. NallyLawrence Scott RichTimo J. Salo
    • G06F9445
    • G06F9/54G06F9/466
    • A technique for providing a transaction management subsystem for an enterprise computing environment in which multiple concurrent and/or nested transactions may access the same Enterprise JavaBeans (EJBs) simultaneously. The transaction management subsystem provides a view for each transaction which includes an independent version of an EJB's business logic and its instance data. When an application or application user has made modifications to an EJB version and requests to commit the modifications, a determination is first made as to whether committing the modifications will result in an unacceptable data conflict with other versions of the same EJB. If no unacceptable data conflict will occur, and after resolution of those conflicts that can be resolved, the modifications are committed. The management subsystem also supports nested transactions, where each subtransaction may have an independent view of an EJB. Subtransactions may commit or roll back independently. Changes made by a transaction are represented using a tree structure that is internally managed by the application.
    • 一种用于为企业计算环境提供事务管理子系统的技术,其中多个并发和/或嵌套事务可以同时访问同一企业JavaBeans(EJB)。 事务管理子系统为包含EJB业务逻辑及其实例数据的独立版本的每个事务提供一个视图。 当应用程序或应用程序用户对EJB版本进行修改并请求提交修改时,首先确定提交修改是否会导致不可接受的数据与同一EJB的其他版本冲突。 如果不会发生不可接受的数据冲突,并且在解决可以解决的冲突之后,修改将被提交。 管理子系统还支持嵌套事务,每个子事务可以具有EJB的独立视图。 子交易可以独立提交或回滚。 使用由应用程序内部管理的树结构来表示事务所做的更改。
    • 4. 发明申请
    • Decentralized Many-to-Many Relationship Management in an Object Persistence Management System
    • 对象持续管理系统中的分散式多对多关系管理
    • US20080208898A1
    • 2008-08-28
    • US12113639
    • 2008-05-01
    • Timo J. SaloKevin J. Williams
    • Timo J. SaloKevin J. Williams
    • G06F17/30
    • G06F9/4493Y10S707/954Y10S707/96Y10S707/99931Y10S707/99933Y10S707/99942Y10S707/99943
    • A many-to-many relationship management system. In an object persistence management system, a many-to-many relationship manager can include one or more related objects; a junction table storing relationships between the related objects; and, one or more corresponding links. Each link can correspond to one of the objects. Furthermore, each link can persist state information for the corresponding object in an associated object table. Finally, each link can manage the junction table responsive to changing relationships with others of the related objects. Importantly, as the present invention distributes the management of the junction table, a counter-operation management protocol can be provided which can resolve conflicts which arise in the management of the junction table in response to changing relationships among their associated objects.
    • 多对多关系管理系统。 在对象持久性管理系统中,多对多关系管理器可以包括一个或多个相关对象; 存储相关对象之间的关系的连接表; 和一个或多个相应的链接。 每个链接可以对应于其中一个对象。 此外,每个链接可以在相关联的对象表中保持对应对象的状态信息。 最后,每个链接可以响应于与其他相关对象的变化的关系来管理连接表。 重要的是,由于本发明分配了接合台的管理,所以可以提供一种可以解决在连接表管理中出现的冲突的对策管理协议,以响应其关联对象之间的变化关系。
    • 5. 发明授权
    • Macro-based dynamic discovery of data shape
    • 基于宏的动态发现数据形状
    • US07197496B2
    • 2007-03-27
    • US10761183
    • 2004-01-20
    • Brent H. DanielTimo J. SaloKevin J. Williams
    • Brent H. DanielTimo J. SaloKevin J. Williams
    • G06F17/30
    • G06F17/30979Y10S707/99933Y10S707/99934Y10S707/99935
    • The present invention comprises a Dynamic Query Interface (DQI). The DQI provides an apparatus and method for dynamically discovering the shape of data returned by a DBMS in response to a query statement. The DQI comprises a Query Schema, a Select Macro, and a Macro Expansion Module (MEM). Unlike conventional query statements, a Select Macro only requires a select-clause. The MEM builds a conventional query statement from a Select Macro using information contained in the Query Schema. The Macro Token expansion approach implemented in the MEM obviates the need for full language parsing and is thus much more suited to runtime execution than prior art solutions. Furthermore, because the MEM examines a Select Macro at runtime, the MEM has the added advantage over prior art solutions of being able to discover dynamically the shape of the requested data at runtime.
    • 本发明包括动态查询接口(DQI)。 DQI提供了一种用于动态发现DBMS响应于查询语句返回的数据形状的装置和方法。 DQI包括查询模式,选择宏和宏扩展模块(MEM)。 与传统查询语句不同,Select Macro只需要一个select子句。 MEM使用Query Schema中包含的信息从Select Macro构建常规查询语句。 在MEM中实现的宏令牌扩展方法避免了对全语言解析的需要,因此比现有技术的解决方案更适合于运行时执行。 此外,由于MEM在运行时检查选择宏,所以MEM具有优于现有技术解决方案的优点,能够在运行时动态地发现所请求数据的形状。
    • 6. 发明授权
    • SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCTS FOR ORDERING OBJECTS CORRESPONDING TO DATABASE OPERATIONS THAT ARE PERFORMED ON A RELATIONAL DATABASE UPON COMPLETION OF A TRANSACTION BY AN OBJECT-ORIENTED TRANSACTION SYSTEM
    • 系统,方法和计算机程序产品,用于在面向对象的交易系统完成交易之后,对相关数据进行数据库操作的对象进行排序
    • US06456995B1
    • 2002-09-24
    • US09224427
    • 1998-12-31
    • Timo J. SaloKevin J. Williams
    • Timo J. SaloKevin J. Williams
    • G06F1700
    • G06F17/30595Y10S707/954Y10S707/955Y10S707/99931Y10S707/99938Y10S707/99944
    • Systems, methods and computer program products automatically order database transaction by an object-oriented transaction system. The objects in the completed transaction are clustered into groups of objects to be inserted into the relational database, objects to be deleted from the relational database and objects to be updated in the relational database. The objects to be inserted into the relational database are ordered according to an insert precedence of the objects into the relational database to thereby define an insert order. The objects to be deleted from the relational database are ordered according to a delete precedence of the objects from the relational database are ordered according to a delete precedence of the objects from the relational database to thereby define a delete order. The objects to be inserted into the relational database are inserted into the relational database in the insert order. Then, the objects to be updated in the relational database are updated in an arbitrary order. Finally, the objects to be deleted from the relational database are deleted from the relational database in the delete order.
    • 系统,方法和计算机程序产品通过面向对象的事务系统自动排序数据库事务。 完成的事务中的对象被聚集成要插入关系数据库的对象组,要从关系数据库中删除的对象和要在关系数据库中更新的对象。 要插入到关系数据库中的对象根据对象的插入优先级排序到关系数据库中,从而定义插入顺序。 从关系数据库中删除的对象根据从关系数据库的对象的删除优先级按照从关系数据库的对象的删除优先级进行排序,从而定义删除顺序。 要插入到关系数据库中的对象将以插入顺序插入到关系数据库中。 然后,关系数据库中要更新的对象以任意顺序更新。 最后,从关系数据库中删除的对象将以删除顺序从关系数据库中删除。
    • 7. 发明授权
    • System and method for filtering database results using dynamic composite queries
    • 使用动态复合查询过滤数据库结果的系统和方法
    • US07958105B2
    • 2011-06-07
    • US12044395
    • 2008-03-07
    • Avraham LeffJames T. RayfieldTimo J. SaloBrandon J. W. Smith
    • Avraham LeffJames T. RayfieldTimo J. SaloBrandon J. W. Smith
    • G06F17/30
    • G06F17/30424G06F21/6227
    • A method, system and computer program product for retrieving data records to a client computer. An identifier of a base query is received from the client computer. The base query is configured to select a set of data records from a database that the client computer has permission to access. A modifying clause is also received from the client computer. The modifying clause comprises a directive restricting the set of data records to a subset of data records. The modifying clause may optionally comprise an expression for sorting. A combined query is generated from the base query and the modifying clause. The query is configured to return the subset of data records. The combined query is further configured to sort the subset of data records based on the value of the expression if the expression is present. The combined query is executed at the database.
    • 一种用于将数据记录检索到客户端计算机的方法,系统和计算机程序产品。 从客户端计算机接收到基本查询的标识符。 基本查询配置为从客户端计算机具有访问权限的数据库中选择一组数据记录。 还从客户端计算机接收修改子句。 修改子句包括将数据记录集合限制到数据记录的子集的指令。 修改子句可以可选地包括用于排序的表达式。 从基本查询和modify子句生成组合查询。 该查询被配置为返回数据记录的子集。 组合查询还被配置为如果表达式存在,则基于表达式的值对数据记录的子集进行排序。 组合查询在数据库中执行。
    • 8. 发明授权
    • Structured cache for persistent objects
    • 持久性对象的结构缓存
    • US06453321B1
    • 2002-09-17
    • US09248561
    • 1999-02-11
    • Justin H. HillTimo J. Salo
    • Justin H. HillTimo J. Salo
    • G06F1730
    • G06F17/30457G06F17/3048Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99944Y10S707/99945
    • A technique for creating and using a structured cache to increase the efficiency of reading persistent objects from a database. The structured cache is comprised of an object cache, an associations cache, and a data cache. Data read-ahead is used to retrieve rows from a relational database in advance of an application's need for the data. Entries are created in the data cache and association cache as the rows are processed. The data cache stores data in unstructured binary format, delaying the expense of instantiation until an object is requested by the application. At that time, data is retrieved from the data cache, an object is instantiated from the data, and an entry is created in the object cache. This approach also saves storage space that would be wasted if objects were instantiated upon retrieval, but never used. The association cache stores members of an association, organized by member key within owner key for each association. According to the preferred embodiment, maintaining cache consistency is not required, further increasing the efficiency gains that can be realized using this technique.
    • 一种用于创建和使用结构化缓存以提高从数据库读取持久对象的效率的技术。 结构化缓存由对象缓存,关联高速缓存和数据高速缓存组成。 数据预读用于在应用程序对数据的需求之前从关系数据库检索行。 在处理行时,将在数据高速缓存和关联高速缓存中创建条目。 数据高速缓存以非结构化的二进制格式存储数据,延迟实例的费用,直到应用程序请求对象。 此时,从数据高速缓存中检索数据,从数据中实例化一个对象,并在对象缓存中创建一个条目。 这种方法还节省了存储空间,如果对象在检索时被实例化,但从未使用,则会浪费这些空间。 关联高速缓存存储关联的成员,由每个关联的所有者密钥内的成员密钥组织。 根据优选实施例,不需要保持高速缓存一致性,进一步增加使用该技术可以实现的效率增益。
    • 10. 发明授权
    • Ordering relational database operations according to referential integrity constraints
    • 根据参照完整性约束订购关系数据库操作
    • US06542883B1
    • 2003-04-01
    • US09521877
    • 2000-03-09
    • Timo J. Salo
    • Timo J. Salo
    • G06F1730
    • G06F17/30483G06F17/3051Y10S707/99931Y10S707/99945
    • A method, system, and computer program product for increasing the efficiency of operations that are to be performed against an arbitrary relational database by automatically ordering the operations according to the referential integrity constraints defined for the affected tables. Because the ordering is performed programmatically, the application developer is relieved of the burden of attempting to structure the application in a manner that avoids violating the referential integrity constraints. The efficiency of modifying the database increases significantly using this technique. The ordering may be performed at a database engine. Existing applications may take advantage of this ordering technique, without requiring change to the application itself. Batch-mode write operations are possible when using this technique, thereby reducing the number of network round-trips that must be performed.
    • 一种方法,系统和计算机程序产品,用于通过根据为受影响的表定义的引用完整性约束自动排序操作来增加对任意关系数据库执行的操作的效率。 由于排序是以编程方式执行的,所以应用程序开发人员避免了以避免违反参照完整性约束的方式尝试构建应用程序的负担。 使用这种技术,修改数据库的效率显着增加。 可以在数据库引擎执行排序。 现有应用可以利用这种排序技术,而不需要改变应用本身。 使用这种技术时,可以进行批量写入操作,从而减少必须执行的网络往返次数。