Sciweavers

552 search results - page 26 / 111
» On the Complexity of Join Predicates
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 10 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
WWW
2010
ACM
14 years 5 months ago
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. A...
Medha Atre, Vineet Chaoji, Mohammed J. Zaki, James...
PARLE
1993
14 years 2 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
Robert Marek, Erhard Rahm
FUZZIEEE
2007
IEEE
14 years 4 months ago
Optimised Generalised Type-2 Join and Meet Operations
— The inferencing stage of a type-2 fuzzy inferencing system is driven by join and meet operations. As conventionally implemented these algorithms are computationally complex. Th...
Sarah Greenfield, Robert John
DAMON
2009
Springer
14 years 4 months ago
Spinning relations: high-speed networks for distributed join processing
By leveraging modern networking hardware (RDMA-enabled network cards), we can shift priorities in distributed database processing significantly. Complex and sophisticated mechani...
Philip Werner Frey, Romulo Goncalves, Martin L. Ke...