Search

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

1998

Goralwalla, Iqbal

Technical report TR98-04. Conventional databases represent the state of an enterprise at one particular point in time. That is, they contain only current data. As a database changes, out-of-date information, representing past states of the enterprise, is discarded. However, temporal support is a

requirement posed by many database applications, such as office information systems, engineering databases, and multimedia systems. Most of the research on modeling time has concentrated on the definition of a particular temporal model and its incorporation into a (relational or object-oriented) database