A data structure for sponsored search

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 90-101

  König, Arnd Christian ^a   Church, Kenneth ^a   Markov, Martin ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOCUMENT RETRIEVAL; INDEX STRUCTURE; INVERTED FILES; INVERTED INDICES; QUERY PROCESSING ALGORITHMS; SEARCH QUERIES;

DATA STRUCTURES;

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

References (26)

1. V. Anh, O. de Kretser, and A. Moffat, "Vector-Space Ranking with Effective Early Termination," in Proceedings of the 24th annual international ACM SIGIR Conference, 2001, pp. 35-42.
2. T. Strohman and W. B. Croft, "Efficient Document Retrieval in Main Memory," in 30th ACM SIGIR International Conference, 2007, pp. 175-182.
3. A. Broder, M. Fontoura, V. Josifovski, and L. Riedel, "A Semantic Approach to Contextual Advertising," in SIGIR, 2007, pp. 559-566.
4. R. Fagin, "Combining Fuzzy Information: an Overview," SIGMOD Rec., vol. 31, no. 2, 2002.
5. http://blogs.zdnet.com/BTL/?p=3925.
6. S. Sarawagi and A. Kirpal, "Efficient Set Joins on Similarity Predicates," in ACM SIGMOD, 2004, pp. 743-754.
7. A. Arasu, V. Ganti, and R. Kaushik, "Efficient Exact Set-similarity Joins," in VLDB, 2006.
8. S. Melnik and H. Garcia-Molina, "Adaptive Algorithms for Set Containment Joins," ACM TODS, vol. 28, no. 1, pp. 56-99, 2003.
9. N. Mamoulis, "Efficient Processing of Joins on Set-valued Attributes," in ACM SIGMOD, 2003, pp. 157-168.
10. A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien, "Efficient Query Evaluation using a Two-Level Retrieval Process," in CIKM, 2003, pp. 426-434.
11. R. Baeze-Yates and B. Ribeiro-Neto, Modern Information Retrieval. ACM, 1999.
12. F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha, "Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems," ACM SIGMOD Conf., pp. 115-126, 2001.
13. C. Callison-Burch, C. Bannard, and J. Schroeder, "Scaling Phrase-based Statistical Machine-Translation to larger Corpora and longer Phrases," in Proc. of ACL, 2005, pp. 255-262.
14. Y. Zhang and S. Vogel, "An Efficient Phrase-to-Phrase Alignment Model for arbitrarily long Phrases and large Corpora," in Proc. of EAMT, 2005.
15. "NIST MT Competition," http://www.nist.gov/speech/tests/mt/.
16. E. M. McCreight, "A Space-Economical Suffix Tree Construction Algorithm," in Journal of the ACM, 23, 1976, pp. 262-272.
17. S. Büttcher and C. L. Clarke, "Index Compression is Good, Especially for Random Access," in In Proceedings of CIKM, 2007.
18. U. Feige, "A Threshold of ln n for Approximating Set Cover," Journal of the ACM, vol. 45, no. 4, pp. 634-652, 1998.
19. V. Chvatal, "A Greedy Heuristic for the Set-Covering Problem," Mathematics of Operations Research, vol. 4, pp. 233-235, 1979.
20. R. Hassin and A. Levin, "A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem," SIAM J. Comput., vol. 35, no. 1, pp. 189-200, 2005.
21. G. Navarro and V. Mäkinen, "Compressed full-text indexes," ACM Comput. Surv., vol. 39, no. 1, 2007.
22. A. Golynski, "Optimal Lower Bounds for Rank and Select Indexes," Theor. Comput. Sci., vol. 387, no. 3, 2007.
23. S. Vigna, "Broadword Implementation of Rank/Select Queries," LNCS, no. 5038, 2008.
24. G. Ausiello, A. Giannakos, and V. T. Paschos, "Greedy Algorithms for On-line Set-Covering and related Problems," in Proc. of CATS, 2006, pp. 145-151.
25. I. H. Witten, A. Moffat, and T. C. Bell, Managing Gigabytes - Compressing and Indexing Documents and Images. Morgan Kaufman Publishers, 1999.
26. "Intel VTune Performance Analyzer," http://www.intel.com/cd/ software/products/asmo-na/eng/vtune/.