Sciweavers

6004 search results - page 357 / 1201
» Parallelizing query optimization
Sort
View
100
Voted
IPPS
2006
IEEE
15 years 7 months ago
An experimental study of optimizing bioinformatics applications
As bioinformatics is an emerging application of high performance computing, this paper first evaluates the memory performance of several representative bioinformatics application...
Guangming Tan, Lin Xu, Shengzhong Feng, Ninghui Su...
82
Voted
IPPS
2002
IEEE
15 years 6 months ago
Distribution Sweeping on Clustered Machines with Hierarchical Memories
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
16 years 2 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
VLDB
2002
ACM
139views Database» more  VLDB 2002»
16 years 1 months ago
TIMBER: A native XML database
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
H. V. Jagadish, Shurug Al-Khalifa, Adriane Chapman...
169
Voted
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
16 years 1 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe