Sciweavers

1168 search results - page 15 / 234
» Optimization strategies for complex queries
Sort
View
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 2 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 9 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
EDBT
1992
ACM
111views Database» more  EDBT 1992»
13 years 11 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
DEXA
2005
Springer
112views Database» more  DEXA 2005»
14 years 1 months ago
Distribution Rules for Array Database Queries
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...
Alex van Ballegooij, Roberto Cornacchia, Arjen P. ...
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 7 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...