Sciweavers

297 search results - page 2 / 60
» Polynomial heuristics for query optimization
Sort
View
IDEAS
1999
IEEE
130views Database» more  IDEAS 1999»
13 years 9 months ago
A Heuristics-Based Approach to Query Optimization in Structured Document Databases
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
Dunren Che, Karl Aberer
PODS
1995
ACM
124views Database» more  PODS 1995»
13 years 9 months ago
Window Query-Optimal Clustering of Spatial Objects
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,...
Bernd-Uwe Pagel, Hans-Werner Six, Mario Winter
ICMCS
2000
IEEE
110views Multimedia» more  ICMCS 2000»
13 years 9 months ago
Multi-clip Query Optimization in Video Databases
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...
Ahmed Mostefaoui, Lionel Brunie, Harald Kosch, L&a...
ICDE
2007
IEEE
107views Database» more  ICDE 2007»
14 years 6 months ago
Robust Heuristics for Scalable Optimization of Complex SQL Queries
Gopal Chandra Das, Jayant R. Haritsa
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 9 months ago
On Optimal Node Splitting for R-trees
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...
Yván J. García, Mario A. Lopez, Scot...