430 search results - page 9 / 86 » An Efficient Parallel Join Algorithm Based On Hypercube-Part... |
167
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
92
Voted
EDBTW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
174
Voted
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
128
click to vote
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
107
click to vote
AINA
2007
IEEE
15 years 3 months ago
2007
IEEE
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...