Shortest transitive edge relation presents an alternative to transitive closure relation for answering a class of complex biological queries that requires connectivity information but not the full transitive closure. A biological querie such “ find each downstream protein interacting with glutamine synthetase using five or fewer interactions ” does not require transitive closure. Shortest trans...

We present experiments exploring why high ability workers join teams with less able coworkers when there are no short-term financial benefits. distinguish between two explanations: prosocial preferences and expected long-term gains from teaching future teammates. Participants perform a real-effort task decide whether to work independently or two-person team. Treatments vary the payment scheme (...

In this paper we experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-)hash join. The relative performance of these two join approaches have been a topic of discussion for a long time. With the advent of modern multicore architectures, it has been argued that sort-merge join is now a better choice than radix-hash join. This...

This paper continues the study of the connection between hyper- groups and fuzzy sets, investigating the length of the sequence of join spaces associated with a hypergroup. The classes of complete hypergroups and of 1-hypergroups are considered and analyzed in this context. Finally, we give a method to construct a nite hypergroup with the strong fuzzy grade equal to a given natural number

We give an overview on how XQuery processing works in our native XML database system Natix. After a brief description of the query compiler we focus on the aspect of join ordering when generating query execution plans. Here we show that better plans can be found when extending the search space of the plan generator.