Sciweavers

1846 search results - page 121 / 370
» Generating query substitutions
Sort
View
TPDS
1998
114views more  TPDS 1998»
13 years 7 months ago
On the Automatic Parallelization of the Perfect Benchmarks
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
Rudolf Eigenmann, Jay Hoeflinger, David A. Padua
PPDP
2010
Springer
13 years 6 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 8 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 8 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
WWW
2010
ACM
14 years 1 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...