625 search results - page 14 / 125 » Genetic algorithms for large join query optimization |
VLDB
1995
ACM
15 years 2 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
SSDBM
2007
IEEE
15 years 5 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
106
click to vote
VLDB
1989
ACM
15 years 3 months ago
1989
ACM
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
181
Voted
ICDE
2008
IEEE
16 years 11 days ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...