1007 search results - page 39 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
107
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
135
click to vote
ICPPW
2006
IEEE
15 years 8 months ago
2006
IEEE
Embedded computing architectures can be designed to meet a variety of application specific requirements. However, optimized hardware can require compiler support to realize the po...
129
Voted
MIDDLEWARE
2005
Springer
15 years 7 months ago
2005
Springer
These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and opt...
113
click to vote
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
128
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...