Sciweavers

TKDE
2010
393views more  TKDE 2010»
13 years 6 months ago
Adaptive Join Operators for Result Rate Optimization on Streaming Inputs
Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data is provided by autonomous data sources through heterogeneous network environ...
Mihaela A. Bornea, Vasilis Vassalos, Yannis Kotidi...
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
14 years 26 days ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
VLDB
1991
ACM
143views Database» more  VLDB 1991»
14 years 2 months ago
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
Kien A. Hua, Chiang Lee
PDIS
1993
IEEE
14 years 3 months ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
VLDB
1998
ACM
123views Database» more  VLDB 1998»
14 years 3 months ago
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships
Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their correspondin...
Sven Helmer, Till Westmann, Guido Moerkotte
EDBT
2010
ACM
141views Database» more  EDBT 2010»
14 years 4 months ago
Adaptive join processing in pipelined plans
In adaptive query processing, the way in which a query is evaluated is changed in the light of feedback obtained from the environment during query evaluation. Such feedback may, f...
Kwanchai Eurviriyanukul, Norman W. Paton, Alvaro A...
DEBS
2003
ACM
14 years 4 months ago
MJoin: a metadata-aware stream join operator
Join algorithms must be re-designed when processing stream data instead of persistently stored data. Data streams are potentially infinite and the query result is expected to be ...
Luping Ding, Elke A. Rundensteiner, George T. Hein...
FSTTCS
2004
Springer
14 years 4 months ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
DAMON
2009
Springer
14 years 6 months ago
Join processing for flash SSDs: remembering past lessons
Flash solid state drives (SSDs) provide an attractive alternative to traditional magnetic hard disk drives (HDDs) for DBMS applications. Naturally there is substantial interest in...
Jaeyoung Do, Jignesh M. Patel
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 11 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis