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

41. 发明授权

US07716214B2 Automated and dynamic management of query views for database workloads 有权
标题翻译：自动和动态地管理数据库工作负载的查询视图
公开(公告)号：US07716214B2
公开(公告)日：2010-05-11
申请号：US12055461
申请日：2008-03-26
申请人： Wen-Syan Li , Thomas Phan
发明人： Wen-Syan Li , Thomas Phan
IPC分类号： G06F7/00
CPC分类号： G06F17/30457 , G06F17/30312 , G06F17/3046
摘要： The embodiments of the invention provide a method, program storage device, etc. for automated and dynamic management of query views for database workloads. More specifically, a method begins by executing queries, which includes accessing a set of data tables for each of the queries. During the executing of the queries, the method accesses a required data table from a cache if the required data table is present in the cache and creates the required data table if the required data table is not present in the cache. The accessing of the required data table from the cache has a lower processing cost than accessing the required data table from a base table. Also during the executing of the queries, created data tables are stored in the cache, wherein one or more of the created data tables are removed from the cache when the cache becomes full.
摘要翻译：本发明的实施例提供了一种用于数据库工作负载的查询视图的自动和动态管理的方法，程序存储设备等。更具体地说，一种方法从执行查询开始，包括访问每个查询的一组数据表。在执行查询期间，如果缓存中存在所需的数据表，则该方法将从缓存中访问所需的数据表，并且如果缓存中不存在所需的数据表，则创建所需的数据表。从缓存中访问所需数据表的处理成本比从基表访问所需数据表的处理成本要低。此外，在执行查询期间，创建的数据表存储在高速缓存中，其中当高速缓存变满时，从高速缓存中删除一个或多个所创建的数据表。

42. 发明申请

US20090177697A1 CORRELATION AND PARALLELISM AWARE MATERIALIZED VIEW RECOMMENDATION FOR HETEROGENEOUS, DISTRIBUTED DATABASE SYSTEMS 审中-公开
标题翻译：相关和并行的意见为异构，分布式数据库系统提供资源化视图建议
公开(公告)号：US20090177697A1
公开(公告)日：2009-07-09
申请号：US11970966
申请日：2008-01-08
申请人： Dengfeng Gao , Haifeng Jiang , Wen-Syan Li
发明人： Dengfeng Gao , Haifeng Jiang , Wen-Syan Li
IPC分类号： G06F17/30
CPC分类号： G06F16/24539 , G06F16/2471
摘要： A method is provided for generating a materialized view recommendation for at least one back-end server that is connected to a front-end server in a heterogeneous, distributed database system that comprises parsing a workload of federated queries to generate a plurality of query fragments; invoking a materialized view advisor on each back-end server with the plurality of query fragments to generate a set of candidate materialized views for each of the plurality of query fragments; identifying a first set of subsets corresponding to all nonempty subsets of the set of candidate materialized views for each of the plurality of query fragments; identifying a second set of subsets corresponding to all subsets of the first set of subsets that are sorted according to a dominance relationship based upon a resource time for the at least one back-end server to provide results to the front-end server for each of the first set of subsets; and performing a cost-benefit analysis of each of the second set of subsets to determine a recommended subset of materialized views that minimizes a total resource time for running the workload against the at least one back-end server.
摘要翻译：提供了一种用于生成连接到异构分布式数据库系统中的前端服务器的至少一个后端服务器的物化视图推荐的方法，该系统包括解析联合查询的工作负载以生成多个查询片段; 使用所述多个查询片段在每个后端服务器上调用物化视图顾问以为所述多个查询片段中的每一个产生一组候选物化视图; 识别与所述多个查询片段中的每一个的候选物化视图集合的所有非空子集对应的第一组子集; 基于所述至少一个后端服务器的资源时间，根据所述优势关系对与所述第一组子集合的所有子集相对应的第二集合进行识别，所述子集的第二集合对于前端服务器为每个子集提供结果第一组子集; 以及对所述第二组子集执行成本效益分析，以确定物化视图的推荐子集，其使针对所述至少一个后端服务器运行所述工作负载的总资源时间最小化。

43. 发明申请

US20080183667A1 AUTOMATED AND DYNAMIC MANAGEMENT OF QUERY VIEWS FOR DATABASE WORKLOADS 有权
标题翻译：自动化和动态管理数据库工作查询查询
公开(公告)号：US20080183667A1
公开(公告)日：2008-07-31
申请号：US12055461
申请日：2008-03-26
申请人： Wen-Syan Li , Thomas Phan
发明人： Wen-Syan Li , Thomas Phan
IPC分类号： G06F7/10 , G06F17/30
CPC分类号： G06F17/30457 , G06F17/30312 , G06F17/3046
摘要： The embodiments of the invention provide a method, program storage device, etc. for automated and dynamic management of query views for database workloads. More specifically, a method begins by executing queries, which includes accessing a set of data tables for each of the queries. During the executing of the queries, the method accesses a required data table from a cache if the required data table is present in the cache and creates the required data table if the required data table is not present in the cache. The accessing of the required data table from the cache has a lower processing cost than accessing the required data table from a base table. Also during the executing of the queries, created data tables are stored in the cache, wherein one or more of the created data tables are removed from the cache when the cache becomes full.
摘要翻译：本发明的实施例提供了一种用于数据库工作负载的查询视图的自动和动态管理的方法，程序存储设备等。更具体地说，一种方法从执行查询开始，包括访问每个查询的一组数据表。在执行查询期间，如果缓存中存在所需的数据表，则该方法将从缓存中访问所需的数据表，并且如果缓存中不存在所需的数据表，则创建所需的数据表。从缓存中访问所需数据表的处理成本比从基表访问所需数据表的处理成本要低。此外，在执行查询期间，创建的数据表存储在高速缓存中，其中当高速缓存变满时，从高速缓存中删除一个或多个所创建的数据表。

44. 发明申请

US20070203944A1 Web services database cluster architecture 有权
标题翻译： Web服务数据库集群架构
公开(公告)号：US20070203944A1
公开(公告)日：2007-08-30
申请号：US11364710
申请日：2006-02-28
申请人： Vishal Batra , Wen-Syan Li
发明人： Vishal Batra , Wen-Syan Li
IPC分类号： G06F17/00
CPC分类号： G06F17/30575
摘要： There is disclosed configuring of clustered web services nodes accessing a common database, including implementing a data virtualization layer at each node to abstract an instance of the database from a web service application. In one embodiment, at each node is performed creating a first, data virtualization entity bean having all read and write operations of an application-developed (master) entity bean, creating a second entity bean that carries only the read operations of the master entity bean and addresses the replica instance, receiving an operation request at the first entity bean, and routing a request to either the master entity bean or the second entity bean depending upon the requested operation to access the respective database instance. In another embodiment, at each node is performed implementing an empty database instance having a schema matching the common database, identifying a relevant partitioning in a query utilizing the empty database, and routing the query to a respective partitioned database instance.
摘要翻译：公开了对访问公共数据库的集群web服务节点的配置，包括在每个节点处实现数据虚拟化层以从Web服务应用抽象数据库的实例。在一个实施例中，执行每个节点，创建具有应用开发（主）实体bean的所有读取和写入操作的第一个数据虚拟化实体bean，从而创建仅承载主实体bean的读取操作的第二实体bean 并且寻址副本实例，在第一实体bean处接收操作请求，并且根据所请求的访问相应数据库实例的操作将请求路由到主实体bean或第二实体bean。在另一个实施例中，执行每个节点，实现具有与公共数据库匹配的模式的空数据库实例，使用空数据库识别查询中的相关分区，以及将查询路由到相应的分区数据库实例。

45. 发明申请

US20070050328A1 Query routing of federated information systems for fast response time, load balance, availability, and reliability 失效
标题翻译：查询联合信息系统的路由，以实现快速响应时间，负载平衡，可用性和可靠性
公开(公告)号：US20070050328A1
公开(公告)日：2007-03-01
申请号：US11214082
申请日：2005-08-29
申请人： Wen-Syan Li , Inderpal Narang
发明人： Wen-Syan Li , Inderpal Narang
IPC分类号： G06F17/30
CPC分类号： G06F17/30967 , Y10S707/99932
摘要： Disclosed are embodiments of a system for optimizing query processing in a federated information system. The system may be used to identify alternative query plans in a simulated environment and to calculate cost estimates associated with the alternative query plans, based not only on database statistics and query statements, but also based on workload and processing latencies associated with specific data source and with the federated information system as a whole. In addition the calculated cost estimates may also factor in data source availability and reliability. The system may use the alternative query plans and the associated cost estimates to influence query processing in a federated information system by feeding to the federated information system query plans that allow for cost-efficient query plan-level load distribution, cost-efficient query fragment plan-level load distribution, and load distribution based upon quality of service cost constraints.
摘要翻译：公开了用于在联合信息系统中优化查询处理的系统的实施例。该系统可以用于在模拟环境中识别替代查询计划，并且不仅基于数据库统计信息和查询语句，而且还基于与特定数据源相关联的工作负载和处理延迟来计算与替代查询计划相关联的成本估计，以及联合信息系统作为一个整体。此外，计算的成本估算也可能导致数据源的可用性和可靠性。系统可以使用替代查询计划和相关联的成本估计来影响联合信息系统中的查询处理，通过馈送给联合信息系统查询计划，允许具有成本效益的查询计划级负载分布，成本效益查询分段计划 - 基于服务质量成本限制的负载分布和负载分配。

