565 search results - page 28 / 113 » Parallel Querying with Non-Dedicated Computers |
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de...
CCGRID
2004
IEEE
14 years 26 days ago
2004
IEEE
This paper is concerned with efficient querying of very large multi-resolution datasets on storage and compute clusters. We present a suite of services that support storage, index...
CCGRID
2005
IEEE
14 years 2 months ago
2005
IEEE
Efficient resource discovery based on dynamic attributes such as CPU utilization and available bandwidth is a crucial problem in the deployment of computing grids. Existing solut...
PDIS
1996
IEEE
14 years 1 months ago
1996
IEEE
Users today are struggling to integrate a broad range of information sources providing di erent levels of query capabilities. Currently, data sources with di erent and limitedcapa...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...