Efficiently ranking web pages via matrix index manipulation...

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000

Reexamination Certificate

active

07379947

ABSTRACT:
Methods and systems are described for computing page rankings more efficiently. Using an interconnectivity matrix describing the interconnection of web pages, a new matrix is computed. The new matrix is used to compute the average of values associated with each web page's neighboring web pages. The secondary eigenvector of this new matrix is computed, and indices for web pages are relabeled according to the eigenvector. The data structure storing the interconnectivity information is preferably also physically sorted according to the eigenvector. By reorganizing the matrix used in the web page ranking computations, caching is performed more efficiently, resulting in faster page ranking techniques. Methods for efficiently allocating the distribution of resources are also described.

REFERENCES:
patent: 5488723 (1996-01-01), Baradel et al.
patent: 5726987 (1998-03-01), Uriu et al.
patent: 6055418 (2000-04-01), Harris et al.
patent: 6122628 (2000-09-01), Castelli et al.
patent: 6126330 (2000-10-01), Knight
patent: 6198390 (2001-03-01), Schlager et al.
patent: 6216237 (2001-04-01), Klemm et al.
patent: 6285999 (2001-09-01), Page
patent: 6295643 (2001-09-01), Brown et al.
patent: 6324619 (2001-11-01), Raverdy et al.
patent: 6466980 (2002-10-01), Lumelsky et al.
patent: 6473791 (2002-10-01), Al-Ghosein et al.
patent: 6631409 (2003-10-01), Watson et al.
patent: 2003/0037074 (2003-02-01), Dwork et al.
patent: 2004/0111412 (2004-06-01), Broder
patent: 2004/0122855 (2004-06-01), Ruvolo et al.
Solomon et al., Inside Microsoft Windows 2000 Third Edition, Microsoft Press, 2000, pp. 265-275.
Maston, Michael, “Managing Windows with WMI,” Microsoft Corporation, http://msdn.microsoft.com/library/techart/mngwmi.htm, Nov. 1999, pp. 1-14.
Snodgrass, Richard, “A Relational Approach to Monitoring Complex Systems,” ACM Transactions on Computer Systems, vol. 6, No. 2, May 1988, pp. 157-196.
Joyce et al., “Monitoring Distributed Systems,” ACM Transactions on Computer Systems, vol. 5, No. 2, May 1987, pp. 121-150.
Hollingsworth et al., “Dynamic Control of Performance Monitoring on Large Scale Parallel Systems,” Proceedings of the 1993 International Conference on Supercomputing, 1993, pp. 185-194.
Agrawal et al., “OdeView: The Graphical Interface to Ode,” Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990, pp. 34-43.
Shende et al., “Portable Profiling and Tracing for Parallel, Scientific Applications Using C++,” Proceedings of the SIGMetrics Symposium on Parallel and Distributed Tools, 1998, pp. 134-145.
Bruegge et al., “A Framework for Dynamic Program Analyzers,” Proceedings of the Eighth Annual Conference on Object-oriented Programming Systems, Languages, and Applications, 1993, pp. 65-82.
S. T. Barnard, A. Pothen and H .D. Simon, “A spectral algorithm for envelope reduction of sparse matrices”, Numerical Linear Algebra with Applications, 2, pp. 317—334, 1995.
Page, Lawrence; Brin, Sergey; Motwani, Rajeev; Winograd, Terry. “The PageRank Citation Ranking: Bringing Order to the Web”, Nov. 1999, http://dbpubs.stanford.edu/pub/1999-66.
Kamvar, S.D. et al., “Extrapolation Methods for Accelerating PageRank Computations”,Proceedings of the 12thInternational World Wide Web Conference, 2003, 10 pages, XP-002343504.
Page, L. et al., “The PageRank Citation Ranking: Bringing Order to the Web”,Stanford Digital Libraries Working Paper, 1998, 1-17, XP-002951571.
Wang, Z. et al., “Improved Link-Based Algorithms for Ranking Web Pages”, www.cs.nyu.edu/csweb/research/TechReports, 2003, 10 pages, XP-002343499.
Zack, M.H., “Researching Organiational Systems Using Social Network Analysis”,Proceedings of the Hawaii International Conference on System Sciences, 2000, 1-7, XP 002205850.
Das, T.K. et al., “NetEffect: A Network Architecture for Large-scale Multi-user Virtual Worlds”,ACM Symposium on Virtual Reality Software and Technology, 1997, 157-163, XP 002365917.

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

Efficiently ranking web pages via matrix index manipulation... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficiently ranking web pages via matrix index manipulation..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently ranking web pages via matrix index manipulation... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3984532

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