Sciweavers

1007 search results - page 97 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
WWW
2008
ACM
16 years 3 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
SIGMOD
1999
ACM
107views Database» more  SIGMOD 1999»
15 years 7 months ago
Client-Site Query Extensions
We explore the execution of queries with client-site userdefined functions (UDFs). Many UDFs can only be executed at the client site, for reasons of scalability, security, confide...
Tobias Mayr, Praveen Seshadri
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
15 years 9 months ago
Querying DAG-shaped Execution Traces Through Views
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Maya Ben-Ari, Tova Milo, Elad Verbin
CODES
2005
IEEE
15 years 8 months ago
Iterational retiming: maximize iteration-level parallelism for nested loops
Nested loops are the most critical sections in many scientific and Digital Signal Processing (DSP) applications. It is important to study effective and efficient transformation ...
Chun Xue, Zili Shao, Meilin Liu, Edwin Hsing-Mean ...
JPDC
2010
137views more  JPDC 2010»
15 years 1 months ago
Parallel exact inference on the Cell Broadband Engine processor
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
Yinglong Xia, Viktor K. Prasanna