This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results-
2009
Goebel, Randy, Chen, Jiyang, Yu, Philip S., Zaiane, Osmar R.
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
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