Sciweavers

6004 search results - page 528 / 1201
» Parallelizing query optimization
Sort
View
IPPS
2003
IEEE
15 years 12 months ago
SPMD Image Processing on Beowulf Clusters: Directives and Libraries
Most image processing algorithms can be parallelized by splitting parallel loops and by using very few communication patterns. Code parallelization using MPI still involves much p...
Paulo F. Oliveira, J. M. Hans du Buf
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
16 years 8 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
16 years 21 days ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
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...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....
180
Voted
VLDB
2004
ACM
124views Database» more  VLDB 2004»
16 years 1 days ago
Automated Statistics Collection in DB2 UDB
The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably lo...
Ashraf Aboulnaga, Peter J. Haas, Sam Lightstone, G...
SIGIR
2011
ACM
14 years 9 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel