公开(公告)号：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.

摘要翻译： 本发明的实施例提供了一种用于数据库工作负载的查询视图的自动和动态管理的方法，程序存储设备等。 更具体地说，一种方法从执行查询开始，包括访问每个查询的一组数据表。 在执行查询期间，如果缓存中存在所需的数据表，则该方法将从缓存中访问所需的数据表，并且如果缓存中不存在所需的数据表，则创建所需的数据表。 从缓存中访问所需数据表的处理成本比从基表访问所需数据表的处理成本要低。 此外，在执行查询期间，创建的数据表存储在高速缓存中，其中当高速缓存变满时，从高速缓存中删除一个或多个所创建的数据表。

公开(公告)号：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。 在另一个实施例中，执行每个节点，实现具有与公共数据库匹配的模式的空数据库实例，使用空数据库识别查询中的相关分区，以及将查询路由到相应的分区数据库实例。

公开(公告)号：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.

摘要翻译： 公开了用于在联合信息系统中优化查询处理的系统的实施例。 该系统可以用于在模拟环境中识别替代查询计划，并且不仅基于数据库统计信息和查询语句，而且还基于与特定数据源相关联的工作负载和处理延迟来计算与替代查询计划相关联的成本估计，以及 联合信息系统作为一个整体。 此外，计算的成本估算也可能导致数据源的可用性和可靠性。 系统可以使用替代查询计划和相关联的成本估计来影响联合信息系统中的查询处理，通过馈送给联合信息系统查询计划，允许具有成本效益的查询计划级负载分布，成本效益查询分段计划 - 基于服务质量成本限制的负载分布和负载分配。

公开(公告)号：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.

公开(公告)号：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.

公开(公告)号：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和数据库查询映射。

公开(公告)号：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传送给至少一个代理服务器。

公开(公告)号：US10055776B2

公开(公告)日：2018-08-21

申请号：US13959049

申请日：2013-08-05

申请人： Philippe Nemery ,  Wen-Syan Li

发明人： Philippe Nemery ,  Wen-Syan Li

IPC分类号： G06Q30/00 ,  G06Q30/06

CPC分类号： G06Q30/0631 ,  G06Q30/0601 ,  G06Q30/0623 ,  G06Q30/0629 ,  G06Q30/0641

摘要： The embodiments provide a system for decision-making criteria-based recommendations. The system may include a decision engine configured to receive a request for recommendations for an option problem associated with a product or service category, and determine options among a plurality of options for the product or service category based on preference information. The preference information may include activated decision-making criteria and corresponding weight values. The corresponding weight values may represent a relative importance of each activated decision-making criterion. The decision engine may be configured to determine options among the plurality of options including calculating scores for the plurality of options based on, in part, the activated decision-making criteria and the corresponding weight values and selecting the options among the plurality of options based on the calculated scores. The decision engine may be configured to provide a display of the determined options as the recommendations for the product or service category.

公开(公告)号：US10031517B2

公开(公告)日：2018-07-24

申请号：US14043415

申请日：2013-10-01

申请人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

发明人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

IPC分类号： G05B19/418

摘要： In accordance with aspects of the disclosure, systems and methods are provided for managing production resources including scheduling production events for production resources used to manufacture products relative to time intervals while maintaining collaboration among the production resources. The systems and methods may include retrieving information related to each production resource, evaluating each production event for each product to determine a sequence of the production events, and generating potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. The systems and methods may include generating a production schedule for the production events within the time intervals based on the potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources.

公开(公告)号：US09984544B2

公开(公告)日：2018-05-29

申请号：US14624241

申请日：2015-02-17

申请人： Mengjiao Wang ,  Wen-Syan Li

发明人： Mengjiao Wang ,  Wen-Syan Li

IPC分类号： H04N7/18 ,  G08B13/196

CPC分类号： G08B13/19645 ,  G08B13/1968 ,  G08B29/18 ,  H04N7/181

摘要： A candidate position selector determines locations for M candidate positions along pathways within an area defining potential routes for moving objects within the area. A coverage rate calculator calculates a coverage rate for a device layout of N media capture devices among the M candidate positions, including calculating the coverage rate as a ratio of the moving objects captured by the N media capture devices in the device layout to a total number of the moving objects in the area within a defined period of time. A layout selector iteratively tests different device layouts of the N media capture devices among the M candidate positions, based on corresponding coverage rates calculated by the coverage rate calculator for each tested device layout, until a termination condition is reached and a final device layout of the tested device layouts is selected.