@inproceedings{balmin2004objectrank,
  abstract = {The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each node is ranked according to its authority with respect to the particular keywords. One can adjust the weight of global importance, the weight of each keyword of the query, the importance of a result actually containing the keywords versus being referenced by nodes containing them, and the volume of authority flow via each type of semantic connection. Novel performance challenges and opportunities are addressed. First, schemas impose constraints on the graph, which are exploited for performance purposes. Second, in order to address the issue of authority ranking with respect to the given keywords (as opposed to Google's global PageRank) we precompute single keyword ObjectRanks and combine them during run time. We conducted user surveys and a set of performance experiments on multiple real and synthetic datasets, to assess the semantic meaningfulness and performance of ObjectRank.},
  author = {Balmin, Andrey and Hristidis, Vagelis and Papakonstantinou, Yannis},
  booktitle = {VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases},
  interhash = {efd9340c271ab9a06e838e2f41bb7197},
  intrahash = {205f3b36bce9a060512e1c6187a30f24},
  isbn = {0-12-088469-0},
  location = {Toronto, Canada},
  pages = {564--575},
  publisher = {VLDB Endowment},
  title = {Objectrank: authority-based keyword search in databases},
  url = {http://portal.acm.org/citation.cfm?id=1316739},
  year = 2004
}