Dynamic page generation acceleration using component-level...

Electrical computers and digital processing systems: multicomput – Remote data accessing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S219000, C711S133000, C711S136000, C711S159000

Reexamination Certificate

active

07552195

ABSTRACT:
A preloader works in conjunction with a web/app server and optionally a profile server to cache web page content elements or components for faster on-demand and anticipatory dynamic web page delivery. The preloader uses a cache manager to manage requests for retrievals, insertions, and removal of web page components in a component cache. The preloader uses a cache replacement manager to manage the replacement of components in the cache. While the cache replacement manager may utilize any cache replacement policy, a particularly effective replacement policy utilizes predictive information to make replacement decisions. Such a policy uses a profile server, which predicts a user's next content request. The components that can be cached are identified by tagging them within the dynamic scripts that generate them. The preloader caches components that are likely to be accessed next, thus improving a web site's scalability.

REFERENCES:
patent: 4807111 (1989-02-01), Cohen et al.
patent: 5761717 (1998-06-01), Vishlitzky et al.
patent: 5822759 (1998-10-01), Treynor
patent: 5909695 (1999-06-01), Wong et al.
patent: 5925100 (1999-07-01), Drewry et al.
patent: 5933832 (1999-08-01), Suzuoka et al.
patent: 6023726 (2000-02-01), Saksena
patent: 6026413 (2000-02-01), Challenger et al.
patent: 6055572 (2000-04-01), Saksena
patent: 6067565 (2000-05-01), Horvitz
patent: 6085193 (2000-07-01), Malkin et al.
patent: 6085216 (2000-07-01), Huberman et al.
patent: 6085226 (2000-07-01), Horvitz
patent: 6098064 (2000-08-01), Pirolli et al.
patent: 6167438 (2000-12-01), Yates et al.
patent: 6178461 (2001-01-01), Chan et al.
patent: 6182122 (2001-01-01), Berstis
patent: 6182133 (2001-01-01), Horvitz
patent: 6191782 (2001-02-01), Mori et al.
patent: 6195622 (2001-02-01), Altschuler et al.
patent: 6216212 (2001-04-01), Challenger et al.
patent: 6219676 (2001-04-01), Reiner
patent: 6360220 (2002-03-01), Forin
patent: 6457105 (2002-09-01), Spencer et al.
patent: 6571290 (2003-05-01), Selgas et al.
patent: 6678805 (2004-01-01), Corduneanu et al.
patent: 6799251 (2004-09-01), Jacobs et al.
patent: 7058691 (2006-06-01), Yu et al.
patent: 2001/0001873 (2001-05-01), Wickeraad et al.
Sudhir G. Rao; Antonion Badia; Dirk Van Gucht: Providing Better Support for a Class of Decision Support Queries, 1996 SIGMOD-ACM; pp. 217-227 (Montreal, Canada).
Bennet Vance; David Maier; Rapid Bushy Join-order Optimization with Cartesian Products, 1996 SIGMOD-ACM; pp. 35-46 (Montreal, Canada).
Latha S. Colby, Timothy Griffin, Leonid Libkin, Inderpal Singh Mumick, Howard Trickey; Algorithms for Deferred View Maintenance, 1996 SIGMOD-ACM; pp. 469-480 (Montreal, Canada).
Piyush Goel, Bala Iyer, SQL Query Optimization: Reordering for a General Class of Queries, 1996 SIGMOd-ACM; pp. 47-56 (Montreal, Canada).
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman, Implementing Data Cubes Efficiently, 1996 SIGMOD-ACM; pp. 205-216 (Montreal, Canada).
Joseph M. Hellerstein, Jeffrey F. Naughton, Query Execution Techniques for Caching Expensive Methods, 1996 SIGMOD-ACM; pp. 423-434 (Montreal, Canada).
John T. Robinson, The K-D-B Tree; A Search Structure for Large Multidimensional Dynamic Indexes, 1981 ACM; pp. 10-18 (PA).
George P. Copeland, Setrag N. Khoshafian, A Decomposition Storage Model, 1985 ACM pp. 268-279 (Austin, Texas).
Ashish Gupta, Inderpal Singh Mumick, V.S. Subrahmanian; Maintaining Views Incrementally, 1993 SIGMOD-ACM, pp. 157-166 (Washington, D.C.).
Michael Freeston, A General Solution of the n-dimensional B-tree Problem, 1995 SIGMOD-ACM pp. 80-91 (San Jose, California).
Timothy Griffin, Leonid Libkin, Incremental Maintenance of Views with Duplicates, 1995 SIGMOD-ACM, pp. 328-339 (San Jose, California).
Yue Zhuge, Hector Garcia-Molina, Joachim Hammer, Jennifer Widom, View Maintenance in a Warehousing Environment, 1995 SIGMOD-ACM, pp. 316-327 (San Jose, California).
Ching-Tien Ho, Jehoshua Bruck, Rakesh Agrawal, Partial-Sum Queries in OLAP Data Cubes Using Covering Codes, 1997 PODS, pp. 228-238 (Tucson, Arizona).
Kjell Bratbergsengen, Hashing Methods and Relational Algebra Operations, 1984 Singapore, Proceedings of the 10th International Conference on Very Large Data Bases, pp. 323-333.
Patrick Valduriez, Setrag Khoshailan, George Copeland, Implementation Techniques of Complex Objects, 1986 Proceedings of the 12th, Kyoto International Conference on Very Large Data Bases, Austin Texas, pp. 101-110.
Masaru Kitsuregawa, Masaya Nakayama, Mikio Takagi, The Effect of Bucket Size Tuning in the Dynamic Hybrid Grace Hash Join Method, 1989 Proceedings of the 15th, Amsterdam International Conference on Very Large Data Bases, pp. 257-266.
Surajit Chaudhuri, Kyuseok Shim, Including Group-By in Query Optimization, 1994 Proceedings of the 20th VLDB Conference Santiago, Chile, pp. 354-366.
Ashish Gupta, Venky Harinarayan, Dallan Quass, Aggregate-Query Processing in Data Warehousing Environments, 1995 Proceedings of the 21st VLDB Conference (Zurich, Switzerland), pp. 358-369.
Weipeng P. Yan, Per Ake Larson, Eager Aggregation and Lazy Aggregation, 1995 Proceedings of the 21st VLBD Conference, Zurich, Switzerland, pp. 345-357.
Sameet Agarwal, Rakesh Agrawal, Prasad M. Deshpande, Ashish Gupta, Jeffrey F. Naughton, Raghu Ramakrishnan, Sunita Sarawagi, On the Computation of Multidimensional Aggregates, 1996 Proceedings of the 22nd VLDB Conference Mumbia (Bombay), India, pp. 506-521.
Damianos Chatziantoniou, Kenneth A. Ross, Querying Multiple Features of Groups In Relational Databases, 1996 Proceedings of the 22nd VLDB Conference, Mumbai (Bombay), India, pp. 295-306.
Curtis Dyreson, Information Retrieval from an Incomplete Data Cube, 1996 Proceedings of the 22nd VLDB Conference, Mumbai (Bombay), India, pp. 532-543.
Amit Shukla, Prasad M. Deshpande, Jeffrey F. Naughton, Karthikeyan Ramasamy, Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies, 1996 Proceedings of the 22nd VLDB Conference Mumbai (Bombay), India, pp. 522-531.
S. Sarawagi. Indexing OLAP data. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, pp. 1-9, 1996.
C.D. French. Teaching an OLTP database kernel advanced datawarehousing techniques. In Proc. 13th ICDE, pp. 194-198, Birmingham, UK, Apr. 7-11, 1997.
S. Khoshafian, G.P. Copeland, T. Jagodis, H. Boral, and P. Valduriez. A query processing strategy for the decomposed storage model. In Proc. ICDE, pp. 636-643, 1987.
P. O'Neil. Model 204 architecture and performance. In 2nd Intl. Workshop on High Performance Transaction Systems (HPTS), vol. 359 of Springer-Verlag Lecture Notes on Computer Science, pp. 40-59. Springer-Verlag, Asilomar, CA 1987.
P. O'Neil and G. Graefe. Multi-table joins through bitmapped join indices. SIGMOD Record, 24(3):8-11, Sep. 1995.
J.H. Chu and G. Knott. An analysis of B-trees and their variants. Information Systems, 14(5), 1989.
B. Salzberg. Access Methods. ACM Computing Surveys, 28(1): 117-120, Mar. 1996.
S. Chauduri and U. Dayal. An overview of data warehousing and OLAP technology. SIGMOD Record, 26(1):65-74, Mar. 1997.
R. Armstrong. Data warehousing: Dealing with the growing pains. In Proc. Thirteenth Intl. Conf. on Data Engineering, pp. 199-205, Birmingham, UK, Apr. 7-11, 1997. IEEE.
D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-138, Jun. 1979.
M. Spiliopoulou, M. Hatzopoulos, and Y. Cotronis. Parallel optimization of large join queries with set operators and aggregates in a parallel environment supporting pipeline. IEEE TKDE, 8(3):429-45, Jun. 1996.
S.V. Vrbsky and J.W.S. Liu. Approximate—a query processor that produces monotonically improving approximate answers. IEEE Transactions on Knowledge and Data Engineering, 5(6):1056-1068, 1993.
A. Guttman, R-trees: a dynamic index structure for spatial searching. In M. Stonebraker, editor, Readings in Database Systems, pp. 599-609. Morgan Kaufmann Publishers, Inc., San Mateo, CA 1988.
E.F. Codd, S.B. Codd and C.T. Salley. Providing OLAP (on-line analitycal processing) to user-analysts: An IT mandate. Technical report, E.F. Codd & Associates, 1993.
Y. Zhao, P.M. Deshpande, and J.F.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic page generation acceleration using component-level... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic page generation acceleration using component-level..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic page generation acceleration using component-level... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4144465

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.