147 search results - page 18 / 30 » Size Bounds and Query Plans for Relational Joins |
KR
2004
Springer
14 years 27 days ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
VLDB
1994
ACM
13 years 11 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
Set-valued attributes frequently occur in contexts like marketbasked analysis and stock market trends. Late research literature has mainly focused on set containment joins and dat...
ICDT
2001
ACM
13 years 12 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...