DATESO
2008
13 years 6 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
DAMON
2008
Springer
13 years 6 months ago
2008
Springer
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
PDIS
1994
IEEE
13 years 9 months ago
1994
IEEE
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
SIGMOD
1996
ACM
13 years 9 months ago
1996
ACM
This paper describes PBSM (Partition Based Spatial
ICPADS
2000
IEEE
13 years 9 months ago
2000
IEEE
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
Three join algorithms are evaluated in an environment with distributed main-memory based mediators and data sources. A streamed ship-out join ships bulks of tuples to a mediator ne...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
The MapReduce framework is increasingly being used to analyze large volumes of data. One important type of data analysis done with MapReduce is log processing, in which a click-st...
DASFAA
2010
IEEE
13 years 10 months ago
2010
IEEE
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...
GIS
2005
ACM
14 years 6 months ago
2005
ACM
When integrating geo-spatial datasets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). Algorithms for...