297 search results - page 24 / 60 » Polynomial heuristics for query optimization |
SIGMOD
1996
ACM
13 years 12 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
DBPL
2007
Springer
14 years 1 months ago
2007
Springer
BPQL is a novel query language for querying business process specifications, introduced recently in [5, 6]. It is based on an intuitive business processes as rewriting systems, an...
ANOR
2005
13 years 7 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
SSD
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...