8 search results - page 1 / 2 » Partial join order optimization in the paraccel analytic dat... |
178
Voted
SIGMOD
2009
ACM
16 years 18 days 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...
111
Voted
DKE
2006
15 years 12 days ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
110
click to vote
SIGMOD
2004
ACM
16 years 15 days ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
105
click to vote
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
115
Voted
SSDBM
2006
IEEE
15 years 6 months ago
2006
IEEE
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...