297 search results - page 2 / 60 » Polynomial heuristics for query optimization |
IDEAS
1999
IEEE
14 years 50 min ago
1999
IEEE
The number of documents published via WWW in form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of documents
PODS
1995
ACM
13 years 11 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
ICMCS
2000
IEEE
14 years 3 days ago
2000
IEEE
A multi-clip query requests multiple video clips. In this paper we address the multi-clip query optimization problem. We propose a new heuristics called Restricted Search Interval...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
VLDB
1998
ACM
13 years 12 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...