Binrank: Scaling dynamic authority-based search using materialized subgraphs

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 66-77

  Hwang, Heasoo ^a   Balmin, Andrey ^b   Reinwald, Berthold ^b   Nijkamp, Erik ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c IBM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CO-OCCURRENCE; DATA GRAPH; DATA SETS; EXPERIMENTAL EVALUATION; HIGH QUALITY; HYBRID APPROACH; ITERATIVE COMPUTATION; KEYWORD QUERIES; KEYWORD SEARCH; LARGE GRAPHS; MATERIALIZED VIEW; ORDERS OF MAGNITUDE; PAGERANK; QUERY EXECUTION TIME; QUERY TIME; RANDOM WALK; SEARCH RESULTS; SEARCH SYSTEM; SEMANTIC LINK; STATE OF THE ART; STORAGE REQUIREMENTS; SUBGRAPHS; WIKIPEDIA;

LEARNING ALGORITHMS;

GRAPH THEORY;

EID: 67649643455     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.94     Document Type: Conference Paper

References (15)

1. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Computer Networks, vol. 30, no. 1-7, pp. 107-117, 1998.
2. T. H. Haveliwala, "Topic-sensitive pagerank," in Proceedings of the Eleventh International World Wide Web Conference, Honolulu, Hawaii, May 2002. [Online]. Available: citeseer.ist.psu.edu/haveliwala02topicsensitive. html
3. G. Jeh and J. Widom, "Scaling personalized web search," in WWW, 2003.
4. D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós, "Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments," Internet Mathematics, vol. 2, no. 3, pp. 333-358, 2005.
5. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, "Monte carlo methods in pagerank computation: When one iteration is sufficient," SIAM J. Numer. Anal., vol. 45, no. 2, pp. 890-904, 2007.
6. A. Balmin, V. Hristidis, and Y. Papakonstantinou, "Objectrank: Authority-based keyword search in databases," in VLDB, 2004.
7. Z. Nie, Y. Zhang, J.-R. Wen, and W.-Y. Ma, "Object-level ranking: bringing order to web objects," in WWW, 2005, pp. 567-574.
8. S. Chakrabarti, "Dynamic personalized pagerank in entity-relation graphs," in WWW, 2007.
9. H. Hwang, A. Balmin, H. Pirahesh, and B. Reinwald, "Information discovery in loosely integrated data," in SIGMOD, 2007.
10. V. Hristidis, H. Hwang, and Y. Papakonstantinou, "Authority-based keyword search in databases," ACM Trans. Database Syst., vol. 33, no. 1, 2008.
11. M. Kendall, Rank Correlation Methods. NewYork: Hafner Publishing Co., 1955.
12. M. R. Garey and D. S. Johnson, "A 71/60 theorem for bin packing," Journal of Complexity, vol. 1, p. 65106, 1985.
13. K. S. Beyer, P. J. Haas, B. Reinwald, Y. Sismanis, and R. Gemulla, "On synopses for distinct-value estimation under multiset operations," in SIGMOD Conference, 2007, pp. 199-210.
14. J. T. Bradley, D. V. de Jager, W. J. Knottenbelt, and A. Trifunovic, "Hypergraph partitioning for faster parallel pagerank computation," in EPEW/WS-FM, 2005, pp. 155-171.
15. J. Cho and U. Schonfeld, "Rankmass crawler: A crawler with high pagerank coverage guarantee," in VLDB, 2007.