46. 发明授权

US07054931B1 System and method for intelligent load distribution to minimize response time for web content access 有权
公开(公告)号：US07054931B1
公开(公告)日：2006-05-30
申请号：US09703121
申请日：2000-10-31
申请人： Kasim Selcuk Candan , Wen-Syan Li
发明人： Kasim Selcuk Candan , Wen-Syan Li
IPC分类号： G06F15/173
CPC分类号： H04L67/1008 , H04L67/1002 , H04L67/101 , H04L67/1012 , H04L67/1021 , H04L67/1023 , H04L67/1029
摘要： A content delivery system having m servers, S′={S1, . . . ,Sm}, n active customers, C′={C1, . . . , Cn}, and g geographic locations, G′={G1, . . . , Gg} is disclosed, wherein sdelk is a server delay of server Sk, ndelj,k is a network delay observed by customers in geographic location Gj while retrieving content from server Sk, pj is a priority value for customer Ci, ci is a total load of customer Cii, ui,j is a fraction of requests coming to customer Ci from region Gj, ai,j,k is a mapping representing a fraction of requests coming to customer Ci from region Gj that have been redirected to server Sk, and sk represents a load capacity of server Sk. Within such a system, a method for distributing server loads includes the steps of representing an average prioritized observed response time as AORT = ∑ i = 1 n ⁢ ∑ j = 1 g ⁢ ∑ k = 1 m ⁢ a i , j , k × u i , j × c i × p i × ( sdel k + ndel j , k ) ∑ i = 1 n ⁢ c i × p i , and then generating a mapping that assigns requests from customers to a particular server while minimizing AORT. A heuristic algorithm is used to generate the mapping, wherein large ai,j,k values are assigned to small ui,j×ci×(sdelk+ndelj,k) values to produce a smaller overall AORT value.

47. 发明授权

US06889234B1 System and methods for invalidation to enable caching of dynamically generated content 失效
公开(公告)号：US06889234B1
公开(公告)日：2005-05-03
申请号：US10084630
申请日：2002-02-26
申请人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
发明人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
IPC分类号： G06F17/30
CPC分类号： G06F17/3056 , G06F17/30345 , G06F17/30368 , Y10S707/959 , Y10S707/99932 , Y10S707/99952 , Y10S707/99954
摘要： Various systems and methods are describe for determining dynamically generated content to be invalidated as a result of changes to underlying data. In one method, invalidation processing is performed using a delayed version of the database that reflects the state of the database at the beginning of a preceding processing cycle, and an update log that reflects all updates since the beginning of the preceding processing cycle. In another method, invalidation processing is performed by locking a database which is locked during processing so as to reflect the state of the database at the beginning of processing, and an update log that reflects all updates to the database since the beginning of the preceding processing cycle. In another method, invalidation processing uses the database while it is freely updated during said processing, and the update log of the database.

48. 发明授权

US06748386B1 System and method for automated construction of URL, cookie, and database query mapping 失效
标题翻译：自动构建URL，cookie和数据库查询映射的系统和方法
公开(公告)号：US06748386B1
公开(公告)日：2004-06-08
申请号：US09851709
申请日：2001-05-08
申请人： Wen-Syan Li
发明人： Wen-Syan Li
IPC分类号： G06F1730
CPC分类号： G06F17/30876 , Y10S707/99945
摘要： A method for constructing a URL, cookie, and database query mapping is disclosed. The method is employed within a content delivery system comprising a Web server, an application server and a database management system (DBMS), wherein the Web server is coupled for receiving a URL request destined for an original servlet in the Web server. The method comprises redirecting the URL request to a wrapper servlet, which includes statements for extracting the URL string and cookie information, and assigning a job identification system variable containing the URL string and cookie information to the redirected URL request. The redirected URL request is then forwarded to the original servlet in the form of an HttpServletRequest. The HttpServletRequest is then communicated to the application server, which issues at least one query destined for an original database connection API the DBMS. The at least one query includes the job identification system. The query is then redirected to a wrapper database connection API within the DBMS, which includes statements for recovering the URL string and cookie information from the at least one query and constructing a URL, cookie, and database query mapping.
摘要翻译：公开了一种构建URL，cookie和数据库查询映射的方法。该方法在包括Web服务器，应用服务器和数据库管理系统（DBMS）的内容递送系统内采用，其中，所述Web服务器被耦合用于接收目的地是Web服务器中的原始servlet的URL请求。该方法包括将URL请求重定向到包装器servlet，其包括用于提取URL字符串和cookie信息的语句，以及将包含URL字符串和cookie信息的作业识别系统变量分配给重定向的URL请求。然后将重定向的URL请求以HttpServletRequest的形式转发到原始的servlet。然后将HttpServletRequest传递给应用程序服务器，应用程序服务器发出至少一个发往DBMS原始数据库连接API的查询。该至少一个查询包括作业识别系统。然后将查询重定向到DBMS中的包装数据库连接API，其中包括用于从至少一个查询中恢复URL字符串和Cookie信息的语句，并构建URL，Cookie和数据库查询映射。

