- Abstract:
-
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analyzing binary relations. We consider the question of generalizing link analysis methods for analyzing relational databases. To this aim, we provide a generalized ranking framework and address its practical implications. More specifically, we associate with each relational database and set of queries a unique weighted directed graph, which we call the database graph. We explore the properties of database graphs. In analogy to link analysis algorithms, which use the Web graph to rank web pages, we use the database graph to rank partial tuples. In this way we can, e.g., extend the PageRank link analysis algorithm to relational databases and give this extension a random querier interpretation. Similarly, we extend the HITS link analysis algorithm to relational databases. We conclude with some preliminary experimental results.
- Links To Paper
- 1st Link
- Bibtex format
- @InProceedings{EDI-INF-RR-0807,
- author = {
Floris Geerts
and Heikki Mannila
and Evimaria Terzi
},
- title = {Relational Link-Based Ranking},
- book title = {Proceedings of VLDB 2004 (Very Large Data Bases Conference)},
- publisher = {Morgan Kaufmann},
- year = 2004,
- month = {Sep},
- pages = {552-563},
- url = {http://www.vldb.org/conf/2004/RS15P1.PDF},
- }
|
