ERA

Download the full-sized PDF of TupleRank: Ranking Relational Databases using Random Walks on Extended K-partite GraphsDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3WS8HP9D

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

TupleRank: Ranking Relational Databases using Random Walks on Extended K-partite Graphs Open Access

Descriptions

Author or creator
Chen, Jiyang
Zaiane, Osmar R.
Goebel, Randy
Yu, Philip S.
Additional contributors
Subject/Keyword
Random Walk
Database Systems
database ranking
bipartite graph
Type of item
Computing Science Technical Report
Computing science technical report ID
TR09-02
Language
English
Place
Time
Description
Technical report TR09-02. The significant increase in open access digital information has created incredible opportunities for modern database research, especially in exploiting significant computational resources to determine complex relationships within those data. In this paper, we consider the problem of analyzing relational databases and explaining relationships between entities in order to rank tuples based on a notion of relevance. For this purpose, we propose a solution of a class of link analysis algorithms known as the random walk, which can be deployed to discover interesting relationships amongst partial tuples of relational databases that would otherwise be hard to expose. We focus on a shortcoming of the absence of a special kind of relationship, which we call \"returning relationship\". We demonstrate our ideas on the DBLP database, where we exploit structural variations on relationships between authors, conferences, topics, and co-authorships. We show how a distinction between normal relations and returning relations on objects within that database provides the basis for structuring a random walk algorithm to determine interesting relevance measures. We also show how structural changes in the organization of the random walk can produce novel results that are not attainable with previous database ranking methods.
Date created
2009
DOI
doi:10.7939/R3WS8HP9D
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-05-01T01:56:32.039+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 250148
Last modified: 2015:10:12 16:43:56-06:00
Filename: TR09-02.pdf
Original checksum: 7301fce5b285186cfd147368f66ab52b
Well formed: true
Valid: true
Page count: 26
Activity of users you follow
User Activity Date