Ranking is a main research issue in IR-styled keyword search over a set of documents.In this paper,we study a new keyword search problem,called context-sensitive document ranking,which is to rank documents with an additional context that provides additional information about the application domain where the documents are to be searched and ranked.The work is motivated by the fact that additional information associated with the documents can possibly assist users to find more relevant documents when they are unable to find the needed documents from the documents alone.In this paper,a context is a multi-attribute graph,which can represent any information maintained in a relational database,where multi-attribute nodes represent tuples,and edges represent primary key and foreign key references among nodes.The context-sensitive ranking is related to several research issues,how to score documents,how to evaluate the combining the scores/costs from the documents and the context.More importantly,the relationships between documents and the information stored in a relational database may be uncertain,because they are from difierent data sources and the relationships are determined systematically using similarity match which causes uncertainty.In this paper,we concentrate ourselves on these research issues.and provide our solution on how to rank the documents in a context where there exist uncertainty between the documents and the context.We confirm the effectiveness of our approaches by conducting extensive experimental studies using real datasets.We present our findings in this paper.