Article

Context-sensitive ranking

Authors:

Rakesh Agrawal,

Evimaria TerziAuthors Info & Claims

SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data

Pages 383 - 394

https://doi.org/10.1145/1142473.1142517

Published: 27 June 2006 Publication History

Abstract

Contextual preferences take the form that item i1 is preferred to item i₂ in the context of X. For example, a preference might state the choice for Nicole Kidman over Penelope Cruz in drama movies, whereas another preference might choose Penelope Cruz over Nicole Kidman in the context of Spanish dramas. Various sources provide preferences independently and thus preferences may contain cycles and contradictions. We reconcile democratically the preferences accumulated from various sources and use them to create a priori orderings of tuples in an off-line preprocessing step. Only a few representative orders are saved, each corre-sponding to a set of contexts. These orders and associated contexts are used at query time to expeditiously provide ranked answers. We formally define contextual preferences, provide algorithms for creating orders and processing queries, and present experimental results that show their efficacy and practical utility.

References

[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.

Digital Library

[2]

R. Agrawal and E. L. Wimmers. A framework for expressing and combining preferences. In SIGMOD, pages 297--306, 2000.

Digital Library

[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.

Digital Library

[5]

B. Berger and P. W. Shor. Approximation algorithms for the maximum acyclic subgraph problem. In SODA, pages 236--243, 1990.

Digital Library

[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.

Digital Library

[7]

S. Borzsonyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421--430, 2001.

Digital Library

[8]

S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7):107--117, 1998.

Digital Library

[9]

S. Chaudhuri, G. Das, V. Hristidis, and G. Weikum. Probabilistic ranking of database query results. In VLDB, pages 888--899, 2004.

Digital Library

[10]

J. Chomicki. Preference formulas in relational queries. ACM Trans. Database Syst., 28(4):427--466, 2003.

Digital Library

[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.

Digital Library

[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.

Digital Library

[15]

R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and aggregating rankings with ties. In PODS, pages 47--58, 2004.

Digital Library

[16]

R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. In SODA, pages 28--36, 2003.

Digital Library

[17]

R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In SIGMOD, pages 301--312, 2003.

Digital Library

[18]

R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102--113, 2001.

Digital Library

[19]

F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552--563, 2004.

Digital Library

[20]

L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. XRANK: Ranked keyword search over XML documents. In SIGMOD, pages 16--27, 2003.

Digital Library

[21]

T. H. Haveliwala. Topic-sensitive pagerank. In WWW, pages 517--526, 2002.

Digital Library

[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. KieBling. Foundations of preferences in database systems. In VLDB, pages 311--322, 2002.

Digital Library

[26]

J. Kleinberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. In STOC, pages 473--482, 1998.

Digital Library

[27]

G. Koutrika and Y. Ioannidis. Constrained optimalities in query personalization. In SIGMOD, pages 73--84, 2005.

Digital Library

[28]

G. Koutrika and Y. E. Ioannidis. Personalization of queries in database systems. In ICDE, pages 597--608, 2004.

Digital Library

[29]

G. Koutrika and Y. E. Ioannidis. Personalized queries under a generalized preference model. In ICDE, pages 841--852, 2005.

Digital Library

[30]

K. Kummamuru, R. Krishnapuram, and R. Agrawal. On learning assymetric dissimilarity measures. In ICDM, 2005.

Digital Library

[31]

D. Papadias, Y. Tao, G. Fu, and B. Seeger. An optimal and progressive algorithm for skyline queries. In SIGMOD, pages 467--478, 2003.

Digital Library

[32]

M. Richardson and P. Domingos. The intelligent surfer: Probabilistic combination of link and content information in pagerank. In NIPS, pages 1441--1448, 2001.

Digital Library

[33]

M. Schultz and T. Joachims. Learning a distance metric from relative comparisons. In NIPS, 2003.

Digital Library

[34]

M. Yannakakis. Edge-deletion problems. SIAM J. Comput., 10(2):297--309, 1981.

Digital Library

Cited By

Bai LZhu L(2023)Query Relaxation for Uncertain Spatiotemporal XML DataUncertain Spatiotemporal Data Management for the Semantic Web10.4018/978-1-6684-9108-9.ch020(463-483)Online publication date: 15-Dec-2023
https://doi.org/10.4018/978-1-6684-9108-9.ch020
Hamdi GOmri M(2023)Personalized OLAP queries under Hierarchical Visualization Constraint*2023 International Conference on Innovations in Intelligent Systems and Applications (INISTA)10.1109/INISTA59065.2023.10310545(1-6)Online publication date: 20-Sep-2023
https://doi.org/10.1109/INISTA59065.2023.10310545
Hamdi GOmri M(2023)A Personalized Multidimensional Navigation in a Limited Visualization Context2023 International Conference on Cyberworlds (CW)10.1109/CW58918.2023.00018(54-61)Online publication date: 3-Oct-2023
https://doi.org/10.1109/CW58918.2023.00018
Show More Cited By

Index Terms

Context-sensitive ranking
1. Information systems
  1. Information systems applications

Recommendations

Context-sensitive ranking for document retrieval
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by domain-interested users. The motivation of context-sensitive search is that ...
A new ranking procedure by incomplete pairwise comparisons using preference subsets

A method for ranking of alternatives or objects and its extensions by incomplete pairwise comparisons using random set theory are proposed in the paper. The main feature of the method is that it allows us to deal with comparisons of arbitrary groups of ...
Partial Ranking by Incomplete Pairwise Comparisons Using Preference Subsets
BELIEF 2014: Proceedings of the Third International Conference on Belief Functions: Theory and Applications - Volume 8764

In multi-criteria decision making the decision maker need to assign weights to criteria for evaluation of alternatives, but decision makers usually find it difficult to assign precise weights to several criteria. On the other hand, decision makers may ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data

June 2006

830 pages

ISBN:1595934340

DOI:10.1145/1142473

General Chairs:
Clement Yu
University of Illinois at Chicago
,
Peter Scheuermann
Northwestern University
,
Program Chair:
Surajit Chaudhuri
Microsoft Research

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 June 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGMOD/PODS06

Sponsor:

SIGMOD/PODS06: International Conference on Management of Data and Symposium on Principles Database and Systems

June 27 - 29, 2006

IL, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

84
Total Citations
View Citations
1,093
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)2

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bai LZhu L(2023)Query Relaxation for Uncertain Spatiotemporal XML DataUncertain Spatiotemporal Data Management for the Semantic Web10.4018/978-1-6684-9108-9.ch020(463-483)Online publication date: 15-Dec-2023
https://doi.org/10.4018/978-1-6684-9108-9.ch020
Hamdi GOmri M(2023)Personalized OLAP queries under Hierarchical Visualization Constraint*2023 International Conference on Innovations in Intelligent Systems and Applications (INISTA)10.1109/INISTA59065.2023.10310545(1-6)Online publication date: 20-Sep-2023
https://doi.org/10.1109/INISTA59065.2023.10310545
Hamdi GOmri M(2023)A Personalized Multidimensional Navigation in a Limited Visualization Context2023 International Conference on Cyberworlds (CW)10.1109/CW58918.2023.00018(54-61)Online publication date: 3-Oct-2023
https://doi.org/10.1109/CW58918.2023.00018
Marathe A(2023)Towards intelligent database systems using clusters of SQL transactionsKnowledge and Information Systems10.1007/s10115-023-01850-565:7(2863-2894)Online publication date: 16-Mar-2023
https://doi.org/10.1007/s10115-023-01850-5
Bai LWang JZhang CMeng X(2022)Query Relaxation and Result Ranking for Uncertain Spatiotemporal XML DataJournal of Database Management10.4018/JDM.31397033:1(1-19)Online publication date: 1-Jan-2022
https://doi.org/10.4018/JDM.313970
Calautti MGreco SMolinaro CTrubitsyna I(2022)Preference-based inconsistency-tolerant query answering under existential rulesArtificial Intelligence10.1016/j.artint.2022.103772312(103772)Online publication date: Nov-2022
https://doi.org/10.1016/j.artint.2022.103772
Yousaf AKhattak AKhan K(2021)Ontology Evolution Using Recoverable SQL LogsService-Oriented Computing – ICSOC 2020 Workshops10.1007/978-3-030-76352-7_46(509-517)Online publication date: 30-May-2021
https://doi.org/10.1007/978-3-030-76352-7_46
Bai LDuan XQin B(2021) Adaptive query relaxation and top‐ k result sorting of fuzzy spatiotemporal data based on XML International Journal of Intelligent Systems10.1002/int.22781Online publication date: 13-Dec-2021
https://doi.org/10.1002/int.22781
Ciaccia PMartinenghi DTorlone R(2020)Foundations of Context-aware Preference PropagationJournal of the ACM10.1145/337571367:1(1-43)Online publication date: 15-Jan-2020
https://dl.acm.org/doi/10.1145/3375713
Liu JLiu CBelkin N(2020)Personalization in text information retrievalJournal of the Association for Information Science and Technology10.1002/asi.2423471:3(349-369)Online publication date: 28-Jan-2020
https://dl.acm.org/doi/10.1002/asi.24234
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents