Sciweavers

297 search results - page 1 / 60
» Polynomial heuristics for query optimization
Sort
View
ICDE
2010
IEEE
233views Database» more  ICDE 2010»
13 years 10 months ago
Polynomial heuristics for query optimization
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
Nicolas Bruno, César A. Galindo-Legaria, Mi...
DEXA
1995
Springer
126views Database» more  DEXA 1995»
13 years 8 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 6 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
MDM
2004
Springer
138views Communications» more  MDM 2004»
13 years 10 months ago
Optimizing Data Placement over Wireless Broadcast Channel for Multi-Dimensional Range Query Processing
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
Jianting Zhang, Le Gruenwald
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 5 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu