Context-sensitive ranking

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2006, Pages 383-394

  Agrawal, Rakesh ^a   Rantzau, Ralf ^b   Terzi, Evimaria ^c  

^a MICROSOFT RESEARCH   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Preferences; Ranking

Indexed keywords

ALGORITHMS; DATA STRUCTURES; QUERY PROCESSING;

CONTEXTUAL PREFERENCES; OFF-LINE PREPROCESSING STEP;

CONTEXT SENSITIVE LANGUAGES;

EID: 34250626906     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142473.1142517     Document Type: Conference Paper

References (34)

1. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In SIGMOD, pages 207-216, 1993.
2. R. Agrawal and E. L. Wimmers. A framework for expressing and combining preferences. In SIGMOD, pages 297-306, 2000.
3. S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis. Automated ranking of database query results. In CIDR, 2003.
4. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
5. B. Berger and P. W. Shor. Approximation algorithms for the maximum acyclic subgraph problem. In SODA, pages 236-243, 1990.
6. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, pages 431-440, 2002.
7. S. Borzsonyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421-430, 2001.
8. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7):107-117, 1998.
9. S. Chaudhuri, G. Das, V. Hristidis, and G. Weikum. Probabilistic ranking of database query results. In VLDB, pages 888-899, 2004.
10. J. Chomicki. Preference formulas in relational queries. ACM Trans. Database Syst., 28(4):427-466, 2003.
11. M. Chrobak, C. Kenyon, and N. E. Young. The reverse greedy algorithm for the metric k-median problem. In COCOON, 2005.
12. W. W. Cohen, R. E. Schapire, and Y. Singer. Learning to order things. In NIPS, 1997.
13. P. Diaconis and R. Graham. Spearman's footrule as a measure of disarray. J. of the Royal Statistical Society, 39(2):262-268, 1977.
14. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In WWW, pages 613-622, 2001.
15. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and aggregating rankings with ties. In PODS, pages 47-58, 2004.
16. R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. In SODA, pages 28-36, 2003.
17. R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In SIGMOD, pages 301-312, 2003.
18. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102-113, 2001.
19. F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552-563, 2004.
20. L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. XRANK: Ranked keyword search over XML documents. In SIGMOD, pages 16-27, 2003.
21. T. H. Haveliwala. Topic-sensitive pagerank. In WWW, pages 517-526, 2002.
22. D. S. Hochbaum and D. B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, pages 180-184, 1985.
23. A. Huang, Q. Xue, and J. Yang. Tuplerank and implicit relationship discovery in relational databases. In WAIM, 2003.
24. T. Kamishima and J. Fujiki. Clustering orders. In Discovery Science, pages 194-207, 2003.
25. W. Kießling. Foundations of preferences in database systems. In VLDB, pages 311-322, 2002.
26. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. In STOC, pages 473-482, 1998.
27. G. Koutrika and Y. Ioannidis. Constrained optimalities in query personalization. In SIGMOD, pages 73-84, 2005.
28. G. Koutrika and Y. E. Ioannidis. Personalization of queries in database systems. In ICDE, pages 597-608, 2004.
29. G. Koutrika and Y. E. Ioannidis. Personalized queries under a generalized preference model. In ICDE, pages 841-852, 2005.
30. K. Kummamuru, R. Krishnapuram, and R. Agrawal. On learning assymetric dissimilarity measures. In ICDM, 2005.
31. D. Papadias, Y. Tao, G. Fu, and B. Seeger. An optimal and progressive algorithm for skyline queries. In SIGMOD, pages 467-478, 2003.
32. M. Richardson and P. Domingos. The intelligent surfer: Probabilistic combination of link and content information in pagerank. In NIPS, pages 1441-1448, 2001.
33. M. Schultz and T. Joachims. Learning a distance metric from relative comparisons. In NIPS, 2003.
34. M. Yannakakis. Edge-deletion problems. SIAM J. Comput., 10(2):297-309, 1981.