Black Box for Constant-Time Insertion in Priority Queues (Note)

ACM Transactions on Algorithms

Volumn 1, Issue 1, 2005, Pages 102-106

  Alstrup, Stephen ^a   Rauhe, Theis ^a   Husfeldt, Thore ^b   Thorup, Mikkel ^c  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b LUND UNIVERSITY   (Sweden)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithms; Priority queues; Shortest paths; Theory

Indexed keywords

EID: 33846640936     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1077464.1077471     Document Type: Article

References (61)

1. Aho, A., Hopcroft, J., and Ullman, J. 1983. Data Structures and Algorithms. Addison-Wesley, Reading, MA.
2. Albert, R., Barabasi, A.-L., and Jeong, H. 1999. Diameter of the World Wide Web. Nature 401, 6749 (Sept.).
3. Amento, B., Terveen, L., and Hill, W. 2000. Does authority mean quality? Predicting expert quality ratings of web documents. In Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM Press, New York, NY.
4. Anh, V. N. and Moffat, A. 1998. Compressed inverted files with reduced decoding overheads. In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'98, Melbourne, Australia, Aug. 24-28).
5. W. B. Croft, A. Moffat, C. J. van Rijsbergen, R. Wilkinson, and J. Zobel, Chairs. ACM Press, New York, NY, 290-297.
6. Bar-Yossef, Z., Berg, A., Chien, S., and Weitz, J. F. D. 2000. Approximating aggregate queries about web pages via random walks. In Proceedings of the 26th International Conference on Very Large Data Bases.
7. Barabasi, A.-L. and Albert, R. 1999. Emergence of scaling in random networks. Science 286, 5439 (Oct.), 509-512.
8. Bharat, K. and Broder, A. 1999. Mirror, mirror on the web: A study of host pairs with replicated content. In Proceedings of the Eighth International Conference on the WorldWide Web.
9. Bharat, K., Broder, A., Henzinger, M., Kumar, P., and Venkatasubramanian, S. 1998. The connectivity server: fast access to linkage information on the Web. Comput. Netw. ISDN Syst. 30, 1-7, 469-477.
10. Brin, S. 1998. Extracting patterns and relations from the world wide web. In Proceedings of the Sixth International Conference on Extending Database Technology (Valencia, Spain, Mar.), H.-J. Schek, F. Saltor, I. Ramos, and G. Alonso, Eds.
11. Brin, S. and Page, L. 1998. The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30, 1-7, 107-117.
12. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., and Wiener, J. 2000. Graph structure in the web: experiments and models. In Proceedings of the Ninth International Conference on the World Wide Web.
13. Chakrabarti, S., Dom, B., Gibson, D., Kumar, S. R., Raghavan, P., Rajagopalan, S., and Tomkins, A. 1998a. Spectral filtering for resource discovery. In Proceedings of the ACM SIGIR Workshop on Hypertext Information Retrieval on the Web (Melbourne, Australia). ACM Press, New York, NY.
14. Chakrabarti, S., Dom, B., and Indyk, P. 1998b. Enhanced hypertext categorization using hyperlinks. SIGMOD Rec. 27, 2, 307-318.
15. Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., and Kleinberg, J. 1998c. Automatic resource compilation by analyzing hyperlink structure and associated text. In Proceedings of the Seventh International Conference on the World Wide Web (WWW7, Brisbane, Australia, Apr. 14-18).
16. P. H. Enslow and A. Ellis, Eds. Elsevier Sci. Pub. B. V., Amsterdam, the Netherlands, 65-74.
17. Chakrabarti, S. and Muthukrishnan, S. 1996. Resource scheduling for parallel database and scientific applications. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'96, Padua, Italy, June 24-26).
18. G. E. Blelloch, Chair. ACM Press, New York, NY, 329-335.
19. Chakrabarti, S., van den Berg, M., and Dom, B. 1999. Focused crawling: A new approach to topic-specific web resource discovery. In Proceedings of the Eighth International Conference on the World-Wide Web.
20. Cho, J. and Garcia-Molina, H. 2000a. Estimating frequency of change. Submitted for publication.
21. Cho, J. and Garcia-Molina, H. 2000b. The evolution of the web and implications for an incremental crawler. In Proceedings of the 26th International Conference on Very Large Data Bases.
22. Cho, J. and Garcia-Molina, H. 2000c. Synchronizing a database to improve freshness. In Proceedings of the ACM SIGMOD Conference on Management of Data (SIGMOD'2000, Dallas, TX, May). ACM Press, New York, NY.
23. Cho, J., Garcia-Molina, H., and Page, L. 1998. Efficient crawling through URL ordering. Comput. Netw. ISDN Syst. 30, 1-7, 161-172.
24. Coffman, E. J., Liu, Z., and Weber, R. R. 1997. Optimal robot scheduling for web search engines. Tech. Rep. INRIA, Rennes, France.
25. Dean, J. and Henzinger, M. R. 1999. Finding related pages in the world wide web. In Proceedings of the Eighth International Conference on the World-Wide Web.
26. Diligenti, M., Coetzee, F. M., Lawrence, S., Giles, C. L., and Gori, M. 2000. Focused crawling using context graphs. In Proceedings of the 26th International Conference on Very Large Data Bases.
27. Douglis, F., Feldmann, A., and Krishnamurthy, B. 1999. Rate of change and other metrics: a live study of the world wide web. In Proceedings of the USENIX Symposium on Internetworking Technologies and Systems. USENIX Assoc., Berkeley, CA.
28. Dumais, S. T., Furnas, G. W., Landauer, T. K., Deerwester, S., and Harshman, R. 1988. Using latent semantic analysis to improve access to textual information. In Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI'88, Washington, DC, May 15-19).
29. J. J. O'hare, Ed. ACM Press, New York, NY, 281-285.
30. Egghe, L. and Rousseau, R. 1990. Introduction to Informetrics. Elsevier Science Inc., New York, NY.
31. Faloutsos, C. 1985. Access methods for text. ACM Comput. Surv. 17, 1 (Mar.), 49-74.
32. Faloutsos, C. and Christodoulakis, S. 1984. Signature files: An access method for documents and its analytical performance evaluation. ACM Trans. Inf. Syst. 2, 4 (Oct.), 267-288.
33. Garfield, E. 1972. Citation analysis as a tool in journal evaluation. Science 178, 471-479.
34. Gibson, D., Kleinberg, J., and Raghavan, P. 1998. Inferring Web communities from link topology. In Proceedings of the 9th ACM Conference on Hypertext and Hypermedia: Links, Objects, Time and Space—Structure in Hypermedia Systems (HYPERTEXT'98, Pittsburgh, PA, June 20-24), R. Akscyn, Chair. ACM Press, New York, NY, 225-234.
35. Golub, G. and Van Loan, C. F. 1989. Matrix Computations. 2nd ed. Johns Hopkins University Press, Baltimore, MD.
36. Haveliwala, T. 1999. Efficient computation of pagerank. Tech. Rep. 1999-31. Computer Systems Laboratory, Stanford University, Stanford, CA. http://dbpubs.stanford.edu/pub/1999-31.
37. Hawking, D., Craswell, N., and Thistlewaite, P. 1998. Overview of TREC-7 very large collection track. In Proceedings of the 7th Conference on Text Retrieval (TREC-7).
38. Hirai, J., Raghavan, S., Garcia-Molina, H., and Paepcke, A. 2000. Webbase: A repository of web pages. In Proceedings of the Ninth International Conference on the World Wide Web. 277-293.
39. Huberman, B. A. and Adamic, L. A. 1999. Growth dynamics of the world wide web. Nature 401, 6749 (Sept.).
40. Kleinberg, J. 1999. Authoritative sources in a hyperlinked environment. J. ACM 46, 6 (Nov.).
41. Koster, M. 1995. Robots in the web: trick or treat? ConneXions 9, 4 (Apr.).
42. Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A. 1999. Trawling the web for emerging cyber-communities. In Proceedings of the Eighth International Conference on the World-Wide Web.
43. Lawrence, S. and Giles, C. 1998. Searching the world wide web. Science 280, 98-100.
44. Lawrence, S. and Giles, C. 1999. Accessibility of information on the web. Nature 400, 107-109.
45. Manber, U. and Myers, G. 1993. Suffix arrays: a new method for online string searches. SIAM J. Comput. 22, 5 (Oct.), 935-948.
46. MacLeod, I. A., Martin, P., and Nordin, B. 1986. A design of a distributed full text retrieval system. In Proceedings of 1986 ACM Conference on Research and Development in Information Retrieval (SIGIR'86, Palazzo dei Congressi, Pisa, Italy, Sept. 8—10).
47. F. Rabitti, Ed. ACM Press, New York, NY, 131-137.
48. Melnik, S., Raghavan, S., Yang, B., and Garcia-Molina, H. 2000. Building a distributed full-text index for the web. Tech. Rep. SIDL-WP-2000-0140, Stanford Digital Library Project. Computer Systems Laboratory, Stanford University, Stanford, CA. http://www-diglib.stanford.edu/cgi-bin/get/SIDL-WP-2000-0140.
49. Melnik, S., Raghavan, S., Yang, B., and Garcia-Molina, H. 2001. Building a distributed full-text index for the web. In Proceedings of the Tenth International Conference on the World-Wide Web.
50. Moffat, A. and Bell, T. A. H. 1995. In situ generation of compressed inverted files. J. Am. Soc. Inf. Sci. 46, 7 (Aug.), 537-550.
51. Motwani, R. and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press, New York, NY.
52. Page, L., Brin, S., Motwani, R., and Winograd, T. 1998. The pagerank citation ranking: Bringing order to the web. Tech. Rep. Computer Systems Laboratory, Stanford University, Stanford, CA.
53. Pinski, G. and Narin, F. 1976. Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics. Inf. Process. Manage. 12.
54. Pitkow, J. and Pirolli, P. 1997. Life, death, and lawfulness on the electronic frontier. In Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI'97, Atlanta, GA, Mar. 22-27), S. Pemberton, Ed. ACM Press, New York, NY, 383-390.
55. Ribeiro-Neto, B. A. and Barbosa, R. A. 1998. Query performance for tightly coupled distributed digital libraries. In Proceedings of the Third ACM Conference on Digital Libraries (DL'98, Pittsburgh, PA, June 23-26), I. Witten, R. Akscyn, and F. M. Shipman, Eds. ACM Press, New York, NY, 182-190.
56. Robots Exclusion Protocol. 2000. Robots Exclusion Protocol. http://info.webcrawler.com/mak/projects/robots/exclusion.html.
57. Salton, G., Ed. 1988. Automatic Text Processing. Addison-Wesley Series in Computer Science. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
58. Tomasic, A. and Garcia-Molina, H. 1993. Performance of inverted indices in distributed text document retrieval systems. In Proceedings of the 2nd International Conference on Parallel and Distributed Systems (Dec.). 8-17.
59. Viles, C. L. and French, J. C. 1995. Dissemination of collection wide information in a distributed information retrieval system. In Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'95, Seattle, WA, July 9-13), E. A. Fox, P. Ingwersen, and R. Fidel, Eds. ACM Press, New York, NY, 12-20.
60. Wills, C. E. and Mikhailov, M. 1999. Towards a better understanding of web resources and server responses for improved caching. In Proceedings of the Eighth International Conference on the World-Wide Web.
61. Witten, I., Moffat, A., and Bell, T. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images. 2nd ed. Morgan Kaufmann Publishers Inc., San Francisco, CA.