49. 发明授权

US06701316B1 Method and apparatus for intelligent network bandwidth and system resource utilization for web content fetch and refresh 有权
标题翻译：网络内容获取和刷新的智能网络带宽和系统资源利用的方法和装置
公开(公告)号：US06701316B1
公开(公告)日：2004-03-02
申请号：US09654106
申请日：2000-08-31
申请人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
发明人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
IPC分类号： G06F1730
CPC分类号： G06F17/30902 , Y10S707/959
摘要： A content delivery services provider is disclosed for directing the at least one proxy server to pre-fetch content from the at least one content provider original site using an optimum pre-fetch bandwidth allocation value. The content delivery services provider is part of a system for storing and delivering content, which includes a plurality of end user browsers for requesting content, at least one content provider original site for delivering the content, and at least one proxy server for storing the content. These elements are coupled over a network for communicating with each other. The content delivery services provider programmed for: (1) modeling a retrieval time of content o of size size(o) using b units of bandwidth as ret(o)=congestion×size(o)×d(b), wherein d(b) is a unit delay observed when b units of bandwidth is used for pre-fetching the content, and congestion(Util) can be represented as congestion ( Util ) = β Util θ + α + φ or congestion(Util)=&bgr;×(1.0−Util)&agr;+&phgr;; (2) modeling an amount of delay observed by the at least one proxy server for the content fetched from the at least one content provider original site at time t0 as ret ⁡ ( P ) = congestion ( P + r ⁡ ( t 0 ) B ) × r ⁡ ( t 0 ) × d , wherein P is a pre-fetch bandwidth size, B is a total bandwidth available to the system, r(t)=(1−&sgr;(P))×u(t) is an amount of bandwidth the system uses for retrieving end user browser requests for content that is not stored in the at least one proxy server, &sgr;(P) is a cache freshness and availability value given a bandwidth P, and u(t) is a user access rate; (3) calculating the optimum pre-fetch bandwidth allocation value P by solving δ ⁢ ⁢ ret ⁡ ( P ) δ ⁢ ⁢ P = 0 ; and (4) communicating the optimum pre-fetch bandwidth allocation value P to the at least one proxy server.
摘要翻译：公开了一种内容传送服务提供商，用于指导所述至少一个代理服务器使用最佳预取带宽分配值从所述至少一个内容提供商原始站点预取内容。内容传递服务提供者是用于存储和传送内容的系统的一部分，其包括用于请求内容的多个终端用户浏览器，用于递送内容的至少一个内容提供者原始站点，以及用于存储内容的至少一个代理服务器。这些元件通过网络耦合以进行通信。内容传递服务提供商编程为：（1）使用b个带宽单位对尺寸大小（o）的内容o的检索时间进行建模，如（o）= congestionxsize（o）xd（b），其中d（b）是当b个带宽单位用于预取内容时观察到的单位延迟，并且拥塞（Util）可以表示为拥塞（Util）= betax（1.0-Util）+ phi; （2）在时刻t0对从至少一个内容提供者原始站点取得的内容的至少一个代理服务器观察到的延迟量进行建模，其中P是预取带宽大小，B是可用于系统，r（t）=（1-sigma（P））xu（t）是系统用于检索最终用户浏览器对未存储在至少一个代理服务器中的内容的请求的带宽量，）是给定带宽P的缓存新鲜度和可用性值，u（t）是用户访问速率; （3）通过求解计算最佳预取带宽分配值P，并且（4）将最佳预取带宽分配值P传送给至少一个代理服务器。

50. 发明授权

US10410150B2 Efficient computerized calculation of resource reallocation scheduling schemes 有权
公开(公告)号：US10410150B2
公开(公告)日：2019-09-10
申请号：US14532330
申请日：2014-11-04
申请人： Yu Cheng , Mengjiao Wang , Wen-Syan Li
发明人： Yu Cheng , Mengjiao Wang , Wen-Syan Li
IPC分类号： G06Q10/06 , G06Q10/08
摘要： The present disclosure relates to a computer system comprising a database including, a reallocation scheduling module, the reallocation scheduling module configured to obtain an objective function including one or more integer-valued decision variables and automatically determine a proposed reallocation scheme for each of one or more items between a plurality of locations based on the objective function, wherein determining the reallocation scheme includes finding values of one or more decision variables that optimize the objective function while obeying the one or more constraints, wherein determining a proposed reallocation scheme includes solving an integer quadratic programming problem.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式